{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NWXM6NYL3E2SV4MDNFAUQXSH2U","short_pith_number":"pith:NWXM6NYL","canonical_record":{"source":{"id":"1211.0793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-05T08:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"c354240e093bab469e4beb034c7d4874f55cb44dd99c3de867c7132473ebefce","abstract_canon_sha256":"b5fa8fdafb89347f9451634648159a06bac4ff5b14c9ec074a55a0acac7cab97"},"schema_version":"1.0"},"canonical_sha256":"6daecf370bd9352af1836941485e47d52896d95dc1957f541e8ce8402660af80","source":{"kind":"arxiv","id":"1211.0793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0793","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0793v1","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0793","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"NWXM6NYL3E2S","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NWXM6NYL3E2SV4MD","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NWXM6NYL","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NWXM6NYL3E2SV4MDNFAUQXSH2U","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-05T08:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"c354240e093bab469e4beb034c7d4874f55cb44dd99c3de867c7132473ebefce","abstract_canon_sha256":"b5fa8fdafb89347f9451634648159a06bac4ff5b14c9ec074a55a0acac7cab97"},"schema_version":"1.0"},"canonical_sha256":"6daecf370bd9352af1836941485e47d52896d95dc1957f541e8ce8402660af80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:31.530715Z","signature_b64":"tuDzrZWz+0mzWYGmEfdvT41XmjSU6AnYHW0bG8PXMSQqp6gkruKqKYuWbzO9oGQspxhJVCAa9TIhg6tHfl8EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6daecf370bd9352af1836941485e47d52896d95dc1957f541e8ce8402660af80","last_reissued_at":"2026-05-18T03:41:31.530142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:31.530142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0793","source_version":1,"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-18T03:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NqIi66OGPVJjBVD3kh2NEHBgX9K2QHA9R2DuTui6h4T8VIwj6JsUT6oLIXzK/f7WIfhJH/b7ADrLhqW902c/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:20:09.157838Z"},"content_sha256":"44b3630aa4e3170284303c9fd1743f633414947e82cb5558fa58f0c422e90607","schema_version":"1.0","event_id":"sha256:44b3630aa4e3170284303c9fd1743f633414947e82cb5558fa58f0c422e90607"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NWXM6NYL3E2SV4MDNFAUQXSH2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How many colors guarantee a rainbow matching?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Roman Glebov, Tibor Szab\\'o","submitted_at":"2012-11-05T08:55:38Z","abstract_excerpt":"Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having a different color. In this note we study the problem of finding a rainbow $t$-matching in an r-partite r-uniform multi-hypergraph whose edges are colored with f colors such that every color class is a matching of size t. This problem was posed by Aharoni and Berger, who asked to determine the minimum number of colors which guarantees a rainbow matching. We improve on the known upper bounds for this problem for all values of the parameters. In particular for every fixed r, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0793","kind":"arxiv","version":1},"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"},"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-18T03:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HoqU5a5S4fWqTIH11z/q1I+yvRtm+ZPnQfEqWpjJWIcqd9SEwi6jt/PLL6APA35Po7cbR6TmCzmhDtiS6G9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:20:09.158183Z"},"content_sha256":"b6ea4ee0eceb133c83829f1158649c233b2f6b2464f626327a44ad4778ce31a9","schema_version":"1.0","event_id":"sha256:b6ea4ee0eceb133c83829f1158649c233b2f6b2464f626327a44ad4778ce31a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U/bundle.json","state_url":"https://pith.science/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U/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-06-10T19:20:09Z","links":{"resolver":"https://pith.science/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U","bundle":"https://pith.science/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U/bundle.json","state":"https://pith.science/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWXM6NYL3E2SV4MDNFAUQXSH2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NWXM6NYL3E2SV4MDNFAUQXSH2U","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":"b5fa8fdafb89347f9451634648159a06bac4ff5b14c9ec074a55a0acac7cab97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-05T08:55:38Z","title_canon_sha256":"c354240e093bab469e4beb034c7d4874f55cb44dd99c3de867c7132473ebefce"},"schema_version":"1.0","source":{"id":"1211.0793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0793","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0793v1","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0793","created_at":"2026-05-18T03:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"NWXM6NYL3E2S","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NWXM6NYL3E2SV4MD","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NWXM6NYL","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:b6ea4ee0eceb133c83829f1158649c233b2f6b2464f626327a44ad4778ce31a9","target":"graph","created_at":"2026-05-18T03:41:31Z","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"},"paper":{"abstract_excerpt":"Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having a different color. In this note we study the problem of finding a rainbow $t$-matching in an r-partite r-uniform multi-hypergraph whose edges are colored with f colors such that every color class is a matching of size t. This problem was posed by Aharoni and Berger, who asked to determine the minimum number of colors which guarantees a rainbow matching. We improve on the known upper bounds for this problem for all values of the parameters. In particular for every fixed r, ","authors_text":"Benny Sudakov, Roman Glebov, Tibor Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-05T08:55:38Z","title":"How many colors guarantee a rainbow matching?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0793","kind":"arxiv","version":1},"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:44b3630aa4e3170284303c9fd1743f633414947e82cb5558fa58f0c422e90607","target":"record","created_at":"2026-05-18T03:41:31Z","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":"b5fa8fdafb89347f9451634648159a06bac4ff5b14c9ec074a55a0acac7cab97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-05T08:55:38Z","title_canon_sha256":"c354240e093bab469e4beb034c7d4874f55cb44dd99c3de867c7132473ebefce"},"schema_version":"1.0","source":{"id":"1211.0793","kind":"arxiv","version":1}},"canonical_sha256":"6daecf370bd9352af1836941485e47d52896d95dc1957f541e8ce8402660af80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6daecf370bd9352af1836941485e47d52896d95dc1957f541e8ce8402660af80","first_computed_at":"2026-05-18T03:41:31.530142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:31.530142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tuDzrZWz+0mzWYGmEfdvT41XmjSU6AnYHW0bG8PXMSQqp6gkruKqKYuWbzO9oGQspxhJVCAa9TIhg6tHfl8EAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:31.530715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44b3630aa4e3170284303c9fd1743f633414947e82cb5558fa58f0c422e90607","sha256:b6ea4ee0eceb133c83829f1158649c233b2f6b2464f626327a44ad4778ce31a9"],"state_sha256":"08d4fbb293a4e1a1fcdf68ce49971430ff937c8e0d9cec8f4b5669218064c712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QV2qHJhsJ88brZA/p74EQ8gGRVOlogGpXprF+Yl5CuC2DVru0A4iAlVI4sSrTgsjsluWqpAz2f8aDa3Q934CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:20:09.160095Z","bundle_sha256":"ebe1d89462b91d420a7d869f2fedd91e54e2366c3109cc71feb4f3fe6033abc2"}}