{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JRWGR7MG5VOD2L23CVDBB6SSOW","short_pith_number":"pith:JRWGR7MG","schema_version":"1.0","canonical_sha256":"4c6c68fd86ed5c3d2f5b154610fa5275940ae55af16ebe150add1cfed5ad8a7a","source":{"kind":"arxiv","id":"1611.03648","version":5},"attestation_state":"computed","paper":{"title":"Large rainbow matchings in general graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Howard, Eli Berger, Maria Chudnovsky, Paul Seymour, Ron Aharoni","submitted_at":"2016-11-11T10:25:59Z","abstract_excerpt":"By a theorem of Drisko, any $2n-1$ matchings of size $n$ in a bipartite graph have a partial rainbow matching of size $n$. Inspired by discussion of Bar\\'at, Gy\\'arf\\'as and S\\'ark\\\"ozy, we conjecture that if $n$ is odd then the same is true also in general graphs, and that if $n$ is even then $2n$ matchings of size $n$ suffice. We prove that any $3n-2$ matchings of size $n$ have a partial rainbow matching of size $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":"1611.03648","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-11T10:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"de4c6de4baa9183dcde700dcccd2a4cd6cbbcfe3d99c78c3426363ee93aed7b7","abstract_canon_sha256":"123aa6a7e4aee35a2d6c1919d09eccf4df021466f7c223d71dc2b5fab56581ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:19.185445Z","signature_b64":"TNzvdODIe8q3csN6aOHMXWXLoiciWGKua8ao5Q4XxEidKUaoix6EqIdZ3aEdQYvL6bL2oHKpY12ieJaDPiLBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c6c68fd86ed5c3d2f5b154610fa5275940ae55af16ebe150add1cfed5ad8a7a","last_reissued_at":"2026-05-18T00:11:19.184640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:19.184640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large rainbow matchings in general graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Howard, Eli Berger, Maria Chudnovsky, Paul Seymour, Ron Aharoni","submitted_at":"2016-11-11T10:25:59Z","abstract_excerpt":"By a theorem of Drisko, any $2n-1$ matchings of size $n$ in a bipartite graph have a partial rainbow matching of size $n$. Inspired by discussion of Bar\\'at, Gy\\'arf\\'as and S\\'ark\\\"ozy, we conjecture that if $n$ is odd then the same is true also in general graphs, and that if $n$ is even then $2n$ matchings of size $n$ suffice. We prove that any $3n-2$ matchings of size $n$ have a partial rainbow matching of size $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03648","kind":"arxiv","version":5},"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":"1611.03648","created_at":"2026-05-18T00:11:19.184769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03648v5","created_at":"2026-05-18T00:11:19.184769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03648","created_at":"2026-05-18T00:11:19.184769+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRWGR7MG5VOD","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRWGR7MG5VOD2L23","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRWGR7MG","created_at":"2026-05-18T12:30:25.849896+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/JRWGR7MG5VOD2L23CVDBB6SSOW","json":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW.json","graph_json":"https://pith.science/api/pith-number/JRWGR7MG5VOD2L23CVDBB6SSOW/graph.json","events_json":"https://pith.science/api/pith-number/JRWGR7MG5VOD2L23CVDBB6SSOW/events.json","paper":"https://pith.science/paper/JRWGR7MG"},"agent_actions":{"view_html":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW","download_json":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW.json","view_paper":"https://pith.science/paper/JRWGR7MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03648&json=true","fetch_graph":"https://pith.science/api/pith-number/JRWGR7MG5VOD2L23CVDBB6SSOW/graph.json","fetch_events":"https://pith.science/api/pith-number/JRWGR7MG5VOD2L23CVDBB6SSOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW/action/storage_attestation","attest_author":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW/action/author_attestation","sign_citation":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW/action/citation_signature","submit_replication":"https://pith.science/pith/JRWGR7MG5VOD2L23CVDBB6SSOW/action/replication_record"}},"created_at":"2026-05-18T00:11:19.184769+00:00","updated_at":"2026-05-18T00:11:19.184769+00:00"}