{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:53XNPBB6C7KSSK4KZHD7HNDIPW","short_pith_number":"pith:53XNPBB6","schema_version":"1.0","canonical_sha256":"eeeed7843e17d5292b8ac9c7f3b4687d8a2f35a37c0b83e062e3dfdf5064a3c0","source":{"kind":"arxiv","id":"1510.03912","version":2},"attestation_state":"computed","paper":{"title":"Erd\\H os-Ko-Rado theorem for $\\{0,\\pm 1\\}$-vectors","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":"2015-10-13T22:05:18Z","abstract_excerpt":"The main object of this paper is to determine the maximum number of $\\{0,\\pm 1\\}$-vectors subject to the following condition. All vectors have length $n$, exactly $k$ of the coordinates are $+1$ and one is $-1$, $n \\geq 2k$. Moreover, there are no two vectors whose scalar product equals the possible minimum, $-2$. Thus, this problem may be seen as an extension of the classical Erd\\H os-Ko-Rado theorem. Rather surprisingly there is a phase transition in the behaviour of the maximum at $n=k^2$. Nevertheless, our solution is complete. The main tools are from extremal set theory and some of them m"},"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":"1510.03912","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-13T22:05:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"49926be8f3545b683a138fda9053ca4231888f35b0e75bf19f25870adb72dd06","abstract_canon_sha256":"fae7e258840ce2465082ecac0e1683c0c641e8a90a69ddf14bef0950bfe35a4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.787952Z","signature_b64":"ZUWDB7QsX4XAtdInG865RabpURWQ0wk9T38SDZ4X6im0/q5OLt6byUWNL8sEEegO3Rhvv4oQvJlQy9103VYrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeeed7843e17d5292b8ac9c7f3b4687d8a2f35a37c0b83e062e3dfdf5064a3c0","last_reissued_at":"2026-05-18T00:29:15.787297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.787297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H os-Ko-Rado theorem for $\\{0,\\pm 1\\}$-vectors","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":"2015-10-13T22:05:18Z","abstract_excerpt":"The main object of this paper is to determine the maximum number of $\\{0,\\pm 1\\}$-vectors subject to the following condition. All vectors have length $n$, exactly $k$ of the coordinates are $+1$ and one is $-1$, $n \\geq 2k$. Moreover, there are no two vectors whose scalar product equals the possible minimum, $-2$. Thus, this problem may be seen as an extension of the classical Erd\\H os-Ko-Rado theorem. Rather surprisingly there is a phase transition in the behaviour of the maximum at $n=k^2$. Nevertheless, our solution is complete. The main tools are from extremal set theory and some of them m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03912","kind":"arxiv","version":2},"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":"1510.03912","created_at":"2026-05-18T00:29:15.787398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03912v2","created_at":"2026-05-18T00:29:15.787398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03912","created_at":"2026-05-18T00:29:15.787398+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/53XNPBB6C7KSSK4KZHD7HNDIPW","json":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW.json","graph_json":"https://pith.science/api/pith-number/53XNPBB6C7KSSK4KZHD7HNDIPW/graph.json","events_json":"https://pith.science/api/pith-number/53XNPBB6C7KSSK4KZHD7HNDIPW/events.json","paper":"https://pith.science/paper/53XNPBB6"},"agent_actions":{"view_html":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW","download_json":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW.json","view_paper":"https://pith.science/paper/53XNPBB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03912&json=true","fetch_graph":"https://pith.science/api/pith-number/53XNPBB6C7KSSK4KZHD7HNDIPW/graph.json","fetch_events":"https://pith.science/api/pith-number/53XNPBB6C7KSSK4KZHD7HNDIPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW/action/storage_attestation","attest_author":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW/action/author_attestation","sign_citation":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW/action/citation_signature","submit_replication":"https://pith.science/pith/53XNPBB6C7KSSK4KZHD7HNDIPW/action/replication_record"}},"created_at":"2026-05-18T00:29:15.787398+00:00","updated_at":"2026-05-18T00:29:15.787398+00:00"}