{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:EAPCNUZCJ2WXUUWBQRCK5OT2RE","short_pith_number":"pith:EAPCNUZC","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"},"canonical_sha256":"201e26d3224ead7a52c18444aeba7a893ab385863459ff22d20d8a6d83bfe82f","source":{"kind":"arxiv","id":"2011.04650","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04650","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04650v4","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04650","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"EAPCNUZCJ2WX","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"pith_short_16","alias_value":"EAPCNUZCJ2WXUUWB","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"pith_short_8","alias_value":"EAPCNUZC","created_at":"2026-05-28T02:04:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:EAPCNUZCJ2WXUUWBQRCK5OT2RE","target":"record","payload":{"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"},"canonical_sha256":"201e26d3224ead7a52c18444aeba7a893ab385863459ff22d20d8a6d83bfe82f","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"},"source_kind":"arxiv","source_id":"2011.04650","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T02:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/G8e6QgLPJWBvzVViDmqWa9fqol3gYyNws4E1KFpQSI0Uj3XhLbi4UQxRRfwgfWvk1XXTuw/Btr3XfM0SRwoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:18:48.441743Z"},"content_sha256":"c6450a7ed7ed5cf2173c5d2f797d5df65e4c710cd85deb399bae6be109469648","schema_version":"1.0","event_id":"sha256:c6450a7ed7ed5cf2173c5d2f797d5df65e4c710cd85deb399bae6be109469648"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:EAPCNUZCJ2WXUUWBQRCK5OT2RE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T02:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dpCDaZM+kCENEKfkTnUzLqRd2TGeH2qivOuSnrQ1ToapNRPYUU7pA92xhsi0kAP/I2ynuAQ87JO7bap7udsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:18:48.442398Z"},"content_sha256":"58eb3fdf5ee68b6804a8945392d33882ea216af44bf300be3b1726b8e4ec90b7","schema_version":"1.0","event_id":"sha256:58eb3fdf5ee68b6804a8945392d33882ea216af44bf300be3b1726b8e4ec90b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/bundle.json","state_url":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T17:18:48Z","links":{"resolver":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE","bundle":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/bundle.json","state":"https://pith.science/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAPCNUZCJ2WXUUWBQRCK5OT2RE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EAPCNUZCJ2WXUUWBQRCK5OT2RE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"54cd1b082b8f85292c2ecf28dace595378046f1c98f7713c70769baea7817f21","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-08T18:32:44Z","title_canon_sha256":"9433621898f59b15c9e2053dc9cd7420383f4397dbf539071f4d095d9b68532b"},"schema_version":"1.0","source":{"id":"2011.04650","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04650","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04650v4","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04650","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"EAPCNUZCJ2WX","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"pith_short_16","alias_value":"EAPCNUZCJ2WXUUWB","created_at":"2026-05-28T02:04:38Z"},{"alias_kind":"pith_short_8","alias_value":"EAPCNUZC","created_at":"2026-05-28T02:04:38Z"}],"graph_snapshots":[{"event_id":"sha256:58eb3fdf5ee68b6804a8945392d33882ea216af44bf300be3b1726b8e4ec90b7","target":"graph","created_at":"2026-05-28T02:04:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.04650/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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:","authors_text":"Debsoumya Chakraborti, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-08T18:32:44Z","title":"Large rainbow matchings in edge-colored graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04650","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6450a7ed7ed5cf2173c5d2f797d5df65e4c710cd85deb399bae6be109469648","target":"record","created_at":"2026-05-28T02:04:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"54cd1b082b8f85292c2ecf28dace595378046f1c98f7713c70769baea7817f21","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2020-11-08T18:32:44Z","title_canon_sha256":"9433621898f59b15c9e2053dc9cd7420383f4397dbf539071f4d095d9b68532b"},"schema_version":"1.0","source":{"id":"2011.04650","kind":"arxiv","version":4}},"canonical_sha256":"201e26d3224ead7a52c18444aeba7a893ab385863459ff22d20d8a6d83bfe82f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"201e26d3224ead7a52c18444aeba7a893ab385863459ff22d20d8a6d83bfe82f","first_computed_at":"2026-05-28T02:04:38.255356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:04:38.255356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"STWdD4+3hqxAjjRyBbPsFItqNzzFahSDRlnCMD8G050GV4ijFROilMwUXtdJnj3oVKFkMpPJ5XyeNfY/O9HVBw==","signature_status":"signed_v1","signed_at":"2026-05-28T02:04:38.255879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.04650","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6450a7ed7ed5cf2173c5d2f797d5df65e4c710cd85deb399bae6be109469648","sha256:58eb3fdf5ee68b6804a8945392d33882ea216af44bf300be3b1726b8e4ec90b7"],"state_sha256":"141ff33e15b2d6dcb586a7e1f0d3f8b13758079e2f1d07cebb2b19f8d95ef6d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rI+6xv1nn59szL2BaP9I+0EFseNvS1ZH+uF3L8dD7o496kAls2Nhr0ItLpn2cF4yPVQt8CsFjSg3r1kURlfEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:18:48.445720Z","bundle_sha256":"5f38279830b6257974554fb994eed4fb6e09bb50872e54832c18b4cda32beca5"}}