{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T4RMKB4IFDED7W2XMPMRGGCN6F","short_pith_number":"pith:T4RMKB4I","canonical_record":{"source":{"id":"1408.2559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-11T21:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"8c3e4adcc1b64a1333beea544a7f7c2f83d64f3eee97e5d532bda34411b1ba56","abstract_canon_sha256":"d7f18f2a1bc1771d9d3376a41678b854fb80c5f3aee71c781cfe0808afd3405c"},"schema_version":"1.0"},"canonical_sha256":"9f22c5078828c83fdb5763d913184df170571bda560356db7872c66d6bf61ec7","source":{"kind":"arxiv","id":"1408.2559","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2559","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2559v4","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2559","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"T4RMKB4IFDED","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T4RMKB4IFDED7W2X","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T4RMKB4I","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T4RMKB4IFDED7W2XMPMRGGCN6F","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2559","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-11T21:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"8c3e4adcc1b64a1333beea544a7f7c2f83d64f3eee97e5d532bda34411b1ba56","abstract_canon_sha256":"d7f18f2a1bc1771d9d3376a41678b854fb80c5f3aee71c781cfe0808afd3405c"},"schema_version":"1.0"},"canonical_sha256":"9f22c5078828c83fdb5763d913184df170571bda560356db7872c66d6bf61ec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.418614Z","signature_b64":"0Ul+V2b9Y4cOjxc8YYkO9l5ipGm03EoMJBiTCd0rV+c2F5oLo1aWi0LL43EE6jChOy+TEkRAb8wxt+kdHGgHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f22c5078828c83fdb5763d913184df170571bda560356db7872c66d6bf61ec7","last_reissued_at":"2026-05-18T02:29:45.418219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.418219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2559","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-18T02:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTesxf/YDWFEgQKA8XhgBc09sm+Wxhc6WwEs0Z1YN3erygs0MDpDW40qZqmjehh7zQmUHsnbMC9PM9boCedHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:05:04.045829Z"},"content_sha256":"ef45d29333d6ea7ec4866b9123bd9661ae6387b2f919ea2f18d13e3d059e16bc","schema_version":"1.0","event_id":"sha256:ef45d29333d6ea7ec4866b9123bd9661ae6387b2f919ea2f18d13e3d059e16bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T4RMKB4IFDED7W2XMPMRGGCN6F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intersecting families of discrete structures are typically trivial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh, Michelle Delcourt, Shagnik Das","submitted_at":"2014-08-11T21:15:59Z","abstract_excerpt":"The study of intersecting structures is central to extremal combinatorics. A family of permutations $\\mathcal{F} \\subset S_n$ is \\emph{$t$-intersecting} if any two permutations in $\\mathcal{F}$ agree on some $t$ indices, and is \\emph{trivial} if all permutations in $\\mathcal{F}$ agree on the same $t$ indices. A $k$-uniform hypergraph is \\emph{$t$-intersecting} if any two of its edges have $t$ vertices in common, and \\emph{trivial} if all its edges share the same $t$ vertices.\n  The fundamental problem is to determine how large an intersecting family can be. Ellis, Friedgut and Pilpel proved th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2559","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-18T02:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHLs4YYMFt/nxCER5XfARUBLpY1Q5Or+hMuB7IqjaUldySBNPaXZ+dSiG5OGOBYmFkRbIeSE7Pj6uPBC1kC1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:05:04.046489Z"},"content_sha256":"070c7f7c7471385e1840259aca6797f3a111b0b521f054dca516f32b9a3d4fd1","schema_version":"1.0","event_id":"sha256:070c7f7c7471385e1840259aca6797f3a111b0b521f054dca516f32b9a3d4fd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/bundle.json","state_url":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/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-28T20:05:04Z","links":{"resolver":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F","bundle":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/bundle.json","state":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T4RMKB4IFDED7W2XMPMRGGCN6F","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":"d7f18f2a1bc1771d9d3376a41678b854fb80c5f3aee71c781cfe0808afd3405c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-11T21:15:59Z","title_canon_sha256":"8c3e4adcc1b64a1333beea544a7f7c2f83d64f3eee97e5d532bda34411b1ba56"},"schema_version":"1.0","source":{"id":"1408.2559","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2559","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2559v4","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2559","created_at":"2026-05-18T02:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"T4RMKB4IFDED","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T4RMKB4IFDED7W2X","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T4RMKB4I","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:070c7f7c7471385e1840259aca6797f3a111b0b521f054dca516f32b9a3d4fd1","target":"graph","created_at":"2026-05-18T02:29:45Z","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":"The study of intersecting structures is central to extremal combinatorics. A family of permutations $\\mathcal{F} \\subset S_n$ is \\emph{$t$-intersecting} if any two permutations in $\\mathcal{F}$ agree on some $t$ indices, and is \\emph{trivial} if all permutations in $\\mathcal{F}$ agree on the same $t$ indices. A $k$-uniform hypergraph is \\emph{$t$-intersecting} if any two of its edges have $t$ vertices in common, and \\emph{trivial} if all its edges share the same $t$ vertices.\n  The fundamental problem is to determine how large an intersecting family can be. Ellis, Friedgut and Pilpel proved th","authors_text":"Hong Liu, J\\'ozsef Balogh, Maryam Sharifzadeh, Michelle Delcourt, Shagnik Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-11T21:15:59Z","title":"Intersecting families of discrete structures are typically trivial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2559","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:ef45d29333d6ea7ec4866b9123bd9661ae6387b2f919ea2f18d13e3d059e16bc","target":"record","created_at":"2026-05-18T02:29:45Z","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":"d7f18f2a1bc1771d9d3376a41678b854fb80c5f3aee71c781cfe0808afd3405c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-11T21:15:59Z","title_canon_sha256":"8c3e4adcc1b64a1333beea544a7f7c2f83d64f3eee97e5d532bda34411b1ba56"},"schema_version":"1.0","source":{"id":"1408.2559","kind":"arxiv","version":4}},"canonical_sha256":"9f22c5078828c83fdb5763d913184df170571bda560356db7872c66d6bf61ec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f22c5078828c83fdb5763d913184df170571bda560356db7872c66d6bf61ec7","first_computed_at":"2026-05-18T02:29:45.418219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:45.418219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Ul+V2b9Y4cOjxc8YYkO9l5ipGm03EoMJBiTCd0rV+c2F5oLo1aWi0LL43EE6jChOy+TEkRAb8wxt+kdHGgHBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:45.418614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2559","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef45d29333d6ea7ec4866b9123bd9661ae6387b2f919ea2f18d13e3d059e16bc","sha256:070c7f7c7471385e1840259aca6797f3a111b0b521f054dca516f32b9a3d4fd1"],"state_sha256":"1cca51500e86d5d22fc940f032f24f406e399823f34c023c3c9645757ac0c8ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eC+4TKdF8kNp2NyadrM4EMz+VQKZDDV7LTZQxoQDZXhqw+bP1kiU3fTVmNTu09YbNYnK+1fn8HqnS8gEiHXiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:05:04.049721Z","bundle_sha256":"fb0a5c784dff90f2c3c326c67a567edc5622d12e65c4dd714895f54ea8b33a41"}}