{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:45ZMMXHSGDI6N7Y5OJWQTCNC3E","short_pith_number":"pith:45ZMMXHS","schema_version":"1.0","canonical_sha256":"e772c65cf230d1e6ff1d726d0989a2d92ed55ed318d561beab59b489b3ed6136","source":{"kind":"arxiv","id":"2004.08714","version":3},"attestation_state":"computed","paper":{"title":"Almost intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2020-04-18T22:03:41Z","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"},"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":"2004.08714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:03:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8dc2b24082ad5edd1f6c9ce5a02c42bdb292d4a00a6fa2fc2e48d06ed13ba373","abstract_canon_sha256":"74354d1af5ecfdbe4f9d039124d08a525e8dbe4d0762cdcc2825631fc1f31aa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:28.930422Z","signature_b64":"90mz7zViKlSWA+WalzAabbt/f7SPJf5P3PZW/kCzVsa72bvBTkcAARV4IwHXz6JlY+eebyRws4H0RL1a9tsXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e772c65cf230d1e6ff1d726d0989a2d92ed55ed318d561beab59b489b3ed6136","last_reissued_at":"2026-07-05T02:24:28.930072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:28.930072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Peter Frankl","submitted_at":"2020-04-18T22:03:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08714","kind":"arxiv","version":3},"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/2004.08714/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":"2004.08714","created_at":"2026-07-05T02:24:28.930127+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.08714v3","created_at":"2026-07-05T02:24:28.930127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08714","created_at":"2026-07-05T02:24:28.930127+00:00"},{"alias_kind":"pith_short_12","alias_value":"45ZMMXHSGDI6","created_at":"2026-07-05T02:24:28.930127+00:00"},{"alias_kind":"pith_short_16","alias_value":"45ZMMXHSGDI6N7Y5","created_at":"2026-07-05T02:24:28.930127+00:00"},{"alias_kind":"pith_short_8","alias_value":"45ZMMXHS","created_at":"2026-07-05T02:24:28.930127+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/45ZMMXHSGDI6N7Y5OJWQTCNC3E","json":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E.json","graph_json":"https://pith.science/api/pith-number/45ZMMXHSGDI6N7Y5OJWQTCNC3E/graph.json","events_json":"https://pith.science/api/pith-number/45ZMMXHSGDI6N7Y5OJWQTCNC3E/events.json","paper":"https://pith.science/paper/45ZMMXHS"},"agent_actions":{"view_html":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E","download_json":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E.json","view_paper":"https://pith.science/paper/45ZMMXHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.08714&json=true","fetch_graph":"https://pith.science/api/pith-number/45ZMMXHSGDI6N7Y5OJWQTCNC3E/graph.json","fetch_events":"https://pith.science/api/pith-number/45ZMMXHSGDI6N7Y5OJWQTCNC3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E/action/storage_attestation","attest_author":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E/action/author_attestation","sign_citation":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E/action/citation_signature","submit_replication":"https://pith.science/pith/45ZMMXHSGDI6N7Y5OJWQTCNC3E/action/replication_record"}},"created_at":"2026-07-05T02:24:28.930127+00:00","updated_at":"2026-07-05T02:24:28.930127+00:00"}