{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4Z5FRKB2FLM3LCG37FFNKG37QW","short_pith_number":"pith:4Z5FRKB2","schema_version":"1.0","canonical_sha256":"e67a58a83a2ad9b588dbf94ad51b7f85bd5d544f80028f4c4c07f058c12e9a92","source":{"kind":"arxiv","id":"2310.19779","version":1},"attestation_state":"computed","paper":{"title":"A proof of the Ryser-Brualdi-Stein conjecture for large even $n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2023-10-30T17:46:58Z","abstract_excerpt":"A Latin square of order $n$ is an $n$ by $n$ grid filled using $n$ symbols so that each symbol appears exactly once in each row and column. A transversal in a Latin square is a collection of cells which share no symbol, row or column. The Ryser-Brualdi-Stein conjecture, with origins from 1967, states that every Latin square of order $n$ contains a transversal with $n-1$ cells, and a transversal with $n$ cells if $n$ is odd. Keevash, Pokrovskiy, Sudakov and Yepremyan recently improved the long-standing best known bounds towards this conjecture by showing that every Latin square of order $n$ has"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.19779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-30T17:46:58Z","cross_cats_sorted":[],"title_canon_sha256":"f21d5f5ddcdfb485177c93c93a370f78029747f436bc5411ffb883f02085310b","abstract_canon_sha256":"e520cf9afbf1fc2447c7885bb91f6d3a75b3d5b7dc1d100ba589e4f15c377dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:54.931875Z","signature_b64":"uvJPbnMagNvSWxwqqiRXKadinjIBlzjJjF87aszQe8Je8UsyDKQ7qSkvOF7yTiHPAqAS7jhOd7GFs+D23DQ3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e67a58a83a2ad9b588dbf94ad51b7f85bd5d544f80028f4c4c07f058c12e9a92","last_reissued_at":"2026-07-05T07:06:54.931393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:54.931393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of the Ryser-Brualdi-Stein conjecture for large even $n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2023-10-30T17:46:58Z","abstract_excerpt":"A Latin square of order $n$ is an $n$ by $n$ grid filled using $n$ symbols so that each symbol appears exactly once in each row and column. A transversal in a Latin square is a collection of cells which share no symbol, row or column. The Ryser-Brualdi-Stein conjecture, with origins from 1967, states that every Latin square of order $n$ contains a transversal with $n-1$ cells, and a transversal with $n$ cells if $n$ is odd. Keevash, Pokrovskiy, Sudakov and Yepremyan recently improved the long-standing best known bounds towards this conjecture by showing that every Latin square of order $n$ has"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19779","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.19779/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.19779","created_at":"2026-07-05T07:06:54.931452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19779v1","created_at":"2026-07-05T07:06:54.931452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19779","created_at":"2026-07-05T07:06:54.931452+00:00"},{"alias_kind":"pith_short_12","alias_value":"4Z5FRKB2FLM3","created_at":"2026-07-05T07:06:54.931452+00:00"},{"alias_kind":"pith_short_16","alias_value":"4Z5FRKB2FLM3LCG3","created_at":"2026-07-05T07:06:54.931452+00:00"},{"alias_kind":"pith_short_8","alias_value":"4Z5FRKB2","created_at":"2026-07-05T07:06:54.931452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31398","citing_title":"Universality for rainbow oriented cycles in perturbed digraphs","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2412.01121","citing_title":"Transversal Structures in Graph Systems: A Survey","ref_index":113,"is_internal_anchor":false},{"citing_arxiv_id":"2506.17652","citing_title":"Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09449","citing_title":"Colour-balanced subgraphs","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW","json":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW.json","graph_json":"https://pith.science/api/pith-number/4Z5FRKB2FLM3LCG37FFNKG37QW/graph.json","events_json":"https://pith.science/api/pith-number/4Z5FRKB2FLM3LCG37FFNKG37QW/events.json","paper":"https://pith.science/paper/4Z5FRKB2"},"agent_actions":{"view_html":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW","download_json":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW.json","view_paper":"https://pith.science/paper/4Z5FRKB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19779&json=true","fetch_graph":"https://pith.science/api/pith-number/4Z5FRKB2FLM3LCG37FFNKG37QW/graph.json","fetch_events":"https://pith.science/api/pith-number/4Z5FRKB2FLM3LCG37FFNKG37QW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW/action/storage_attestation","attest_author":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW/action/author_attestation","sign_citation":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW/action/citation_signature","submit_replication":"https://pith.science/pith/4Z5FRKB2FLM3LCG37FFNKG37QW/action/replication_record"}},"created_at":"2026-07-05T07:06:54.931452+00:00","updated_at":"2026-07-05T07:06:54.931452+00:00"}