# Original contributor disclosures

Transcribed from the original public submission. Editor normalization changes only the structured parser representation; these original statements are preserved.

### Who did the work

LLM only (people only prompted or submitted)

### Models used

OpenAI GPT 6.1 Sol, OpenAI GPT 6 Astra

### Thinking level / time

Mixed (specified per model below)

### Other LLMs

_No response_

### Per-model versions, thinking and roles

OpenAI gpt-6-astra | version: unknown (logged model identifier gpt-6-astra) | thinking: medium | time: unknown | role: original literature investigation and research material generation; separate parent context reviewed that material.

OpenAI gpt-6.1-sol | version: unknown (logged model identifier gpt-6.1-sol) | thinking: medium, then high | time: unknown | role: submission preflight at medium; source recheck, concise literature-report assembly and submission preparation at high; a separate fresh context at high independently checked this report and its cited source correspondence (not its own draft).

### Model eligibility and verification evidence

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 exhaustive 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.

### People and roles

@yuningyang19: initiated the investigation, authorized this single-topic public literature report, and requested an independent eligible-model review before submission. No human mathematical verification is claimed.

### References

[1] Amitabh Basu, “Open Problem: Maximum weighted assignment problem,” in *Combinatorial Optimization*, Oberwolfach Report 50/2018, p. 3012. [DOI](https://doi.org/10.4171/owr/2018/50). Used: the complete original short problem, including rank-one sorting, rank two, and the general-rank target.

[2] Dhruv Rohatgi, *Conditional Hardness of Earth Mover Distance*, APPROX/RANDOM 2019, LIPIcs 145, 12:1–12:17. [DOI](https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.12). Used: the OVC statement in §1.1.1, the discussion and Theorem 2 on p. 12:3, and Appendix A / Theorem 18 and its reduction. This is a source-correspondence report, not independent re-verification of every external theorem used by the paper.

[3] we-solve, [TOP-30003992 problem page](https://we-solve.github.io/problems/fast-low-rank-maximum-weight-assignment/) and [official prompt](https://we-solve.github.io/prompts/TOP-30003992.txt), checked 19 October 2026. Used: canonical handle, statement, input-model qualification, and current contribution listing.

[4] we-solve, [CS-354-A1, revision r1](https://we-solve.github.io/contributions/fast-low-rank-maximum-weight-assignment/attempt-1/r1/), 11 October 2026. Complete text checked. Used: comparison with the recorded entry-query and sorting exploration; its advertised model configuration is not evidence of review of this report.

### Declarations

- [X] I have the right to publish this material under CC BY 4.0 (software Apache-2.0), and third-party material is credited.
- [X] I understand that this issue and its contents are public immediately.
- [X] Every LLM and person involved is listed, with versions or "unknown".