{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EFZAVISJDSW77Z2J4SDMJHOPYW","short_pith_number":"pith:EFZAVISJ","schema_version":"1.0","canonical_sha256":"21720aa2491cadffe749e486c49dcfc5b9b37137c6602eb84d4bc13625b1450a","source":{"kind":"arxiv","id":"1808.01229","version":1},"attestation_state":"computed","paper":{"title":"Incompatible intersection properties","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":"2018-08-03T15:29:16Z","abstract_excerpt":"Let $\\mathcal F\\subset 2^{[n]}$ be a family in which any three sets have non-empty intersection and any two sets have at least $38$ elements in common. The nearly best possible bound $|\\mathcal F|\\le 2^{n-2}$ is proved. We believe that $38$ can be replaced by $3$ and provide a simple-looking conjecture that would imply this."},"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":"1808.01229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-03T15:29:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"25d71d7a2f8f6a3e76c5bea27e4feee5b6804daadb2d93aa705e735fbcaef774","abstract_canon_sha256":"5c7352f1330ba7058ddaf5310a96e3b22616418a9bcdd0c08f68903a6bee855b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:58.573425Z","signature_b64":"pSMNzrUcaueP9jvRNe/+uu92rNSVvP/yfXT+8f55Ven3LhDZ3uWxwCM7aOX5e3ZpntcZyoAfRrQNxyMG5YajAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21720aa2491cadffe749e486c49dcfc5b9b37137c6602eb84d4bc13625b1450a","last_reissued_at":"2026-05-18T00:08:58.572627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:58.572627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incompatible intersection properties","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":"2018-08-03T15:29:16Z","abstract_excerpt":"Let $\\mathcal F\\subset 2^{[n]}$ be a family in which any three sets have non-empty intersection and any two sets have at least $38$ elements in common. The nearly best possible bound $|\\mathcal F|\\le 2^{n-2}$ is proved. We believe that $38$ can be replaced by $3$ and provide a simple-looking conjecture that would imply this."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01229","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":""},"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":"1808.01229","created_at":"2026-05-18T00:08:58.572753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.01229v1","created_at":"2026-05-18T00:08:58.572753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01229","created_at":"2026-05-18T00:08:58.572753+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFZAVISJDSW7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFZAVISJDSW77Z2J","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFZAVISJ","created_at":"2026-05-18T12:32:22.470017+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/EFZAVISJDSW77Z2J4SDMJHOPYW","json":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW.json","graph_json":"https://pith.science/api/pith-number/EFZAVISJDSW77Z2J4SDMJHOPYW/graph.json","events_json":"https://pith.science/api/pith-number/EFZAVISJDSW77Z2J4SDMJHOPYW/events.json","paper":"https://pith.science/paper/EFZAVISJ"},"agent_actions":{"view_html":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW","download_json":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW.json","view_paper":"https://pith.science/paper/EFZAVISJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.01229&json=true","fetch_graph":"https://pith.science/api/pith-number/EFZAVISJDSW77Z2J4SDMJHOPYW/graph.json","fetch_events":"https://pith.science/api/pith-number/EFZAVISJDSW77Z2J4SDMJHOPYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW/action/storage_attestation","attest_author":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW/action/author_attestation","sign_citation":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW/action/citation_signature","submit_replication":"https://pith.science/pith/EFZAVISJDSW77Z2J4SDMJHOPYW/action/replication_record"}},"created_at":"2026-05-18T00:08:58.572753+00:00","updated_at":"2026-05-18T00:08:58.572753+00:00"}