{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IFK47RDFU245EZRTYH62VZM2Q6","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":"b86da2eb9c099a1cd402adcd3a001541b17a6de5f4e594f75d52c7e8d9756db9","cross_cats_sorted":["math.OC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T11:30:19Z","title_canon_sha256":"0427e6e0381e7c33d576ddbced15c7c8ad4d19c43280170ba1c24490b1717def"},"schema_version":"1.0","source":{"id":"1602.02531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02531","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02531v1","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02531","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"IFK47RDFU245","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IFK47RDFU245EZRT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IFK47RDF","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:89c67c6e4673cbf4433c917189c1f71161e48e6333cf1e6bce50ca75656167fa","target":"graph","created_at":"2026-05-18T00:08:58Z","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"},"paper":{"abstract_excerpt":"For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For any $k$, let $\\CC_k$ be the collection of codes of cardinality at most $k$. Then $A_q(n,d)$ is at most the maximum value of $\\sum_{v\\in[q]^n}x(\\{v\\})$, where $x$ is a function $\\CC_4\\to R_+$ such that $x(\\emptyset)=1$ and $x(C)=0$ if $C$ has minimum distance less than $d$, and such that the $\\CC_2\\times\\CC_2$ matrix $(x(C\\cup C'))_{C,C'\\in\\CC_2}$ is positiv","authors_text":"Alexander Schrijver, Bart Litjens, Sven Polak","cross_cats":["math.OC","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T11:30:19Z","title":"Semidefinite bounds for nonbinary codes based on quadruples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02531","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:ff80800cb1bbbf7d83d6630c22a331fcb2f7244eede58bf6181813b280e3d126","target":"record","created_at":"2026-05-18T00:08:58Z","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":"b86da2eb9c099a1cd402adcd3a001541b17a6de5f4e594f75d52c7e8d9756db9","cross_cats_sorted":["math.OC","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-08T11:30:19Z","title_canon_sha256":"0427e6e0381e7c33d576ddbced15c7c8ad4d19c43280170ba1c24490b1717def"},"schema_version":"1.0","source":{"id":"1602.02531","kind":"arxiv","version":1}},"canonical_sha256":"4155cfc465a6b9d26633c1fdaae59a878795b043684210797666c19841c1f3e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4155cfc465a6b9d26633c1fdaae59a878795b043684210797666c19841c1f3e6","first_computed_at":"2026-05-18T00:08:58.087294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:58.087294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ztzyuhYmMv/T6SRUfgPy2KxS7H7Mdp6r8jPqkv6ffEQtMtuRnVKmzxA1JYeLJCeUuo8geAGHpy73z3fbnyf3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:58.087978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff80800cb1bbbf7d83d6630c22a331fcb2f7244eede58bf6181813b280e3d126","sha256:89c67c6e4673cbf4433c917189c1f71161e48e6333cf1e6bce50ca75656167fa"],"state_sha256":"409bfad19f40e08b780f0382f86f6f09ec9054f8313466a40a327ce4d7aaff6f"}