{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I7T6WIBTVL74U5KB6C5J5JXCYJ","short_pith_number":"pith:I7T6WIBT","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"},"canonical_sha256":"47e7eb2033aaffca7541f0ba9ea6e2c26122080fd13b637c08277364ed14fd0e","source":{"kind":"arxiv","id":"2607.00318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00318","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00318v1","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00318","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"I7T6WIBTVL74","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"I7T6WIBTVL74U5KB","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"I7T6WIBT","created_at":"2026-07-02T00:18:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I7T6WIBTVL74U5KB6C5J5JXCYJ","target":"record","payload":{"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"},"canonical_sha256":"47e7eb2033aaffca7541f0ba9ea6e2c26122080fd13b637c08277364ed14fd0e","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"},"source_kind":"arxiv","source_id":"2607.00318","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-07-02T00:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+mItPBBj64Str3/ip4xuVeOf340FPq1/WFGGZB/NlZtsKSs7ZwCMMggxbViEQBPUzGW+OeZ3Fb80KuEv/ORAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:36:23.818191Z"},"content_sha256":"402a407384cd905bdaac5d43656a26690c88091edb215b8540e4fbb864403357","schema_version":"1.0","event_id":"sha256:402a407384cd905bdaac5d43656a26690c88091edb215b8540e4fbb864403357"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I7T6WIBTVL74U5KB6C5J5JXCYJ","target":"graph","payload":{"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"},"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-07-02T00:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qgu7Y7dmD5tfhXIwof9UcTFsA1nmsS5Kba8Zn7bQn0H+bry1K2pGAlNwTUrfnVpodkeAFhrpqmOyBuxUIsWvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:36:23.825779Z"},"content_sha256":"08a02d9a4f76636a41c0a4239ce80856f49d6ec1ba942a055a68f459656bfffe","schema_version":"1.0","event_id":"sha256:08a02d9a4f76636a41c0a4239ce80856f49d6ec1ba942a055a68f459656bfffe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/bundle.json","state_url":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/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-08-11T19:36:23Z","links":{"resolver":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ","bundle":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/bundle.json","state":"https://pith.science/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7T6WIBTVL74U5KB6C5J5JXCYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I7T6WIBTVL74U5KB6C5J5JXCYJ","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":"ccb1ac419cfaddd3e8826ae2aff17ad2d9909167e2f6ed4234582397a60fd66c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T01:34:02Z","title_canon_sha256":"911b9031978b88ec980f4095e8061967e2f7c9b8e7d08695ecefbf2b3c812fbb"},"schema_version":"1.0","source":{"id":"2607.00318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00318","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00318v1","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00318","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"I7T6WIBTVL74","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"I7T6WIBTVL74U5KB","created_at":"2026-07-02T00:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"I7T6WIBT","created_at":"2026-07-02T00:18:44Z"}],"graph_snapshots":[{"event_id":"sha256:08a02d9a4f76636a41c0a4239ce80856f49d6ec1ba942a055a68f459656bfffe","target":"graph","created_at":"2026-07-02T00:18:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andrey Kupavskii, Nathan Keller, Noam Lifshitz, Ohad Sheinfeld","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T01:34:02Z","title":"A Complete Intersection Theorem for Large Permutation Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00318","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:402a407384cd905bdaac5d43656a26690c88091edb215b8540e4fbb864403357","target":"record","created_at":"2026-07-02T00:18:44Z","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":"ccb1ac419cfaddd3e8826ae2aff17ad2d9909167e2f6ed4234582397a60fd66c","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T01:34:02Z","title_canon_sha256":"911b9031978b88ec980f4095e8061967e2f7c9b8e7d08695ecefbf2b3c812fbb"},"schema_version":"1.0","source":{"id":"2607.00318","kind":"arxiv","version":1}},"canonical_sha256":"47e7eb2033aaffca7541f0ba9ea6e2c26122080fd13b637c08277364ed14fd0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47e7eb2033aaffca7541f0ba9ea6e2c26122080fd13b637c08277364ed14fd0e","first_computed_at":"2026-07-02T00:18:44.428746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T00:18:44.428746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDls92ZbUTiX548hNE5Tk10Lkt10WLPK73Ktm+HFu8P6rIla83Q9Hhp4VJfITqhE8iKynfxy6k9ImlBHt5izBQ==","signature_status":"signed_v1","signed_at":"2026-07-02T00:18:44.429232Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:402a407384cd905bdaac5d43656a26690c88091edb215b8540e4fbb864403357","sha256:08a02d9a4f76636a41c0a4239ce80856f49d6ec1ba942a055a68f459656bfffe"],"state_sha256":"a6da91e37919064af34ea42fc1f23be3612f044a7a29811c6e37010950808457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msjB9D7lCEy+Z4jfqdIBsi9yTiUL/NJ9YZXoemB+u8sSs8tRb3q/UWiz+OaOZoGQ1u9W1rD+xOTrFkbzxuAYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:36:23.855203Z","bundle_sha256":"f528994bd0efa63f1fd6f3e1de6b3149bea7ad87453dad994f5212d18844311e"}}