{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5VPOAWZ3276ZDIL6JN7JN4XM64","short_pith_number":"pith:5VPOAWZ3","schema_version":"1.0","canonical_sha256":"ed5ee05b3bd7fd91a17e4b7e96f2ecf70049cf9073b46bd4d66a92b5c6b78424","source":{"kind":"arxiv","id":"1612.02178","version":2},"attestation_state":"computed","paper":{"title":"Improved upper bound on A(18,8)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Sven Polak","submitted_at":"2016-12-07T10:10:20Z","abstract_excerpt":"For nonnegative integers $n$ and $d$, let $A(n,d)$ be the maximum cardinality of a binary code of length $n$ and minimum distance at least $d$. We consider a slight sharpening of the semidefinite programming bound of Gijswijt, Mittelmann and Schrijver, and obtain that $A(18,8)\\leq 70$."},"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":"1612.02178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-07T10:10:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4d93b092a56aa02e6b1c07fe76a0cbc39764196d9fc33a1019fdb4407e218efa","abstract_canon_sha256":"678f22d57cea2ad74ae2fd4d51779d9287a80676ab6ff3360c52b539e38f6ff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:36.363863Z","signature_b64":"i3t689xNpsdfQn1fiqsjxUTj7CFRcRWnEmbwOWWl2y/V0ucI6YGbEF7dIpqchCItPBqKCkNwjr/98/W11xo1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed5ee05b3bd7fd91a17e4b7e96f2ecf70049cf9073b46bd4d66a92b5c6b78424","last_reissued_at":"2026-05-18T00:49:36.363311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:36.363311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved upper bound on A(18,8)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Sven Polak","submitted_at":"2016-12-07T10:10:20Z","abstract_excerpt":"For nonnegative integers $n$ and $d$, let $A(n,d)$ be the maximum cardinality of a binary code of length $n$ and minimum distance at least $d$. We consider a slight sharpening of the semidefinite programming bound of Gijswijt, Mittelmann and Schrijver, and obtain that $A(18,8)\\leq 70$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02178","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":"1612.02178","created_at":"2026-05-18T00:49:36.363421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02178v2","created_at":"2026-05-18T00:49:36.363421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02178","created_at":"2026-05-18T00:49:36.363421+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VPOAWZ3276Z","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VPOAWZ3276ZDIL6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VPOAWZ3","created_at":"2026-05-18T12:30:01.593930+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/5VPOAWZ3276ZDIL6JN7JN4XM64","json":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64.json","graph_json":"https://pith.science/api/pith-number/5VPOAWZ3276ZDIL6JN7JN4XM64/graph.json","events_json":"https://pith.science/api/pith-number/5VPOAWZ3276ZDIL6JN7JN4XM64/events.json","paper":"https://pith.science/paper/5VPOAWZ3"},"agent_actions":{"view_html":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64","download_json":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64.json","view_paper":"https://pith.science/paper/5VPOAWZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02178&json=true","fetch_graph":"https://pith.science/api/pith-number/5VPOAWZ3276ZDIL6JN7JN4XM64/graph.json","fetch_events":"https://pith.science/api/pith-number/5VPOAWZ3276ZDIL6JN7JN4XM64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64/action/storage_attestation","attest_author":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64/action/author_attestation","sign_citation":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64/action/citation_signature","submit_replication":"https://pith.science/pith/5VPOAWZ3276ZDIL6JN7JN4XM64/action/replication_record"}},"created_at":"2026-05-18T00:49:36.363421+00:00","updated_at":"2026-05-18T00:49:36.363421+00:00"}