{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2N24CP6GLHLWB6QM54PFNFVQ5Y","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":"713ef93ee44d7c940d4f42a1cfbaac9f069cea59285dd7069bb6f9863e56dd23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-16T11:17:09Z","title_canon_sha256":"58cc8cdc0c99117876944862f98e820de8030fea373f202510e34e12a2382b19"},"schema_version":"1.0","source":{"id":"1606.05144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05144","created_at":"2026-05-18T00:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05144v2","created_at":"2026-05-18T00:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05144","created_at":"2026-05-18T00:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"2N24CP6GLHLW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2N24CP6GLHLWB6QM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2N24CP6G","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:89f9a19f3df8ef420e8eda82f80ae180c6187d607b44778bbbd3ba6eca7e7bb0","target":"graph","created_at":"2026-05-18T00:08:57Z","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 $q,n,d \\in \\mathbb{N}$, let $A_q(n,d)$ be the maximum size of a code $C \\subseteq [q]^n$ with minimum distance at least $d$. We give a divisibility argument resulting in the new upper bounds $A_5(8,6) \\leq 65$, $A_4(11,8)\\leq 60$ and $A_3(16,11) \\leq 29$. These in turn imply the new upper bounds $A_5(9,6) \\leq 325$, $A_5(10,6) \\leq 1625$, $A_5(11,6) \\leq 8125$ and $A_4(12,8) \\leq 240$. Furthermore, we prove that for $\\mu,q \\in \\mathbb{N}$, there is a 1-1-correspondence between symmetric $(\\mu,q)$-nets (which are certain designs) and codes $C \\subseteq [q]^{\\mu q}$ of size $\\mu q^2$ with mi","authors_text":"Sven Polak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-16T11:17:09Z","title":"New nonbinary code bounds based on divisibility arguments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05144","kind":"arxiv","version":2},"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:dba1d538ce8c887a383ce91e9e9d37d6be2da36ea6980dcb90b4624fc0a2d0eb","target":"record","created_at":"2026-05-18T00:08:57Z","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":"713ef93ee44d7c940d4f42a1cfbaac9f069cea59285dd7069bb6f9863e56dd23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-16T11:17:09Z","title_canon_sha256":"58cc8cdc0c99117876944862f98e820de8030fea373f202510e34e12a2382b19"},"schema_version":"1.0","source":{"id":"1606.05144","kind":"arxiv","version":2}},"canonical_sha256":"d375c13fc659d760fa0cef1e5696b0ee0892f0cb8a8b7a8b54ea92129453a2cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d375c13fc659d760fa0cef1e5696b0ee0892f0cb8a8b7a8b54ea92129453a2cd","first_computed_at":"2026-05-18T00:08:57.923912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:57.923912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j2yiPsoPJ8vPj+AldD2rMT0kMu681SIf21jyEi4+UfjIU5iYDrPbH/0yRDbB6joDYBKEOkbPUgAgqFg78caHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:57.924752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dba1d538ce8c887a383ce91e9e9d37d6be2da36ea6980dcb90b4624fc0a2d0eb","sha256:89f9a19f3df8ef420e8eda82f80ae180c6187d607b44778bbbd3ba6eca7e7bb0"],"state_sha256":"50b2e1800ae3396fcdb9ba1e7f499359564e5ca22664aa1e7cebb3653371ecd5"}