{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:M2XVMOUNJDDJXIMT2KCUMB3OGD","short_pith_number":"pith:M2XVMOUN","schema_version":"1.0","canonical_sha256":"66af563a8d48c69ba193d28546076e30f37c82ec1de6fa0184fbe0f67d0821ab","source":{"kind":"arxiv","id":"0804.4194","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Bound on Binary Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Ding","submitted_at":"2008-04-26T01:45:27Z","abstract_excerpt":"We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound, the relative minimum distance \\delta\\approx 0.0595 (for GV bound, \\delta\\approx 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound."},"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":"0804.4194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-26T01:45:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"12d4a69117eac974f589e623bf0e28371533230d8318f8409e6682fe17bfee2c","abstract_canon_sha256":"17ed3943d71032d1b278c6a18d91d7754c9e1765e9733b2867efdd543afc2762"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:53.350666Z","signature_b64":"NykJU5shiK5nnOlreCxU8EGhplhZ5KJXSTU+LKFQ/NGLMyuhSHHB2FxFEl5+2+Qn+Q27kmy5qL8L6o90BaB9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66af563a8d48c69ba193d28546076e30f37c82ec1de6fa0184fbe0f67d0821ab","last_reissued_at":"2026-05-18T02:15:53.350039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:53.350039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Bound on Binary Self-Orthogonal Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yang Ding","submitted_at":"2008-04-26T01:45:27Z","abstract_excerpt":"We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R=1/2, by our constructive lower bound, the relative minimum distance \\delta\\approx 0.0595 (for GV bound, \\delta\\approx 0.110). Moreover, we have proved that the binary self-orthogonal codes asymptotically achieve the Gilbert-Varshamov bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4194","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":"0804.4194","created_at":"2026-05-18T02:15:53.350165+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.4194v1","created_at":"2026-05-18T02:15:53.350165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4194","created_at":"2026-05-18T02:15:53.350165+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2XVMOUNJDDJ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2XVMOUNJDDJXIMT","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2XVMOUN","created_at":"2026-05-18T12:25:57.157939+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/M2XVMOUNJDDJXIMT2KCUMB3OGD","json":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD.json","graph_json":"https://pith.science/api/pith-number/M2XVMOUNJDDJXIMT2KCUMB3OGD/graph.json","events_json":"https://pith.science/api/pith-number/M2XVMOUNJDDJXIMT2KCUMB3OGD/events.json","paper":"https://pith.science/paper/M2XVMOUN"},"agent_actions":{"view_html":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD","download_json":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD.json","view_paper":"https://pith.science/paper/M2XVMOUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.4194&json=true","fetch_graph":"https://pith.science/api/pith-number/M2XVMOUNJDDJXIMT2KCUMB3OGD/graph.json","fetch_events":"https://pith.science/api/pith-number/M2XVMOUNJDDJXIMT2KCUMB3OGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD/action/storage_attestation","attest_author":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD/action/author_attestation","sign_citation":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD/action/citation_signature","submit_replication":"https://pith.science/pith/M2XVMOUNJDDJXIMT2KCUMB3OGD/action/replication_record"}},"created_at":"2026-05-18T02:15:53.350165+00:00","updated_at":"2026-05-18T02:15:53.350165+00:00"}