{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E3GNFFPLZHRAKICAO3PBIEF7U3","short_pith_number":"pith:E3GNFFPL","schema_version":"1.0","canonical_sha256":"26ccd295ebc9e205204076de1410bfa6d84f4e33da10e5a0587e5abf0bb34d02","source":{"kind":"arxiv","id":"1605.01982","version":1},"attestation_state":"computed","paper":{"title":"On a conjecture of Stein","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dani Kotlar, Eli Berger, Ran Ziv, Ron Aharoni","submitted_at":"2016-05-06T15:57:07Z","abstract_excerpt":"Stein proposed the following conjecture: if the edge set of $K_{n,n}$ is partitioned into $n$ sets, each of size $n$, then there is a partial rainbow matching of size $n-1$. He proved that there is a partial rainbow matching of size $n(1-\\frac{D_n}{n!})$, where $D_n$ is the number of derangements of $[n]$. This means that there is a partial rainbow matching of size about $(1- \\frac{1}{e})n$. Using a topological version of Hall's theorem we improve this bound to $\\frac{2}{3}n$."},"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":"1605.01982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T15:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"3b8424a0c8480747d802db5b9111da884970fcc0b8ac21881c3f718d3d9e0b85","abstract_canon_sha256":"34a95e39fead0f156abc9ce0965f233b5cc6798d094a9fe9a2cc2d49f1f7d5b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:30.733616Z","signature_b64":"ZY3lIGA+b+2knJWGIZp0CKvVf+6OpFdXPk1cxcFVPMn475orSxemi5PfWX8A1/JTQeomDj56/sBbGmlHoh1nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26ccd295ebc9e205204076de1410bfa6d84f4e33da10e5a0587e5abf0bb34d02","last_reissued_at":"2026-05-18T01:15:30.732845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:30.732845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a conjecture of Stein","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dani Kotlar, Eli Berger, Ran Ziv, Ron Aharoni","submitted_at":"2016-05-06T15:57:07Z","abstract_excerpt":"Stein proposed the following conjecture: if the edge set of $K_{n,n}$ is partitioned into $n$ sets, each of size $n$, then there is a partial rainbow matching of size $n-1$. He proved that there is a partial rainbow matching of size $n(1-\\frac{D_n}{n!})$, where $D_n$ is the number of derangements of $[n]$. This means that there is a partial rainbow matching of size about $(1- \\frac{1}{e})n$. Using a topological version of Hall's theorem we improve this bound to $\\frac{2}{3}n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01982","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":""},"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":"1605.01982","created_at":"2026-05-18T01:15:30.732970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01982v1","created_at":"2026-05-18T01:15:30.732970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01982","created_at":"2026-05-18T01:15:30.732970+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3GNFFPLZHRA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3GNFFPLZHRAKICA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3GNFFPL","created_at":"2026-05-18T12:30:12.583610+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/E3GNFFPLZHRAKICAO3PBIEF7U3","json":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3.json","graph_json":"https://pith.science/api/pith-number/E3GNFFPLZHRAKICAO3PBIEF7U3/graph.json","events_json":"https://pith.science/api/pith-number/E3GNFFPLZHRAKICAO3PBIEF7U3/events.json","paper":"https://pith.science/paper/E3GNFFPL"},"agent_actions":{"view_html":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3","download_json":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3.json","view_paper":"https://pith.science/paper/E3GNFFPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01982&json=true","fetch_graph":"https://pith.science/api/pith-number/E3GNFFPLZHRAKICAO3PBIEF7U3/graph.json","fetch_events":"https://pith.science/api/pith-number/E3GNFFPLZHRAKICAO3PBIEF7U3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3/action/storage_attestation","attest_author":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3/action/author_attestation","sign_citation":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3/action/citation_signature","submit_replication":"https://pith.science/pith/E3GNFFPLZHRAKICAO3PBIEF7U3/action/replication_record"}},"created_at":"2026-05-18T01:15:30.732970+00:00","updated_at":"2026-05-18T01:15:30.732970+00:00"}