{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SQEMNE4S5U5RJYQFJOJ4RSXDZF","short_pith_number":"pith:SQEMNE4S","schema_version":"1.0","canonical_sha256":"9408c69392ed3b14e2054b93c8cae3c95c0906cbff59f251e09d19795987d082","source":{"kind":"arxiv","id":"1706.03740","version":1},"attestation_state":"computed","paper":{"title":"Forbidden vector-valued intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eoin Long, Peter Keevash","submitted_at":"2017-06-12T17:22:37Z","abstract_excerpt":"We solve a generalised form of a conjecture of Kalai motivated by attempts to improve the bounds for Borsuk's problem. The conjecture can be roughly understood as asking for an analogue of the Frankl-R\\\"odl forbidden intersection theorem in which set intersections are vector-valued. We discover that the vector world is richer in surprising ways: in particular, Kalai's conjecture is false, but we prove a corrected statement that is essentially best possible, and applies to a considerably more general setting. Our methods include the use of maximum entropy measures, VC-dimension, Dependent Rando"},"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":"1706.03740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-12T17:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"31cacbb0e61dfed967799dafb8b38e37fa35d4dcb11bd3839fa9b971dfa2c972","abstract_canon_sha256":"b8513b0f390ee31853c0fa25f6050470655fb0a829a0603ad0c6c0ac20488350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.870827Z","signature_b64":"ELgISK6DFj76zCfoUAwWd2xbEp38Nwa2ZyHx38Vmsxab2JB4aL9spvOz0ctw2K1gRV4fWVYf2Baj2pSCMVYjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9408c69392ed3b14e2054b93c8cae3c95c0906cbff59f251e09d19795987d082","last_reissued_at":"2026-05-18T00:42:33.870159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.870159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidden vector-valued intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eoin Long, Peter Keevash","submitted_at":"2017-06-12T17:22:37Z","abstract_excerpt":"We solve a generalised form of a conjecture of Kalai motivated by attempts to improve the bounds for Borsuk's problem. The conjecture can be roughly understood as asking for an analogue of the Frankl-R\\\"odl forbidden intersection theorem in which set intersections are vector-valued. We discover that the vector world is richer in surprising ways: in particular, Kalai's conjecture is false, but we prove a corrected statement that is essentially best possible, and applies to a considerably more general setting. Our methods include the use of maximum entropy measures, VC-dimension, Dependent Rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03740","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":"1706.03740","created_at":"2026-05-18T00:42:33.870267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03740v1","created_at":"2026-05-18T00:42:33.870267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03740","created_at":"2026-05-18T00:42:33.870267+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQEMNE4S5U5R","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQEMNE4S5U5RJYQF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQEMNE4S","created_at":"2026-05-18T12:31:43.269735+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/SQEMNE4S5U5RJYQFJOJ4RSXDZF","json":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF.json","graph_json":"https://pith.science/api/pith-number/SQEMNE4S5U5RJYQFJOJ4RSXDZF/graph.json","events_json":"https://pith.science/api/pith-number/SQEMNE4S5U5RJYQFJOJ4RSXDZF/events.json","paper":"https://pith.science/paper/SQEMNE4S"},"agent_actions":{"view_html":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF","download_json":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF.json","view_paper":"https://pith.science/paper/SQEMNE4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03740&json=true","fetch_graph":"https://pith.science/api/pith-number/SQEMNE4S5U5RJYQFJOJ4RSXDZF/graph.json","fetch_events":"https://pith.science/api/pith-number/SQEMNE4S5U5RJYQFJOJ4RSXDZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF/action/storage_attestation","attest_author":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF/action/author_attestation","sign_citation":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF/action/citation_signature","submit_replication":"https://pith.science/pith/SQEMNE4S5U5RJYQFJOJ4RSXDZF/action/replication_record"}},"created_at":"2026-05-18T00:42:33.870267+00:00","updated_at":"2026-05-18T00:42:33.870267+00:00"}