{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QQRTULQGOGJZEWWZFY7QKFURBV","short_pith_number":"pith:QQRTULQG","schema_version":"1.0","canonical_sha256":"84233a2e067193925ad92e3f0516910d79d8f722e0368c529bde3ba575e6d54f","source":{"kind":"arxiv","id":"2412.05891","version":2},"attestation_state":"computed","paper":{"title":"A note on finding large transversals efficiently","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Anastos, Patrick Morris","submitted_at":"2024-12-08T11:08:28Z","abstract_excerpt":"In an $n \\times n$ array filled with symbols, a transversal is a collection of entries with distinct rows, columns and symbols. In this note we show that if no symbol appears more than $\\beta n$ times, the array contains a transversal of size $(1-\\beta/4-o(1))n$. In particular, if the array is filled with $n$ symbols, each appearing $n$ times (an equi-$n$ square), we get transversals of size $(3/4-o(1))n$. Moreover, our proof gives a deterministic algorithm with polynomial running time, that finds these transversals."},"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":"2412.05891","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-08T11:08:28Z","cross_cats_sorted":[],"title_canon_sha256":"4012cc367c1de818eba49ede53b4594fb8d34f7f14f44f5ab8b4b0df4acda77c","abstract_canon_sha256":"7ab25666c520e6f84918694b5f807dc9080118e451db0c682b3a44dca90c85ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:44.163412Z","signature_b64":"RuehwYNPpXKda2D99wQsUiMoD8vhHvWTI7vZNJgeIA5/mms/meRCiu56jfnjVP+fTPlusB3lzXbVKrVOed3vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84233a2e067193925ad92e3f0516910d79d8f722e0368c529bde3ba575e6d54f","last_reissued_at":"2026-06-23T03:13:44.162907Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:44.162907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on finding large transversals efficiently","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Anastos, Patrick Morris","submitted_at":"2024-12-08T11:08:28Z","abstract_excerpt":"In an $n \\times n$ array filled with symbols, a transversal is a collection of entries with distinct rows, columns and symbols. In this note we show that if no symbol appears more than $\\beta n$ times, the array contains a transversal of size $(1-\\beta/4-o(1))n$. In particular, if the array is filled with $n$ symbols, each appearing $n$ times (an equi-$n$ square), we get transversals of size $(3/4-o(1))n$. Moreover, our proof gives a deterministic algorithm with polynomial running time, that finds these transversals."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05891","kind":"arxiv","version":2},"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/2412.05891/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":"2412.05891","created_at":"2026-06-23T03:13:44.162966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.05891v2","created_at":"2026-06-23T03:13:44.162966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05891","created_at":"2026-06-23T03:13:44.162966+00:00"},{"alias_kind":"pith_short_12","alias_value":"QQRTULQGOGJZ","created_at":"2026-06-23T03:13:44.162966+00:00"},{"alias_kind":"pith_short_16","alias_value":"QQRTULQGOGJZEWWZ","created_at":"2026-06-23T03:13:44.162966+00:00"},{"alias_kind":"pith_short_8","alias_value":"QQRTULQG","created_at":"2026-06-23T03:13:44.162966+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV","json":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV.json","graph_json":"https://pith.science/api/pith-number/QQRTULQGOGJZEWWZFY7QKFURBV/graph.json","events_json":"https://pith.science/api/pith-number/QQRTULQGOGJZEWWZFY7QKFURBV/events.json","paper":"https://pith.science/paper/QQRTULQG"},"agent_actions":{"view_html":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV","download_json":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV.json","view_paper":"https://pith.science/paper/QQRTULQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.05891&json=true","fetch_graph":"https://pith.science/api/pith-number/QQRTULQGOGJZEWWZFY7QKFURBV/graph.json","fetch_events":"https://pith.science/api/pith-number/QQRTULQGOGJZEWWZFY7QKFURBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV/action/storage_attestation","attest_author":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV/action/author_attestation","sign_citation":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV/action/citation_signature","submit_replication":"https://pith.science/pith/QQRTULQGOGJZEWWZFY7QKFURBV/action/replication_record"}},"created_at":"2026-06-23T03:13:44.162966+00:00","updated_at":"2026-06-23T03:13:44.162966+00:00"}