{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EHWSV2APV7F5FEYEQE26DFXKPA","short_pith_number":"pith:EHWSV2AP","schema_version":"1.0","canonical_sha256":"21ed2ae80fafcbd293048135e196ea781c57d64b3929dabaa01dc97f9c47224b","source":{"kind":"arxiv","id":"2012.14992","version":3},"attestation_state":"computed","paper":{"title":"Rainbow paths and large rainbow matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eli Berger, Maria Chudnovsky, Ron Aharoni, Shira Zerbib","submitted_at":"2020-12-30T00:55:59Z","abstract_excerpt":"A conjecture of the first two authors is that $n$ matchings of size $n$ in any graph have a rainbow matching of size $n-1$. We prove a lower bound of $\\frac{2}{3}n-1$, improving on the trivial $\\frac{1}{2}n$, and an analogous result for hypergraphs. For $\\{C_3,C_5\\}$-free graphs and for disjoint matchings we obtain a lower bound of $\\frac{3n}{4}-O(1)$. We also discuss a conjecture on rainbow alternating paths, that if true would yield a lower bound of $n-\\sqrt{2n}$. We prove the non-alternating (ordinary paths) version of this conjecture."},"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":"2012.14992","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-30T00:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"019cd7465ed9841a3a1a5f33dd65083dde6c26a1d44fef46f50885a772d5116d","abstract_canon_sha256":"a4153f8ba29d2870a215e585bbbf3b06466ba186b26963c3a4c4c450debe9f9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:33.691985Z","signature_b64":"TaKRUqRiqKFaBILytPfqh0ogmj7i2jAbU+p1CePhqqPx52J0bqCcj/O4a7KRErc2O1AzsXNO/X1xN58PRcv/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21ed2ae80fafcbd293048135e196ea781c57d64b3929dabaa01dc97f9c47224b","last_reissued_at":"2026-07-05T03:20:33.691580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:33.691580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow paths and large rainbow matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eli Berger, Maria Chudnovsky, Ron Aharoni, Shira Zerbib","submitted_at":"2020-12-30T00:55:59Z","abstract_excerpt":"A conjecture of the first two authors is that $n$ matchings of size $n$ in any graph have a rainbow matching of size $n-1$. We prove a lower bound of $\\frac{2}{3}n-1$, improving on the trivial $\\frac{1}{2}n$, and an analogous result for hypergraphs. For $\\{C_3,C_5\\}$-free graphs and for disjoint matchings we obtain a lower bound of $\\frac{3n}{4}-O(1)$. We also discuss a conjecture on rainbow alternating paths, that if true would yield a lower bound of $n-\\sqrt{2n}$. We prove the non-alternating (ordinary paths) version of this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.14992","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.14992/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":"2012.14992","created_at":"2026-07-05T03:20:33.691637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.14992v3","created_at":"2026-07-05T03:20:33.691637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.14992","created_at":"2026-07-05T03:20:33.691637+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHWSV2APV7F5","created_at":"2026-07-05T03:20:33.691637+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHWSV2APV7F5FEYE","created_at":"2026-07-05T03:20:33.691637+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHWSV2AP","created_at":"2026-07-05T03:20:33.691637+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/EHWSV2APV7F5FEYEQE26DFXKPA","json":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA.json","graph_json":"https://pith.science/api/pith-number/EHWSV2APV7F5FEYEQE26DFXKPA/graph.json","events_json":"https://pith.science/api/pith-number/EHWSV2APV7F5FEYEQE26DFXKPA/events.json","paper":"https://pith.science/paper/EHWSV2AP"},"agent_actions":{"view_html":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA","download_json":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA.json","view_paper":"https://pith.science/paper/EHWSV2AP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.14992&json=true","fetch_graph":"https://pith.science/api/pith-number/EHWSV2APV7F5FEYEQE26DFXKPA/graph.json","fetch_events":"https://pith.science/api/pith-number/EHWSV2APV7F5FEYEQE26DFXKPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA/action/storage_attestation","attest_author":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA/action/author_attestation","sign_citation":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA/action/citation_signature","submit_replication":"https://pith.science/pith/EHWSV2APV7F5FEYEQE26DFXKPA/action/replication_record"}},"created_at":"2026-07-05T03:20:33.691637+00:00","updated_at":"2026-07-05T03:20:33.691637+00:00"}