{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ISZZ22B6CSEYJKOGNQ3TFAPXS7","short_pith_number":"pith:ISZZ22B6","canonical_record":{"source":{"id":"1604.06878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-23T08:32:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c20f2d93e02dfb185b4f07a24a7c03dfe1fd578472b770fe8bab023b392333bc","abstract_canon_sha256":"fcefe71dd65b86a8fbd8ce07f71040ec0989e0dc1110de4b5d8a1fe1bb38799e"},"schema_version":"1.0"},"canonical_sha256":"44b39d683e148984a9c66c373281f797cca72b4140ac0b0600658c8a61747685","source":{"kind":"arxiv","id":"1604.06878","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06878","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06878v2","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06878","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"ISZZ22B6CSEY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ISZZ22B6CSEYJKOG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ISZZ22B6","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ISZZ22B6CSEYJKOGNQ3TFAPXS7","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-23T08:32:37Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c20f2d93e02dfb185b4f07a24a7c03dfe1fd578472b770fe8bab023b392333bc","abstract_canon_sha256":"fcefe71dd65b86a8fbd8ce07f71040ec0989e0dc1110de4b5d8a1fe1bb38799e"},"schema_version":"1.0"},"canonical_sha256":"44b39d683e148984a9c66c373281f797cca72b4140ac0b0600658c8a61747685","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:56.639343Z","signature_b64":"4edMlD4opqj8kYCNwDFlvJtoBxzcPF71S/+xIytUMGXP8etnxpd0kBoKDOQaN5O3jdUMYbLakz13Nzsut3u5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44b39d683e148984a9c66c373281f797cca72b4140ac0b0600658c8a61747685","last_reissued_at":"2026-05-18T01:07:56.638898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:56.638898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06878","source_version":2,"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-05-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azWiZrRV+gE2+ECZOvbmjfeiKH8SAUKbsgui6gASjSr+5xg3B/e8znr1Lf+JXe4RmZVN2x/Vvc1a6YEvR88xAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:26:44.786825Z"},"content_sha256":"389158245568486181bf7f6f79a1ae7dc3170ed4f541d52d05123a2fc28fb7b4","schema_version":"1.0","event_id":"sha256:389158245568486181bf7f6f79a1ae7dc3170ed4f541d52d05123a2fc28fb7b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ISZZ22B6CSEYJKOGNQ3TFAPXS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the performance of optimal double circulant even codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Masaaki Harada, T. Aaron Gulliver","submitted_at":"2016-04-23T08:32:37Z","abstract_excerpt":"In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant even codes that are not self-dual which have the smallest weight distribution for lengths up to $72$. We also give some restrictions on the weight enumerators of (extremal) self-dual $[54,27,10]$ codes with shadows of minimum weight $3$. Finally, we consider the performance of extremal self-dual codes of lengths $88$ and $112$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06878","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"},"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-05-18T01:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzdU1sBNjfSee1nAIGg7hiAE/z3TvhCY0K8vDE7DFvB9Sx2YA+LuI3Oyw3Djp8Tgrd3WVjJWr3xBGD5XIBFLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:26:44.787520Z"},"content_sha256":"3e4de728c856cbeafda619f2a9b2cc22cdf1ad7097f489113c0246bcd948a782","schema_version":"1.0","event_id":"sha256:3e4de728c856cbeafda619f2a9b2cc22cdf1ad7097f489113c0246bcd948a782"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7/bundle.json","state_url":"https://pith.science/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7/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-05-26T20:26:44Z","links":{"resolver":"https://pith.science/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7","bundle":"https://pith.science/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7/bundle.json","state":"https://pith.science/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISZZ22B6CSEYJKOGNQ3TFAPXS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ISZZ22B6CSEYJKOGNQ3TFAPXS7","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":"fcefe71dd65b86a8fbd8ce07f71040ec0989e0dc1110de4b5d8a1fe1bb38799e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-23T08:32:37Z","title_canon_sha256":"c20f2d93e02dfb185b4f07a24a7c03dfe1fd578472b770fe8bab023b392333bc"},"schema_version":"1.0","source":{"id":"1604.06878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06878","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06878v2","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06878","created_at":"2026-05-18T01:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"ISZZ22B6CSEY","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ISZZ22B6CSEYJKOG","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ISZZ22B6","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:3e4de728c856cbeafda619f2a9b2cc22cdf1ad7097f489113c0246bcd948a782","target":"graph","created_at":"2026-05-18T01:07:56Z","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":"In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant even codes that are not self-dual which have the smallest weight distribution for lengths up to $72$. We also give some restrictions on the weight enumerators of (extremal) self-dual $[54,27,10]$ codes with shadows of minimum weight $3$. Finally, we consider the performance of extremal self-dual codes of lengths $88$ and $112$.","authors_text":"Masaaki Harada, T. Aaron Gulliver","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-23T08:32:37Z","title":"On the performance of optimal double circulant even codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06878","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:389158245568486181bf7f6f79a1ae7dc3170ed4f541d52d05123a2fc28fb7b4","target":"record","created_at":"2026-05-18T01:07:56Z","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":"fcefe71dd65b86a8fbd8ce07f71040ec0989e0dc1110de4b5d8a1fe1bb38799e","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-23T08:32:37Z","title_canon_sha256":"c20f2d93e02dfb185b4f07a24a7c03dfe1fd578472b770fe8bab023b392333bc"},"schema_version":"1.0","source":{"id":"1604.06878","kind":"arxiv","version":2}},"canonical_sha256":"44b39d683e148984a9c66c373281f797cca72b4140ac0b0600658c8a61747685","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44b39d683e148984a9c66c373281f797cca72b4140ac0b0600658c8a61747685","first_computed_at":"2026-05-18T01:07:56.638898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:56.638898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4edMlD4opqj8kYCNwDFlvJtoBxzcPF71S/+xIytUMGXP8etnxpd0kBoKDOQaN5O3jdUMYbLakz13Nzsut3u5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:56.639343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:389158245568486181bf7f6f79a1ae7dc3170ed4f541d52d05123a2fc28fb7b4","sha256:3e4de728c856cbeafda619f2a9b2cc22cdf1ad7097f489113c0246bcd948a782"],"state_sha256":"6e95baab0d6c1f8e9f82e793e1adf7c8b5e9b8b577944d873eee5f783acdfa1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+mR2+/m0bh28NQth6FkpLz9GWpL+RChO9l9m+cl4oiQEQDUhF++esaNUVPk0CHkjyZDRvCK5YfZebwizRpIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:26:44.791712Z","bundle_sha256":"4d045808aea7dd9401cfdcdaed1423ae015b0e7113a9cc9b61b9684c267f4242"}}