schema_version: 1
contribution_id: con_c3201ce963ba4a30a0a328eb1c168ce8
revision_id: rev_5bf3ce70b3ac41c2806f72c07c2bb160
expected_predecessor: null
type: attempt
home_problem_id: prb_150e36be4869460cbcfe4054c84a6f03
targets:
- target_kind: problem
  problem_id: prb_150e36be4869460cbcfe4054c84a6f03
  statement_revision_id: stm_27ba1493be604c91a75c420c8f4f88b6
  scope: whole_statement
title: Literature report on TOP-30003992
profiles:
- id: mathematical_argument
  version: 1
  required: true
claim:
  type: literature_report
  scope_statement: Rohatgi (2019) explicitly gives an OVC-conditional negative answer to Basu's proposed uniform general-rank exact $O(nr^2\log n)$ assignment bound. This report identifies that published answer and its input/model qualifications. It does not settle fixed rank two, give an unconditional lower bound, or claim a new theorem.
  assumptions: []
  limitations: []
attribution:
  submitter:
    person_ref: per_c8d731d4cf114ef18921a77c3f92dee7
    github_id: 51691872
    login_at_event: yuningyang19
    display_name: yuningyang19
    roles:
    - submission
    - prompting
    authorship_confirmation: confirmed
  humans:
  - person_ref: per_c8d731d4cf114ef18921a77c3f92dee7
    github_id: 51691872
    login_at_event: yuningyang19
    display_name: yuningyang19
    roles:
    - prompting
    - submission
    authorship_confirmation: confirmed
  organisations: []
  contribution_mode: ai_only
model_uses:
- provider: openai
  declared_name: gpt 6.1 sol
  family: null
  version: unknown (logged model identifier gpt-6.1-sol)
  role: review_assistance
  settings:
    thinking_level: medium, then high
    thinking_time: unknown
  generation_date: null
  provenance:
    level: declared
    evidence:
    - kind: statement
      note: |-
        The original Medium-setting work was checked by a separate, fresh OpenAI gpt-6.1-sol context at **High**, a listed qualifying model/setting. Provider, model identifier and effort were verified from that review session's own metadata; exact serving revision and time budget are unknown. The reviewer did not draft this report. No previously demonstrated multi-agent architecture is claimed.

        The independent check returned **PASS for mathematical/source correspondence**: Basu's complete original question; Rohatgi's literal Theorem 2 and OVC statement; Appendix A/Theorem 18, squared costs, explicit factors and dimension overhead; maximum/minimum and cost/permutation distinctions; fixed-rank-two limitations; and the absence of this citation in the earlier archive contribution. The reviewer independently refetched the primary sources linked in References and matched their bytes to those inspected for this report. This check does not re-prove all external hardness results or certify an exhausti
    - kind: statement
      note: |-
        ve literature search.

        For an exact scope identifier, the reviewed Write-up text (UTF-8, from its first paragraph through its final paragraph, one final newline) has SHA-256 `0dad456a5f3ac69a9d82f8cc58317b35480ca87f6a9753d2a23b5c7986c958b1`. This field records the public review summary; raw session logs and private research notes are not submitted.
- provider: openai
  declared_name: gpt 6 astra
  family: null
  version: unknown (logged model identifier gpt-6-astra)
  role: review_assistance
  settings:
    thinking_level: medium
    thinking_time: unknown
  generation_date: null
  provenance:
    level: declared
    evidence:
    - kind: statement
      note: |-
        The original Medium-setting work was checked by a separate, fresh OpenAI gpt-6.1-sol context at **High**, a listed qualifying model/setting. Provider, model identifier and effort were verified from that review session's own metadata; exact serving revision and time budget are unknown. The reviewer did not draft this report. No previously demonstrated multi-agent architecture is claimed.

        The independent check returned **PASS for mathematical/source correspondence**: Basu's complete original question; Rohatgi's literal Theorem 2 and OVC statement; Appendix A/Theorem 18, squared costs, explicit factors and dimension overhead; maximum/minimum and cost/permutation distinctions; fixed-rank-two limitations; and the absence of this citation in the earlier archive contribution. The reviewer independently refetched the primary sources linked in References and matched their bytes to those inspected for this report. This check does not re-prove all external hardness results or certify an exhausti
    - kind: statement
      note: |-
        ve literature search.

        For an exact scope identifier, the reviewed Write-up text (UTF-8, from its first paragraph through its final paragraph, one final newline) has SHA-256 `0dad456a5f3ac69a9d82f8cc58317b35480ca87f6a9753d2a23b5c7986c958b1`. This field records the public review summary; raw session logs and private research notes are not submitted.
lineage: []
artifacts:
- role: manuscript
  location: in_repository
  path: files/attempt.md
  media_type: text/markdown
- role: supplementary
  location: in_repository
  path: files/disclosures.md
  media_type: text/markdown
rights:
  licence: CC-BY-4.0
  redistribution: permitted
  holders:
  - yuningyang19
declarations:
  rights:
    confirmed: true
    source: form_field
    actor: per_c8d731d4cf114ef18921a77c3f92dee7
    recorded_at: '2026-10-19T08:00:31Z'
    evidence_url: https://github.com/We-Solve/research/issues/351
  public_disclosure:
    confirmed: true
    source: form_field
    actor: per_c8d731d4cf114ef18921a77c3f92dee7
    recorded_at: '2026-10-19T08:00:31Z'
    evidence_url: https://github.com/We-Solve/research/issues/351
  ai_disclosure:
    confirmed: true
    source: form_field
    actor: per_c8d731d4cf114ef18921a77c3f92dee7
    recorded_at: '2026-10-19T08:00:31Z'
    evidence_url: https://github.com/We-Solve/research/issues/351