{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q3WLDGURUZY43PCQJCD3BHTMJL","short_pith_number":"pith:Q3WLDGUR","schema_version":"1.0","canonical_sha256":"86ecb19a91a671cdbc504887b09e6c4ac5a3ffc50b6088e6fbf55661a2c3acd3","source":{"kind":"arxiv","id":"1511.05775","version":1},"attestation_state":"computed","paper":{"title":"Uniqueness of the extreme cases in theorems of Drisko and Erd\\H{o}s-Ginzburg-Ziv","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dani Kotlar, Ran Ziv, Ron Aharoni","submitted_at":"2015-11-18T13:46:44Z","abstract_excerpt":"Drisko \\cite{drisko} proved (essentially) that every family of $2n-1$ matchings of size $n$ in a bipartite graph possesses a partial rainbow matching of size $n$. In \\cite{bgs} this was generalized as follows: Any $\\lfloor \\frac{k+2}{k+1} n \\rfloor -(k+1)$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n-k$. We extend this latter result to matchings of not necessarily equal cardinalities.\n  Settling a conjecture of Drisko, we characterize those families of $2n-2$ matchings of size $n$ in a bipartite graph that do not possess a rainbow matching of size $n$. Combinin"},"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":"1511.05775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-18T13:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"de125b148a551a784811570c710b945623fa19eb64e20270fdeb5599caaffe04","abstract_canon_sha256":"865329837e98418072d6253c44c0b23af0b4848f663ef1399464b8c26b92238b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.733950Z","signature_b64":"d0G9rgOEaRYEJJPKsqY1J92NU/z8tcEsSdkdjUWpWocWlyjko87BF9/bqcYGO0tZhzEVI2/q/N5zjfsY+0T/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86ecb19a91a671cdbc504887b09e6c4ac5a3ffc50b6088e6fbf55661a2c3acd3","last_reissued_at":"2026-05-18T01:26:32.733224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.733224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniqueness of the extreme cases in theorems of Drisko and Erd\\H{o}s-Ginzburg-Ziv","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dani Kotlar, Ran Ziv, Ron Aharoni","submitted_at":"2015-11-18T13:46:44Z","abstract_excerpt":"Drisko \\cite{drisko} proved (essentially) that every family of $2n-1$ matchings of size $n$ in a bipartite graph possesses a partial rainbow matching of size $n$. In \\cite{bgs} this was generalized as follows: Any $\\lfloor \\frac{k+2}{k+1} n \\rfloor -(k+1)$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n-k$. We extend this latter result to matchings of not necessarily equal cardinalities.\n  Settling a conjecture of Drisko, we characterize those families of $2n-2$ matchings of size $n$ in a bipartite graph that do not possess a rainbow matching of size $n$. Combinin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05775","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":"1511.05775","created_at":"2026-05-18T01:26:32.733343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05775v1","created_at":"2026-05-18T01:26:32.733343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05775","created_at":"2026-05-18T01:26:32.733343+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3WLDGURUZY4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3WLDGURUZY43PCQ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3WLDGUR","created_at":"2026-05-18T12:29:37.295048+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/Q3WLDGURUZY43PCQJCD3BHTMJL","json":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL.json","graph_json":"https://pith.science/api/pith-number/Q3WLDGURUZY43PCQJCD3BHTMJL/graph.json","events_json":"https://pith.science/api/pith-number/Q3WLDGURUZY43PCQJCD3BHTMJL/events.json","paper":"https://pith.science/paper/Q3WLDGUR"},"agent_actions":{"view_html":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL","download_json":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL.json","view_paper":"https://pith.science/paper/Q3WLDGUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05775&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3WLDGURUZY43PCQJCD3BHTMJL/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3WLDGURUZY43PCQJCD3BHTMJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL/action/storage_attestation","attest_author":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL/action/author_attestation","sign_citation":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL/action/citation_signature","submit_replication":"https://pith.science/pith/Q3WLDGURUZY43PCQJCD3BHTMJL/action/replication_record"}},"created_at":"2026-05-18T01:26:32.733343+00:00","updated_at":"2026-05-18T01:26:32.733343+00:00"}