{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R2CRMT3PB3UBRF7GSN62HLL6FI","short_pith_number":"pith:R2CRMT3P","canonical_record":{"source":{"id":"1604.06135","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T22:42:26Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0c41e786411340a200f58707c851eaa415a222e7adf17da6c5bb75ae7e87c5a3","abstract_canon_sha256":"539ef148a6082270cce4fa145036c05e0c48a28aa4352872faa6a40901ca2709"},"schema_version":"1.0"},"canonical_sha256":"8e85164f6f0ee81897e6937da3ad7e2a0b0dacd60034a7829fba437197e5982d","source":{"kind":"arxiv","id":"1604.06135","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06135","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06135v4","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06135","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"R2CRMT3PB3UB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R2CRMT3PB3UBRF7G","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R2CRMT3P","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R2CRMT3PB3UBRF7GSN62HLL6FI","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06135","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T22:42:26Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"0c41e786411340a200f58707c851eaa415a222e7adf17da6c5bb75ae7e87c5a3","abstract_canon_sha256":"539ef148a6082270cce4fa145036c05e0c48a28aa4352872faa6a40901ca2709"},"schema_version":"1.0"},"canonical_sha256":"8e85164f6f0ee81897e6937da3ad7e2a0b0dacd60034a7829fba437197e5982d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.294230Z","signature_b64":"0EdJGG3ocn9vVjeqkE06VvL/uC2gfIpBd52uCqGaL4zFqVEmcjcypBj0qE9VgMGzzI6v40xAy3Dft1tEBf00Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e85164f6f0ee81897e6937da3ad7e2a0b0dacd60034a7829fba437197e5982d","last_reissued_at":"2026-05-18T00:22:11.293798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.293798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06135","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-18T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qd3yr4tXReO+wxQYsZX8oMbtrzUiwLM5v7dq9ThHG701jlWsxKxb0KWouBRdgKTJlLGDyX5fryTAD+5BpF+BDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:27:10.799816Z"},"content_sha256":"f96b2405457a4ca3e4c324b0616ec321d03fada96c0c472066058c89a516dd28","schema_version":"1.0","event_id":"sha256:f96b2405457a4ca3e4c324b0616ec321d03fada96c0c472066058c89a516dd28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R2CRMT3PB3UBRF7GSN62HLL6FI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\\H{o}s and S\\'os","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"David Ellis, Nathan Keller, Noam Lifshitz","submitted_at":"2016-04-20T22:42:26Z","abstract_excerpt":"A family $F$ of sets is said to be $t$-intersecting if $|A \\cap B| \\geq t$ for any $A,B \\in F$. The seminal Complete Intersection Theorem of Ahlswede and Khachatrian (1997) gives the maximal size $f(n,k,t)$ of a $t$-intersecting family of $k$-element subsets of $[n]=\\{1,2,\\ldots,n\\}$, together with a characterisation of the extremal families.\n  The forbidden intersection problem, posed by Erd\\H{o}s and S\\'{o}s in 1971, asks for a determination of the maximal size $g(n,k,t)$ of a family $F$ of $k$-element subsets of $[n]$ such that $|A \\cap B| \\neq t-1$ for any $A,B \\in F$.\n  In this paper, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06135","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":""},"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-18T00:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kj/WEdoWJZI0Swho+X6VOLzkw7A4Xa6F6wYIGHCmkFJk/ReuOJjCMcmlP1E8p7terA1ZIaTvmwa3k6zP8Q4TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:27:10.800159Z"},"content_sha256":"eeb213452c9d89cd12004893ad8e9e805705313c1a71ef7bacd798736093917b","schema_version":"1.0","event_id":"sha256:eeb213452c9d89cd12004893ad8e9e805705313c1a71ef7bacd798736093917b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2CRMT3PB3UBRF7GSN62HLL6FI/bundle.json","state_url":"https://pith.science/pith/R2CRMT3PB3UBRF7GSN62HLL6FI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2CRMT3PB3UBRF7GSN62HLL6FI/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-25T22:27:10Z","links":{"resolver":"https://pith.science/pith/R2CRMT3PB3UBRF7GSN62HLL6FI","bundle":"https://pith.science/pith/R2CRMT3PB3UBRF7GSN62HLL6FI/bundle.json","state":"https://pith.science/pith/R2CRMT3PB3UBRF7GSN62HLL6FI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2CRMT3PB3UBRF7GSN62HLL6FI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R2CRMT3PB3UBRF7GSN62HLL6FI","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":"539ef148a6082270cce4fa145036c05e0c48a28aa4352872faa6a40901ca2709","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T22:42:26Z","title_canon_sha256":"0c41e786411340a200f58707c851eaa415a222e7adf17da6c5bb75ae7e87c5a3"},"schema_version":"1.0","source":{"id":"1604.06135","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06135","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06135v4","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06135","created_at":"2026-05-18T00:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"R2CRMT3PB3UB","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R2CRMT3PB3UBRF7G","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R2CRMT3P","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:eeb213452c9d89cd12004893ad8e9e805705313c1a71ef7bacd798736093917b","target":"graph","created_at":"2026-05-18T00:22: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":"A family $F$ of sets is said to be $t$-intersecting if $|A \\cap B| \\geq t$ for any $A,B \\in F$. The seminal Complete Intersection Theorem of Ahlswede and Khachatrian (1997) gives the maximal size $f(n,k,t)$ of a $t$-intersecting family of $k$-element subsets of $[n]=\\{1,2,\\ldots,n\\}$, together with a characterisation of the extremal families.\n  The forbidden intersection problem, posed by Erd\\H{o}s and S\\'{o}s in 1971, asks for a determination of the maximal size $g(n,k,t)$ of a family $F$ of $k$-element subsets of $[n]$ such that $|A \\cap B| \\neq t-1$ for any $A,B \\in F$.\n  In this paper, we ","authors_text":"David Ellis, Nathan Keller, Noam Lifshitz","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T22:42:26Z","title":"Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\\H{o}s and S\\'os"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06135","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:f96b2405457a4ca3e4c324b0616ec321d03fada96c0c472066058c89a516dd28","target":"record","created_at":"2026-05-18T00:22: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":"539ef148a6082270cce4fa145036c05e0c48a28aa4352872faa6a40901ca2709","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-20T22:42:26Z","title_canon_sha256":"0c41e786411340a200f58707c851eaa415a222e7adf17da6c5bb75ae7e87c5a3"},"schema_version":"1.0","source":{"id":"1604.06135","kind":"arxiv","version":4}},"canonical_sha256":"8e85164f6f0ee81897e6937da3ad7e2a0b0dacd60034a7829fba437197e5982d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e85164f6f0ee81897e6937da3ad7e2a0b0dacd60034a7829fba437197e5982d","first_computed_at":"2026-05-18T00:22:11.293798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:11.293798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0EdJGG3ocn9vVjeqkE06VvL/uC2gfIpBd52uCqGaL4zFqVEmcjcypBj0qE9VgMGzzI6v40xAy3Dft1tEBf00Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:11.294230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06135","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f96b2405457a4ca3e4c324b0616ec321d03fada96c0c472066058c89a516dd28","sha256:eeb213452c9d89cd12004893ad8e9e805705313c1a71ef7bacd798736093917b"],"state_sha256":"9662f2341e26e38a6593aac721f2a6658b3dd03665c014c40335ec012af2f882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKfj3ZV/yzeeINYeo1BoO8yTOk6qeA/CjWcHbqw42dFXoBRZt5gaYqAWS8hqpgMX+g4HyHUbZXDEB4Hglt38AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:27:10.802079Z","bundle_sha256":"457598b3a03dd0a282e9ba18f454b290ca50465f44bac83003d7fe6638dab74b"}}