{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PJVR45DKYVJJJV2IU6JMJ5ZI6X","short_pith_number":"pith:PJVR45DK","canonical_record":{"source":{"id":"2607.16040","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T15:15:13Z","cross_cats_sorted":[],"title_canon_sha256":"69e8beb8d3e3d5999d45379a3136b10a10f68fbe3c136f691ff6db8f20aaba29","abstract_canon_sha256":"03dc93257a3e9756ae62d40b6bd905532950ac4d62a20b5efca5774073474eba"},"schema_version":"1.0"},"canonical_sha256":"7a6b1e746ac55294d748a792c4f728f5ce0415fb5e15d13588b991c62a49077b","source":{"kind":"arxiv","id":"2607.16040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16040","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16040v1","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16040","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"PJVR45DKYVJJ","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"pith_short_16","alias_value":"PJVR45DKYVJJJV2I","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"pith_short_8","alias_value":"PJVR45DK","created_at":"2026-07-20T02:19:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PJVR45DKYVJJJV2IU6JMJ5ZI6X","target":"record","payload":{"canonical_record":{"source":{"id":"2607.16040","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T15:15:13Z","cross_cats_sorted":[],"title_canon_sha256":"69e8beb8d3e3d5999d45379a3136b10a10f68fbe3c136f691ff6db8f20aaba29","abstract_canon_sha256":"03dc93257a3e9756ae62d40b6bd905532950ac4d62a20b5efca5774073474eba"},"schema_version":"1.0"},"canonical_sha256":"7a6b1e746ac55294d748a792c4f728f5ce0415fb5e15d13588b991c62a49077b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T02:19:27.769300Z","signature_b64":"kQr8KJdwTwwD0pT6a/f3E55viQkqzHhzIlUOf8UptxgRJXdDUelq9BCq4BjpNvB+6fcjOfsDzUFEbwJ45eJjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6b1e746ac55294d748a792c4f728f5ce0415fb5e15d13588b991c62a49077b","last_reissued_at":"2026-07-20T02:19:27.768439Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T02:19:27.768439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.16040","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-20T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upEE9H60p2BlL0Ryqvyr8kZIDoV0fCKhbHaRFYsy3hwMK+S40/8zgn2hiblerJcMpDWfNcIJ1ntfmHIM92waBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:55:48.872101Z"},"content_sha256":"fc74509ac933417e99d0a54373925610d095ebe4975fd9cb3aba7cc0f900a24c","schema_version":"1.0","event_id":"sha256:fc74509ac933417e99d0a54373925610d095ebe4975fd9cb3aba7cc0f900a24c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PJVR45DKYVJJJV2IU6JMJ5ZI6X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A gap theorem for non-trivial maximal intersecting families and an exact weighted asymptotic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"El'mira Yu. Kalimulina","submitted_at":"2026-07-17T15:15:13Z","abstract_excerpt":"Let $D_n$ be the disjointness graph on the nonempty subsets of $[n]$, whose independent sets are exactly the intersecting families on $[n]$. We study the weighted independent-set polynomial $W(n)=\\sum_F\\prod_{S\\in F}w(S)$, the sum running over these families, for the doubly exponential weight $w(S)=2^{2^{n-|S|}}-1$. The kernel-bearing (trivial) part $Z_\\cap(n)$ is exact by inclusion-exclusion and satisfies $Z_\\cap(n)\\sim n\\cdot 2^{3^{n-1}}$. For the kernel-free remainder we prove the exact prefactor $R(n)=(3/4+o(1))n\\cdot 2^{3^{n-1}-2^{n-1}+2}$, whence $\\log_2(Z_\\cap(n)/R(n))=2^{n-1}-2+\\log_2("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16040","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.16040/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-20T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBtX+bCvYYTrjWQm7lJkCQb1YYxeIC+U1kqKLZxSVi2ZWStnyf4i5A1wZtrfMtgKWo/fg/GjlPIRoqLOb1rADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:55:48.872584Z"},"content_sha256":"3f56adf87cff5c536a6b0464c0e9a7cea71f4e243814a0770b6ed4b4549cff03","schema_version":"1.0","event_id":"sha256:3f56adf87cff5c536a6b0464c0e9a7cea71f4e243814a0770b6ed4b4549cff03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X/bundle.json","state_url":"https://pith.science/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X/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-22T04:55:48Z","links":{"resolver":"https://pith.science/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X","bundle":"https://pith.science/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X/bundle.json","state":"https://pith.science/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJVR45DKYVJJJV2IU6JMJ5ZI6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PJVR45DKYVJJJV2IU6JMJ5ZI6X","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":"03dc93257a3e9756ae62d40b6bd905532950ac4d62a20b5efca5774073474eba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T15:15:13Z","title_canon_sha256":"69e8beb8d3e3d5999d45379a3136b10a10f68fbe3c136f691ff6db8f20aaba29"},"schema_version":"1.0","source":{"id":"2607.16040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.16040","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"2607.16040v1","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.16040","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"PJVR45DKYVJJ","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"pith_short_16","alias_value":"PJVR45DKYVJJJV2I","created_at":"2026-07-20T02:19:27Z"},{"alias_kind":"pith_short_8","alias_value":"PJVR45DK","created_at":"2026-07-20T02:19:27Z"}],"graph_snapshots":[{"event_id":"sha256:3f56adf87cff5c536a6b0464c0e9a7cea71f4e243814a0770b6ed4b4549cff03","target":"graph","created_at":"2026-07-20T02:19:27Z","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.16040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $D_n$ be the disjointness graph on the nonempty subsets of $[n]$, whose independent sets are exactly the intersecting families on $[n]$. We study the weighted independent-set polynomial $W(n)=\\sum_F\\prod_{S\\in F}w(S)$, the sum running over these families, for the doubly exponential weight $w(S)=2^{2^{n-|S|}}-1$. The kernel-bearing (trivial) part $Z_\\cap(n)$ is exact by inclusion-exclusion and satisfies $Z_\\cap(n)\\sim n\\cdot 2^{3^{n-1}}$. For the kernel-free remainder we prove the exact prefactor $R(n)=(3/4+o(1))n\\cdot 2^{3^{n-1}-2^{n-1}+2}$, whence $\\log_2(Z_\\cap(n)/R(n))=2^{n-1}-2+\\log_2(","authors_text":"El'mira Yu. Kalimulina","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T15:15:13Z","title":"A gap theorem for non-trivial maximal intersecting families and an exact weighted asymptotic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.16040","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:fc74509ac933417e99d0a54373925610d095ebe4975fd9cb3aba7cc0f900a24c","target":"record","created_at":"2026-07-20T02:19:27Z","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":"03dc93257a3e9756ae62d40b6bd905532950ac4d62a20b5efca5774073474eba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-17T15:15:13Z","title_canon_sha256":"69e8beb8d3e3d5999d45379a3136b10a10f68fbe3c136f691ff6db8f20aaba29"},"schema_version":"1.0","source":{"id":"2607.16040","kind":"arxiv","version":1}},"canonical_sha256":"7a6b1e746ac55294d748a792c4f728f5ce0415fb5e15d13588b991c62a49077b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a6b1e746ac55294d748a792c4f728f5ce0415fb5e15d13588b991c62a49077b","first_computed_at":"2026-07-20T02:19:27.768439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-20T02:19:27.768439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQr8KJdwTwwD0pT6a/f3E55viQkqzHhzIlUOf8UptxgRJXdDUelq9BCq4BjpNvB+6fcjOfsDzUFEbwJ45eJjCA==","signature_status":"signed_v1","signed_at":"2026-07-20T02:19:27.769300Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.16040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc74509ac933417e99d0a54373925610d095ebe4975fd9cb3aba7cc0f900a24c","sha256:3f56adf87cff5c536a6b0464c0e9a7cea71f4e243814a0770b6ed4b4549cff03"],"state_sha256":"d55bd1e6984c7d865149fd668774e68c028ca94a60cf643b5d148b0d0450359f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3w0q585Qu3huzk2FvvSQb6bHFo/5IgwGuPAeuxyWFdcjI2AjUMLajezL4pp8//mcYXy1LU8wONGX6tBsfL+8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T04:55:48.875949Z","bundle_sha256":"a9f821deb2af9aebf69cb9cbcefe51fa111549f47ca84bd4a5d5ba22c90850bb"}}