{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BPNGBGZW3MGEJOKGI5K7SOG75F","short_pith_number":"pith:BPNGBGZW","schema_version":"1.0","canonical_sha256":"0bda609b36db0c44b9464755f938dfe960917af2cd49776eaba5300469f26cef","source":{"kind":"arxiv","id":"1505.01779","version":3},"attestation_state":"computed","paper":{"title":"Rainbow matchings in bipartite multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, G\\'abor N. S\\'ark\\\"ozy, J\\'anos Bar\\'at","submitted_at":"2015-05-07T17:09:15Z","abstract_excerpt":"Suppose that $k$ is a non-negative integer and a bipartite multigraph $G$ is the union of $$N=\\left\\lfloor \\frac{k+2}{k+1}n\\right\\rfloor -(k+1)$$ matchings $M_1,\\dots,M_N$, each of size $n$. We show that $G$ has a rainbow matching of size $n-k$, i.e. a matching of size $n-k$ with all edges coming from different $M_i$'s. Several choices of parameters relate to known results and conjectures."},"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":"1505.01779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-07T17:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"c2dae8fb5c4417b60a7b012d6767c9d20fea110bfc18ba6cda31f94ca99827fa","abstract_canon_sha256":"74feca44fa99550a8f748aa5a288d4d0e8682707890f59d397a7892376ab7735"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:19.115132Z","signature_b64":"OMsD1frQfkrgrwEH16rBzCz0JPaO0r3/4tHEYJRHUyfkNY8k73z3/Q/OwVI7hOWYf1n5/jTVzR5K8KPZh064Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bda609b36db0c44b9464755f938dfe960917af2cd49776eaba5300469f26cef","last_reissued_at":"2026-05-18T01:20:19.114642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:19.114642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow matchings in bipartite multigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andr\\'as Gy\\'arf\\'as, G\\'abor N. S\\'ark\\\"ozy, J\\'anos Bar\\'at","submitted_at":"2015-05-07T17:09:15Z","abstract_excerpt":"Suppose that $k$ is a non-negative integer and a bipartite multigraph $G$ is the union of $$N=\\left\\lfloor \\frac{k+2}{k+1}n\\right\\rfloor -(k+1)$$ matchings $M_1,\\dots,M_N$, each of size $n$. We show that $G$ has a rainbow matching of size $n-k$, i.e. a matching of size $n-k$ with all edges coming from different $M_i$'s. Several choices of parameters relate to known results and conjectures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01779","kind":"arxiv","version":3},"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":"1505.01779","created_at":"2026-05-18T01:20:19.114718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01779v3","created_at":"2026-05-18T01:20:19.114718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01779","created_at":"2026-05-18T01:20:19.114718+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPNGBGZW3MGE","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPNGBGZW3MGEJOKG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPNGBGZW","created_at":"2026-05-18T12:29:14.074870+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/BPNGBGZW3MGEJOKGI5K7SOG75F","json":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F.json","graph_json":"https://pith.science/api/pith-number/BPNGBGZW3MGEJOKGI5K7SOG75F/graph.json","events_json":"https://pith.science/api/pith-number/BPNGBGZW3MGEJOKGI5K7SOG75F/events.json","paper":"https://pith.science/paper/BPNGBGZW"},"agent_actions":{"view_html":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F","download_json":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F.json","view_paper":"https://pith.science/paper/BPNGBGZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01779&json=true","fetch_graph":"https://pith.science/api/pith-number/BPNGBGZW3MGEJOKGI5K7SOG75F/graph.json","fetch_events":"https://pith.science/api/pith-number/BPNGBGZW3MGEJOKGI5K7SOG75F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F/action/storage_attestation","attest_author":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F/action/author_attestation","sign_citation":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F/action/citation_signature","submit_replication":"https://pith.science/pith/BPNGBGZW3MGEJOKGI5K7SOG75F/action/replication_record"}},"created_at":"2026-05-18T01:20:19.114718+00:00","updated_at":"2026-05-18T01:20:19.114718+00:00"}