{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NRDWSNAQJX5V5HSR5D5ATBSGXP","short_pith_number":"pith:NRDWSNAQ","canonical_record":{"source":{"id":"1605.06752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-22T08:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"f6e3f6889cc336294edbdc86352a57698ae6e1c7eb13abd190fc90a0a161e503","abstract_canon_sha256":"2a2578d21f2719ce12c228c762a1abdde1cbf402f0192e251b22d4e3777cc0d5"},"schema_version":"1.0"},"canonical_sha256":"6c476934104dfb5e9e51e8fa098646bbe387533404161d269dfca44e39516bf9","source":{"kind":"arxiv","id":"1605.06752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06752","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06752v1","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06752","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"NRDWSNAQJX5V","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NRDWSNAQJX5V5HSR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NRDWSNAQ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NRDWSNAQJX5V5HSR5D5ATBSGXP","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-22T08:03:07Z","cross_cats_sorted":[],"title_canon_sha256":"f6e3f6889cc336294edbdc86352a57698ae6e1c7eb13abd190fc90a0a161e503","abstract_canon_sha256":"2a2578d21f2719ce12c228c762a1abdde1cbf402f0192e251b22d4e3777cc0d5"},"schema_version":"1.0"},"canonical_sha256":"6c476934104dfb5e9e51e8fa098646bbe387533404161d269dfca44e39516bf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:11.349007Z","signature_b64":"a+5+xPQBr4SRqpB19xlQ+/ZGqu1AeHGotOmFb1Q/qs+gfvgdHzT4+ndZel4ayBKAiiWB/3GHaCcQ8oVaavsKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c476934104dfb5e9e51e8fa098646bbe387533404161d269dfca44e39516bf9","last_reissued_at":"2026-05-18T01:14:11.348356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:11.348356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06752","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-18T01:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5r4Cix/e+MOh7yvsDjrqZgkvwPaW3vWdxP3uklH/3QadFhg7LMIeOmLSrYtZRxF+TMS2T7lMjhMsympg+upCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:13:18.434666Z"},"content_sha256":"5cdc2fa73a4fd296c2a6e774bd07f510f46b930ba56c91feaef58254bb3f1651","schema_version":"1.0","event_id":"sha256:5cdc2fa73a4fd296c2a6e774bd07f510f46b930ba56c91feaef58254bb3f1651"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NRDWSNAQJX5V5HSR5D5ATBSGXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A rainbow $r$-partite version of the Erd\\H{o}s-Ko-Rado theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Howard, Ron Aharoni","submitted_at":"2016-05-22T08:03:07Z","abstract_excerpt":"Let $f(n,r,k)$ be the minimal number such that every hypergraph larger than $f(n,r,k)$ contained in $\\binom{[n]}{r}$ contains a matching of size $k$, and let $g(n,r,k)$ be the minimal number such that every hypergraph larger than $g(n,r,k)$ contained in the $r$-partite $r$-graph $[n]^{r}$ contains a matching of size $k$. The Erd\\H{o}s-Ko-Rado theorem states that $f(n,r,2)=\\binom{n-1}{r-1}$~~($r \\le \\frac{n}{2}$) and it is easy to show that $g(n,r,k)=(k-1)n^{r-1}$.\n  The conjecture inspiring this paper is that if $F_1,F_2,\\ldots,F_k\\subseteq \\binom{[n]}{r}$ are of size larger than $f(n,r,k)$ or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06752","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-18T01:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOQQzW62K7dXnufKjghpw/pUxpsrzgs/7ReoD3JMGIN7uWCinGFHqLMzyMQ2p2mEDpJziCTKRC5E3HhmI29HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:13:18.435278Z"},"content_sha256":"2403fd52203d0652bf14780c7fd823d9d94421557e765c56658ef3e615608a73","schema_version":"1.0","event_id":"sha256:2403fd52203d0652bf14780c7fd823d9d94421557e765c56658ef3e615608a73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP/bundle.json","state_url":"https://pith.science/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP/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-23T08:13:18Z","links":{"resolver":"https://pith.science/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP","bundle":"https://pith.science/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP/bundle.json","state":"https://pith.science/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRDWSNAQJX5V5HSR5D5ATBSGXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NRDWSNAQJX5V5HSR5D5ATBSGXP","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":"2a2578d21f2719ce12c228c762a1abdde1cbf402f0192e251b22d4e3777cc0d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-22T08:03:07Z","title_canon_sha256":"f6e3f6889cc336294edbdc86352a57698ae6e1c7eb13abd190fc90a0a161e503"},"schema_version":"1.0","source":{"id":"1605.06752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06752","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06752v1","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06752","created_at":"2026-05-18T01:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"NRDWSNAQJX5V","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NRDWSNAQJX5V5HSR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NRDWSNAQ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:2403fd52203d0652bf14780c7fd823d9d94421557e765c56658ef3e615608a73","target":"graph","created_at":"2026-05-18T01:14:11Z","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":"Let $f(n,r,k)$ be the minimal number such that every hypergraph larger than $f(n,r,k)$ contained in $\\binom{[n]}{r}$ contains a matching of size $k$, and let $g(n,r,k)$ be the minimal number such that every hypergraph larger than $g(n,r,k)$ contained in the $r$-partite $r$-graph $[n]^{r}$ contains a matching of size $k$. The Erd\\H{o}s-Ko-Rado theorem states that $f(n,r,2)=\\binom{n-1}{r-1}$~~($r \\le \\frac{n}{2}$) and it is easy to show that $g(n,r,k)=(k-1)n^{r-1}$.\n  The conjecture inspiring this paper is that if $F_1,F_2,\\ldots,F_k\\subseteq \\binom{[n]}{r}$ are of size larger than $f(n,r,k)$ or","authors_text":"David Howard, Ron Aharoni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-22T08:03:07Z","title":"A rainbow $r$-partite version of the Erd\\H{o}s-Ko-Rado theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06752","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:5cdc2fa73a4fd296c2a6e774bd07f510f46b930ba56c91feaef58254bb3f1651","target":"record","created_at":"2026-05-18T01:14:11Z","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":"2a2578d21f2719ce12c228c762a1abdde1cbf402f0192e251b22d4e3777cc0d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-22T08:03:07Z","title_canon_sha256":"f6e3f6889cc336294edbdc86352a57698ae6e1c7eb13abd190fc90a0a161e503"},"schema_version":"1.0","source":{"id":"1605.06752","kind":"arxiv","version":1}},"canonical_sha256":"6c476934104dfb5e9e51e8fa098646bbe387533404161d269dfca44e39516bf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c476934104dfb5e9e51e8fa098646bbe387533404161d269dfca44e39516bf9","first_computed_at":"2026-05-18T01:14:11.348356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:11.348356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+5+xPQBr4SRqpB19xlQ+/ZGqu1AeHGotOmFb1Q/qs+gfvgdHzT4+ndZel4ayBKAiiWB/3GHaCcQ8oVaavsKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:11.349007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cdc2fa73a4fd296c2a6e774bd07f510f46b930ba56c91feaef58254bb3f1651","sha256:2403fd52203d0652bf14780c7fd823d9d94421557e765c56658ef3e615608a73"],"state_sha256":"80c143aa03f41bfd270cc8fbfcf9ac20ceeb9cbd590ed6a5df65c9f0b3be68b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfZOdCui6q0WZcCKnW9SX43BucLc9Bi7FKbzlQEmco3cQ/W5Scs6zLhqvXn2CYg0aqM2EhMUMAkk4r5sPuEyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:13:18.438882Z","bundle_sha256":"96c62bdd50fcef6132e05e0e03ff835da6dda1d469e949c62e286d7108bcb389"}}