{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:T4RMKB4IFDED7W2XMPMRGGCN6F","short_pith_number":"pith:T4RMKB4I","schema_version":"1.0","canonical_sha256":"9f22c5078828c83fdb5763d913184df170571bda560356db7872c66d6bf61ec7","source":{"kind":"arxiv","id":"1408.2559","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.2559","created_at":"2026-05-18T02:29:45.418274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2559v4","created_at":"2026-05-18T02:29:45.418274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2559","created_at":"2026-05-18T02:29:45.418274+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4RMKB4IFDED","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4RMKB4IFDED7W2X","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4RMKB4I","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F","json":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F.json","graph_json":"https://pith.science/api/pith-number/T4RMKB4IFDED7W2XMPMRGGCN6F/graph.json","events_json":"https://pith.science/api/pith-number/T4RMKB4IFDED7W2XMPMRGGCN6F/events.json","paper":"https://pith.science/paper/T4RMKB4I"},"agent_actions":{"view_html":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F","download_json":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F.json","view_paper":"https://pith.science/paper/T4RMKB4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2559&json=true","fetch_graph":"https://pith.science/api/pith-number/T4RMKB4IFDED7W2XMPMRGGCN6F/graph.json","fetch_events":"https://pith.science/api/pith-number/T4RMKB4IFDED7W2XMPMRGGCN6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/action/storage_attestation","attest_author":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/action/author_attestation","sign_citation":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/action/citation_signature","submit_replication":"https://pith.science/pith/T4RMKB4IFDED7W2XMPMRGGCN6F/action/replication_record"}},"created_at":"2026-05-18T02:29:45.418274+00:00","updated_at":"2026-05-18T02:29:45.418274+00:00"}