{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5YZW3EYY6AAL6BKCQB3DENY32D","short_pith_number":"pith:5YZW3EYY","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"},"canonical_sha256":"ee336d9318f000bf0542807632371bd0c95bcbc46121de7e22bcc50d08759f54","source":{"kind":"arxiv","id":"2606.12178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12178","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12178v1","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12178","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"5YZW3EYY6AAL","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_16","alias_value":"5YZW3EYY6AAL6BKC","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_8","alias_value":"5YZW3EYY","created_at":"2026-06-11T01:10:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5YZW3EYY6AAL6BKCQB3DENY32D","target":"record","payload":{"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"},"canonical_sha256":"ee336d9318f000bf0542807632371bd0c95bcbc46121de7e22bcc50d08759f54","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"},"source_kind":"arxiv","source_id":"2606.12178","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6sVX6y1mzt0Q+6Rp7vXuzmP97pqyNEpTy8USwC/ya/b9sBU9GjURky2tO+nCG3VDG+epuflixoV/23usVQ7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:42:42.820418Z"},"content_sha256":"12e8fad20e219d403398fd7c9628b47a2a43b938fce0ba5d82515cf832b459ed","schema_version":"1.0","event_id":"sha256:12e8fad20e219d403398fd7c9628b47a2a43b938fce0ba5d82515cf832b459ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5YZW3EYY6AAL6BKCQB3DENY32D","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:10:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OevMHqg0muPzq7QWNuCP6BuPLE1B8N0Ifb/3JuvbgT6790xc+5tjO/+CGNTFx2xcLHPmIDPTv41V6mYseIAzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:42:42.820792Z"},"content_sha256":"d2b5c8c288bfb7b2551af2cbe192d86773f00d65daba4ad93f86c299883a83c9","schema_version":"1.0","event_id":"sha256:d2b5c8c288bfb7b2551af2cbe192d86773f00d65daba4ad93f86c299883a83c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/bundle.json","state_url":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YZW3EYY6AAL6BKCQB3DENY32D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T09:42:42Z","links":{"resolver":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D","bundle":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/bundle.json","state":"https://pith.science/pith/5YZW3EYY6AAL6BKCQB3DENY32D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YZW3EYY6AAL6BKCQB3DENY32D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5YZW3EYY6AAL6BKCQB3DENY32D","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cf088ba0c6cfbe2b66d73714568c1a6aaa41d8db4da11557dec40585492493ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T15:04:20Z","title_canon_sha256":"eef903a3fdebfb7f996719ba84967a10b5efc9896d55ded010e9b52bfe72d9a0"},"schema_version":"1.0","source":{"id":"2606.12178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12178","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12178v1","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12178","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_12","alias_value":"5YZW3EYY6AAL","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_16","alias_value":"5YZW3EYY6AAL6BKC","created_at":"2026-06-11T01:10:52Z"},{"alias_kind":"pith_short_8","alias_value":"5YZW3EYY","created_at":"2026-06-11T01:10:52Z"}],"graph_snapshots":[{"event_id":"sha256:d2b5c8c288bfb7b2551af2cbe192d86773f00d65daba4ad93f86c299883a83c9","target":"graph","created_at":"2026-06-11T01:10:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.12178/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Ilya Lobatskii, Yakov Shubin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T15:04:20Z","title":"On the maximum number of vectors in $\\{0,\\pm1\\}^n$ with forbidden inner products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12178","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:12e8fad20e219d403398fd7c9628b47a2a43b938fce0ba5d82515cf832b459ed","target":"record","created_at":"2026-06-11T01:10:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cf088ba0c6cfbe2b66d73714568c1a6aaa41d8db4da11557dec40585492493ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T15:04:20Z","title_canon_sha256":"eef903a3fdebfb7f996719ba84967a10b5efc9896d55ded010e9b52bfe72d9a0"},"schema_version":"1.0","source":{"id":"2606.12178","kind":"arxiv","version":1}},"canonical_sha256":"ee336d9318f000bf0542807632371bd0c95bcbc46121de7e22bcc50d08759f54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee336d9318f000bf0542807632371bd0c95bcbc46121de7e22bcc50d08759f54","first_computed_at":"2026-06-11T01:10:52.662814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:52.662814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPZRTD7D3eUqxyHDgFXfuGDrxDGvQfrL3UCXVyl4YWE1qb5RJ1e/il18o7JPStUwCjRDvirb8A5BTRWyWLb9Cw==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:52.663702Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e8fad20e219d403398fd7c9628b47a2a43b938fce0ba5d82515cf832b459ed","sha256:d2b5c8c288bfb7b2551af2cbe192d86773f00d65daba4ad93f86c299883a83c9"],"state_sha256":"c467d1c24c74b5ab984cd5f03d212f5b4eb1f489b517a6e0ab60f3bf4b0fd6db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85BIBKkMnWTuydzG+lME/sl9ooLI7l8k40hk6HcAqeOzGxhdppy5XlU4VIhZKc0JUgAyrKE+qVzlgIBIK2aBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:42:42.822765Z","bundle_sha256":"1c546842b84219e84bcf3164a6ef1d789eca12724c28910088ad952e33e2ab13"}}