{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:45ZMMXHSGDI6N7Y5OJWQTCNC3E","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":"74354d1af5ecfdbe4f9d039124d08a525e8dbe4d0762cdcc2825631fc1f31aa9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:03:41Z","title_canon_sha256":"8dc2b24082ad5edd1f6c9ce5a02c42bdb292d4a00a6fa2fc2e48d06ed13ba373"},"schema_version":"1.0","source":{"id":"2004.08714","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08714","created_at":"2026-07-05T02:24:28Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08714v3","created_at":"2026-07-05T02:24:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08714","created_at":"2026-07-05T02:24:28Z"},{"alias_kind":"pith_short_12","alias_value":"45ZMMXHSGDI6","created_at":"2026-07-05T02:24:28Z"},{"alias_kind":"pith_short_16","alias_value":"45ZMMXHSGDI6N7Y5","created_at":"2026-07-05T02:24:28Z"},{"alias_kind":"pith_short_8","alias_value":"45ZMMXHS","created_at":"2026-07-05T02:24:28Z"}],"graph_snapshots":[{"event_id":"sha256:68a76db90eb3c86dfc70ae07599dcc9ab0e04dacf5d5869d3286be9b2a3e8c02","target":"graph","created_at":"2026-07-05T02:24:28Z","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/2004.08714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $n > k > 1$ be integers, $[n] = \\{1, \\ldots, n\\}$. Let $\\mathcal F$ be a family of $k$-subsets of~$[n]$. The family $\\mathcal F$ is called intersecting if $F \\cap F' \\neq \\emptyset$ for all $F, F' \\in \\mathcal F$. It is called almost intersecting if it is not intersecting but to every $F \\in \\mathcal F$ there is at most one $F'\\in \\mathcal F$ satisfying $F \\cap F' = \\emptyset$. Gerbner et al. proved that if $n \\geq 2k + 2$ then $|\\mathcal F| \\leq {n - 1\\choose k - 1}$ holds for almost intersecting families. The main result implies the considerably stronger and best possible bound $|\\mathca","authors_text":"Andrey Kupavskii, Peter Frankl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:03:41Z","title":"Almost intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08714","kind":"arxiv","version":3},"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:7f914c940acd8b08973d4d1a9b40c81097adadab87509ada6c0c15f75033f09a","target":"record","created_at":"2026-07-05T02:24:28Z","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":"74354d1af5ecfdbe4f9d039124d08a525e8dbe4d0762cdcc2825631fc1f31aa9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:03:41Z","title_canon_sha256":"8dc2b24082ad5edd1f6c9ce5a02c42bdb292d4a00a6fa2fc2e48d06ed13ba373"},"schema_version":"1.0","source":{"id":"2004.08714","kind":"arxiv","version":3}},"canonical_sha256":"e772c65cf230d1e6ff1d726d0989a2d92ed55ed318d561beab59b489b3ed6136","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e772c65cf230d1e6ff1d726d0989a2d92ed55ed318d561beab59b489b3ed6136","first_computed_at":"2026-07-05T02:24:28.930072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:24:28.930072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"90mz7zViKlSWA+WalzAabbt/f7SPJf5P3PZW/kCzVsa72bvBTkcAARV4IwHXz6JlY+eebyRws4H0RL1a9tsXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:24:28.930422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08714","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f914c940acd8b08973d4d1a9b40c81097adadab87509ada6c0c15f75033f09a","sha256:68a76db90eb3c86dfc70ae07599dcc9ab0e04dacf5d5869d3286be9b2a3e8c02"],"state_sha256":"160fd8516aeaa8b71c1cf518c61ea82ad2cd1522d7a584677f65a4bcab81fdb6"}