{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:S63BF5CJM5XWDCXCT7S66XDW2Z","short_pith_number":"pith:S63BF5CJ","schema_version":"1.0","canonical_sha256":"97b612f449676f618ae29fe5ef5c76d6423eec55eb5d0c8df86794b269f1cc30","source":{"kind":"arxiv","id":"1006.0109","version":1},"attestation_state":"computed","paper":{"title":"Results on Binary Linear Codes With Minimum Distance 8 and 10","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik Jakobsson, Iliya Bouyukliev","submitted_at":"2010-06-01T10:57:05Z","abstract_excerpt":"All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact bounds for binary linear codes. Primarily two algorithms considering the dual codes are used, namely extension of dual codes with a proper coordinate, and a fast algorithm for finding a maximum clique in a graph, which is modified to find a maximum set of vectors with the right dependency structure."},"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":"1006.0109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-01T10:57:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"690860bdf9327e6717a882ae5c9c19623fc78af93a27c8581b13b08765f120f7","abstract_canon_sha256":"96ee23921b7ea1dfe870b7b78fc6be95fb64826608a6c797b56c72a5169e02ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.800143Z","signature_b64":"D7QVn5zsZDhA5e8xWRfIbo/XdcjWyiA/wWNPRhDT5YfEbUytk8jVHxRO3+JN2vcadUafhGoX00gPnhp4J662AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b612f449676f618ae29fe5ef5c76d6423eec55eb5d0c8df86794b269f1cc30","last_reissued_at":"2026-05-18T00:57:57.799568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.799568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Results on Binary Linear Codes With Minimum Distance 8 and 10","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik Jakobsson, Iliya Bouyukliev","submitted_at":"2010-06-01T10:57:05Z","abstract_excerpt":"All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact bounds for binary linear codes. Primarily two algorithms considering the dual codes are used, namely extension of dual codes with a proper coordinate, and a fast algorithm for finding a maximum clique in a graph, which is modified to find a maximum set of vectors with the right dependency structure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0109","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":""},"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":"1006.0109","created_at":"2026-05-18T00:57:57.799660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0109v1","created_at":"2026-05-18T00:57:57.799660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0109","created_at":"2026-05-18T00:57:57.799660+00:00"},{"alias_kind":"pith_short_12","alias_value":"S63BF5CJM5XW","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"S63BF5CJM5XWDCXC","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"S63BF5CJ","created_at":"2026-05-18T12:26:13.927090+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/S63BF5CJM5XWDCXCT7S66XDW2Z","json":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z.json","graph_json":"https://pith.science/api/pith-number/S63BF5CJM5XWDCXCT7S66XDW2Z/graph.json","events_json":"https://pith.science/api/pith-number/S63BF5CJM5XWDCXCT7S66XDW2Z/events.json","paper":"https://pith.science/paper/S63BF5CJ"},"agent_actions":{"view_html":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z","download_json":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z.json","view_paper":"https://pith.science/paper/S63BF5CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0109&json=true","fetch_graph":"https://pith.science/api/pith-number/S63BF5CJM5XWDCXCT7S66XDW2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/S63BF5CJM5XWDCXCT7S66XDW2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z/action/storage_attestation","attest_author":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z/action/author_attestation","sign_citation":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z/action/citation_signature","submit_replication":"https://pith.science/pith/S63BF5CJM5XWDCXCT7S66XDW2Z/action/replication_record"}},"created_at":"2026-05-18T00:57:57.799660+00:00","updated_at":"2026-05-18T00:57:57.799660+00:00"}