{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5YZW3EYY6AAL6BKCQB3DENY32D","short_pith_number":"pith:5YZW3EYY","schema_version":"1.0","canonical_sha256":"ee336d9318f000bf0542807632371bd0c95bcbc46121de7e22bcc50d08759f54","source":{"kind":"arxiv","id":"2606.12178","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of vectors in $\\{0,\\pm1\\}^n$ with forbidden inner products","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilya Lobatskii, Yakov Shubin","submitted_at":"2026-06-10T15:04:20Z","abstract_excerpt":"Let $M \\subset \\{0,\\pm1\\}^n$ be a set such that $(m,m)=4$ for every $m\\in M$, and $(m_1,m_2)\\in\\{-4,-3,-2,-1,0,3\\}$ for any two distinct vectors $m_1,m_2\\in M$. We determine the maximum possible cardinality of such a set $M$ for all sufficiently large $n$."},"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":"2606.12178","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T15:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"eef903a3fdebfb7f996719ba84967a10b5efc9896d55ded010e9b52bfe72d9a0","abstract_canon_sha256":"cf088ba0c6cfbe2b66d73714568c1a6aaa41d8db4da11557dec40585492493ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:52.663702Z","signature_b64":"cPZRTD7D3eUqxyHDgFXfuGDrxDGvQfrL3UCXVyl4YWE1qb5RJ1e/il18o7JPStUwCjRDvirb8A5BTRWyWLb9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee336d9318f000bf0542807632371bd0c95bcbc46121de7e22bcc50d08759f54","last_reissued_at":"2026-06-11T01:10:52.662814Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:52.662814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of vectors in $\\{0,\\pm1\\}^n$ with forbidden inner products","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilya Lobatskii, Yakov Shubin","submitted_at":"2026-06-10T15:04:20Z","abstract_excerpt":"Let $M \\subset \\{0,\\pm1\\}^n$ be a set such that $(m,m)=4$ for every $m\\in M$, and $(m_1,m_2)\\in\\{-4,-3,-2,-1,0,3\\}$ for any two distinct vectors $m_1,m_2\\in M$. We determine the maximum possible cardinality of such a set $M$ for all sufficiently large $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12178","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12178/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":"2606.12178","created_at":"2026-06-11T01:10:52.662967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12178v1","created_at":"2026-06-11T01:10:52.662967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12178","created_at":"2026-06-11T01:10:52.662967+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YZW3EYY6AAL","created_at":"2026-06-11T01:10:52.662967+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YZW3EYY6AAL6BKC","created_at":"2026-06-11T01:10:52.662967+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YZW3EYY","created_at":"2026-06-11T01:10:52.662967+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/5YZW3EYY6AAL6BKCQB3DENY32D","json":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D.json","graph_json":"https://pith.science/api/pith-number/5YZW3EYY6AAL6BKCQB3DENY32D/graph.json","events_json":"https://pith.science/api/pith-number/5YZW3EYY6AAL6BKCQB3DENY32D/events.json","paper":"https://pith.science/paper/5YZW3EYY"},"agent_actions":{"view_html":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D","download_json":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D.json","view_paper":"https://pith.science/paper/5YZW3EYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12178&json=true","fetch_graph":"https://pith.science/api/pith-number/5YZW3EYY6AAL6BKCQB3DENY32D/graph.json","fetch_events":"https://pith.science/api/pith-number/5YZW3EYY6AAL6BKCQB3DENY32D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/action/storage_attestation","attest_author":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/action/author_attestation","sign_citation":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/action/citation_signature","submit_replication":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/action/replication_record"}},"created_at":"2026-06-11T01:10:52.662967+00:00","updated_at":"2026-06-11T01:10:52.662967+00:00"}