{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I7T6WIBTVL74U5KB6C5J5JXCYJ","short_pith_number":"pith:I7T6WIBT","schema_version":"1.0","canonical_sha256":"47e7eb2033aaffca7541f0ba9ea6e2c26122080fd13b637c08277364ed14fd0e","source":{"kind":"arxiv","id":"2607.00318","version":1},"attestation_state":"computed","paper":{"title":"A Complete Intersection Theorem for Large Permutation Groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Nathan Keller, Noam Lifshitz, Ohad Sheinfeld","submitted_at":"2026-07-01T01:34:02Z","abstract_excerpt":"A family of permutations is called $t$-intersecting if any two permutations in the family agree on at least $t$ elements. We prove that there exists $n_0 \\in \\mathbb{N}$ such that for any $n>n_0$ and any $1 \\leq t \\leq n$, the maximum size of a $t$-intersecting family in $S_n$ is obtained by one of the families $\\mathcal{F}_{n,t,r}=\\{\\sigma \\in S_n: |\\mathrm{Fixed}(\\sigma) \\cap \\{1,2,\\ldots,t+2r\\}|\\geq t+r\\}$, where $\\mathrm{Fixed}(\\sigma)$ is the set of fixed points of $\\sigma$. This proves an analogue of the classical Complete Intersection Theorem for large permutation groups, thus providing"},"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":"2607.00318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T01:34:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"911b9031978b88ec980f4095e8061967e2f7c9b8e7d08695ecefbf2b3c812fbb","abstract_canon_sha256":"ccb1ac419cfaddd3e8826ae2aff17ad2d9909167e2f6ed4234582397a60fd66c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:44.429232Z","signature_b64":"gDls92ZbUTiX548hNE5Tk10Lkt10WLPK73Ktm+HFu8P6rIla83Q9Hhp4VJfITqhE8iKynfxy6k9ImlBHt5izBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47e7eb2033aaffca7541f0ba9ea6e2c26122080fd13b637c08277364ed14fd0e","last_reissued_at":"2026-07-02T00:18:44.428746Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:44.428746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complete Intersection Theorem for Large Permutation Groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Nathan Keller, Noam Lifshitz, Ohad Sheinfeld","submitted_at":"2026-07-01T01:34:02Z","abstract_excerpt":"A family of permutations is called $t$-intersecting if any two permutations in the family agree on at least $t$ elements. We prove that there exists $n_0 \\in \\mathbb{N}$ such that for any $n>n_0$ and any $1 \\leq t \\leq n$, the maximum size of a $t$-intersecting family in $S_n$ is obtained by one of the families $\\mathcal{F}_{n,t,r}=\\{\\sigma \\in S_n: |\\mathrm{Fixed}(\\sigma) \\cap \\{1,2,\\ldots,t+2r\\}|\\geq t+r\\}$, where $\\mathrm{Fixed}(\\sigma)$ is the set of fixed points of $\\sigma$. This proves an analogue of the classical Complete Intersection Theorem for large permutation groups, thus providing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00318","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00318/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.00318","created_at":"2026-07-02T00:18:44.428819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00318v1","created_at":"2026-07-02T00:18:44.428819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00318","created_at":"2026-07-02T00:18:44.428819+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7T6WIBTVL74","created_at":"2026-07-02T00:18:44.428819+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7T6WIBTVL74U5KB","created_at":"2026-07-02T00:18:44.428819+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7T6WIBT","created_at":"2026-07-02T00:18:44.428819+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/I7T6WIBTVL74U5KB6C5J5JXCYJ","json":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ.json","graph_json":"https://pith.science/api/pith-number/I7T6WIBTVL74U5KB6C5J5JXCYJ/graph.json","events_json":"https://pith.science/api/pith-number/I7T6WIBTVL74U5KB6C5J5JXCYJ/events.json","paper":"https://pith.science/paper/I7T6WIBT"},"agent_actions":{"view_html":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ","download_json":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ.json","view_paper":"https://pith.science/paper/I7T6WIBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00318&json=true","fetch_graph":"https://pith.science/api/pith-number/I7T6WIBTVL74U5KB6C5J5JXCYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/I7T6WIBTVL74U5KB6C5J5JXCYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/action/storage_attestation","attest_author":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/action/author_attestation","sign_citation":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/action/citation_signature","submit_replication":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/action/replication_record"}},"created_at":"2026-07-02T00:18:44.428819+00:00","updated_at":"2026-07-02T00:18:44.428819+00:00"}