{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OHOVDIXHT65CRMJFEIL7IZ7Z7K","short_pith_number":"pith:OHOVDIXH","schema_version":"1.0","canonical_sha256":"71dd51a2e79fba28b1252217f467f9fabe92b67352e0a315f701be1660071561","source":{"kind":"arxiv","id":"1603.00938","version":4},"attestation_state":"computed","paper":{"title":"Intersection theorems for $\\{0,\\pm 1\\}$-vectors and $s$-cross-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":"2016-03-03T00:20:22Z","abstract_excerpt":"In this paper we study two directions of extending the classical Erd\\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \\{1,\\ldots,n\\}$ in which any two sets intersect, has cardinality at most ${n-1\\choose k-1}$.\n  In the first part of the paper we study the families of $\\{0,\\pm 1\\}$-vectors. Denote by $\\mathcal L_k$ the family of all vectors $\\mathbf v$ from $\\{0,\\pm 1\\}^n$ such that $\\langle\\mathbf v,\\mathbf v\\rangle = k$. For any $k$, most $l$ and sufficiently large $n$ we determine the maximal size of the family $\\mathcal V\\subset \\mathcal L_k$ such "},"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":"1603.00938","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-03T00:20:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c15d2a2a13503334556fced8eae1a95fbc2ebfef74245a0f84ce7645a77670da","abstract_canon_sha256":"42136e287b0af64585930f1120c68391cb9d4c071b52b4ff6c5a5eaa803ea0b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:43.690953Z","signature_b64":"OorW0eIqkAo+2Q7fjW5Mbcv5rVpiLJqs2eE0knIFiwYu0uGPnq050Gy5FkqJN1Jgt3GLTAkzM30E2GyxYXN6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71dd51a2e79fba28b1252217f467f9fabe92b67352e0a315f701be1660071561","last_reissued_at":"2026-05-17T23:44:43.690515Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:43.690515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersection theorems for $\\{0,\\pm 1\\}$-vectors and $s$-cross-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":"2016-03-03T00:20:22Z","abstract_excerpt":"In this paper we study two directions of extending the classical Erd\\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \\{1,\\ldots,n\\}$ in which any two sets intersect, has cardinality at most ${n-1\\choose k-1}$.\n  In the first part of the paper we study the families of $\\{0,\\pm 1\\}$-vectors. Denote by $\\mathcal L_k$ the family of all vectors $\\mathbf v$ from $\\{0,\\pm 1\\}^n$ such that $\\langle\\mathbf v,\\mathbf v\\rangle = k$. For any $k$, most $l$ and sufficiently large $n$ we determine the maximal size of the family $\\mathcal V\\subset \\mathcal L_k$ such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00938","kind":"arxiv","version":4},"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":"1603.00938","created_at":"2026-05-17T23:44:43.690578+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00938v4","created_at":"2026-05-17T23:44:43.690578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00938","created_at":"2026-05-17T23:44:43.690578+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHOVDIXHT65C","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHOVDIXHT65CRMJF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHOVDIXH","created_at":"2026-05-18T12:30:36.002864+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/OHOVDIXHT65CRMJFEIL7IZ7Z7K","json":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K.json","graph_json":"https://pith.science/api/pith-number/OHOVDIXHT65CRMJFEIL7IZ7Z7K/graph.json","events_json":"https://pith.science/api/pith-number/OHOVDIXHT65CRMJFEIL7IZ7Z7K/events.json","paper":"https://pith.science/paper/OHOVDIXH"},"agent_actions":{"view_html":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K","download_json":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K.json","view_paper":"https://pith.science/paper/OHOVDIXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00938&json=true","fetch_graph":"https://pith.science/api/pith-number/OHOVDIXHT65CRMJFEIL7IZ7Z7K/graph.json","fetch_events":"https://pith.science/api/pith-number/OHOVDIXHT65CRMJFEIL7IZ7Z7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K/action/storage_attestation","attest_author":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K/action/author_attestation","sign_citation":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K/action/citation_signature","submit_replication":"https://pith.science/pith/OHOVDIXHT65CRMJFEIL7IZ7Z7K/action/replication_record"}},"created_at":"2026-05-17T23:44:43.690578+00:00","updated_at":"2026-05-17T23:44:43.690578+00:00"}