{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EAPCNUZCJ2WXUUWBQRCK5OT2RE","short_pith_number":"pith:EAPCNUZC","schema_version":"1.0","canonical_sha256":"201e26d3224ead7a52c18444aeba7a893ab385863459ff22d20d8a6d83bfe82f","source":{"kind":"arxiv","id":"2011.04650","version":4},"attestation_state":"computed","paper":{"title":"Large rainbow matchings in edge-colored graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Debsoumya Chakraborti, Po-Shen Loh","submitted_at":"2020-11-08T18:32:44Z","abstract_excerpt":"A subgraph of an edge-colored graph is called \\emph{rainbow} if all of its edges have distinct colors. There has been much research on the topic of finding a large rainbow matching in a properly edge-colored graph, where a proper edge-coloring is a coloring of the edge set such that no same-colored edges are incident. Gao, Ramadurai, Wanless, and Wormald proved that in every proper edge-coloring of a graph with $n$ colors where each color appears at least $n+o(n)$ times, there is always a rainbow matching using every color. We strengthen this result by simultaneously relaxing three conditions:"},"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":"2011.04650","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-08T18:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"9433621898f59b15c9e2053dc9cd7420383f4397dbf539071f4d095d9b68532b","abstract_canon_sha256":"54cd1b082b8f85292c2ecf28dace595378046f1c98f7713c70769baea7817f21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:38.255879Z","signature_b64":"STWdD4+3hqxAjjRyBbPsFItqNzzFahSDRlnCMD8G050GV4ijFROilMwUXtdJnj3oVKFkMpPJ5XyeNfY/O9HVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201e26d3224ead7a52c18444aeba7a893ab385863459ff22d20d8a6d83bfe82f","last_reissued_at":"2026-05-28T02:04:38.255356Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:38.255356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large rainbow matchings in edge-colored graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Debsoumya Chakraborti, Po-Shen Loh","submitted_at":"2020-11-08T18:32:44Z","abstract_excerpt":"A subgraph of an edge-colored graph is called \\emph{rainbow} if all of its edges have distinct colors. There has been much research on the topic of finding a large rainbow matching in a properly edge-colored graph, where a proper edge-coloring is a coloring of the edge set such that no same-colored edges are incident. Gao, Ramadurai, Wanless, and Wormald proved that in every proper edge-coloring of a graph with $n$ colors where each color appears at least $n+o(n)$ times, there is always a rainbow matching using every color. We strengthen this result by simultaneously relaxing three conditions:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04650","kind":"arxiv","version":4},"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/2011.04650/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":"2011.04650","created_at":"2026-05-28T02:04:38.255418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04650v4","created_at":"2026-05-28T02:04:38.255418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04650","created_at":"2026-05-28T02:04:38.255418+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAPCNUZCJ2WX","created_at":"2026-05-28T02:04:38.255418+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAPCNUZCJ2WXUUWB","created_at":"2026-05-28T02:04:38.255418+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAPCNUZC","created_at":"2026-05-28T02:04:38.255418+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/EAPCNUZCJ2WXUUWBQRCK5OT2RE","json":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE.json","graph_json":"https://pith.science/api/pith-number/EAPCNUZCJ2WXUUWBQRCK5OT2RE/graph.json","events_json":"https://pith.science/api/pith-number/EAPCNUZCJ2WXUUWBQRCK5OT2RE/events.json","paper":"https://pith.science/paper/EAPCNUZC"},"agent_actions":{"view_html":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE","download_json":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE.json","view_paper":"https://pith.science/paper/EAPCNUZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04650&json=true","fetch_graph":"https://pith.science/api/pith-number/EAPCNUZCJ2WXUUWBQRCK5OT2RE/graph.json","fetch_events":"https://pith.science/api/pith-number/EAPCNUZCJ2WXUUWBQRCK5OT2RE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/action/storage_attestation","attest_author":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/action/author_attestation","sign_citation":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/action/citation_signature","submit_replication":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/action/replication_record"}},"created_at":"2026-05-28T02:04:38.255418+00:00","updated_at":"2026-05-28T02:04:38.255418+00:00"}