{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5CIKE6LXQBUPMCVGYY5OXGTLKC","short_pith_number":"pith:5CIKE6LX","schema_version":"1.0","canonical_sha256":"e890a279778068f60aa6c63aeb9a6b5083689c2e6001809fa0bd3df3d52dc5f4","source":{"kind":"arxiv","id":"2303.16729","version":1},"attestation_state":"computed","paper":{"title":"Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jon-Lark Kim, Minjia Shi, Shitao Li, Tor Helleseth","submitted_at":"2023-03-29T14:34:27Z","abstract_excerpt":"The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a characterization, we determine the exact value of $d_{so}(n,7)$ except for five special cases and the exact value of $d_{so}(n,8)$ except for 41 special cases, where $d_{so}(n,k)$ denotes the largest minimum distance among all binary self-orthogonal $[n, k]$ codes. Currently, the exact value of $d_{so}(n,k)$ $(k \\le 6)$ was determined by Shi et al. (2022). In addition, we "},"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":"2303.16729","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-29T14:34:27Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6532df5a0465892941b02b828e0e7300fa9e63684f78ccf1213b21a86e7d9b29","abstract_canon_sha256":"5d5967e3a12c1e3771fe4c7de9587c37c149a056108a606083b375d461ff66b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:09.744760Z","signature_b64":"ptuBbH5hIWV1au3tfO9MXE6S4AD3GuCIuN6Vl8wqJzGUWzTD8bUEfT1JqCSRJdNPvf+edyeoPX0bh2SqU1ybAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e890a279778068f60aa6c63aeb9a6b5083689c2e6001809fa0bd3df3d52dc5f4","last_reissued_at":"2026-07-05T05:56:09.744336Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:09.744336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jon-Lark Kim, Minjia Shi, Shitao Li, Tor Helleseth","submitted_at":"2023-03-29T14:34:27Z","abstract_excerpt":"The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a characterization, we determine the exact value of $d_{so}(n,7)$ except for five special cases and the exact value of $d_{so}(n,8)$ except for 41 special cases, where $d_{so}(n,k)$ denotes the largest minimum distance among all binary self-orthogonal $[n, k]$ codes. Currently, the exact value of $d_{so}(n,k)$ $(k \\le 6)$ was determined by Shi et al. (2022). In addition, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16729","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.16729/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.16729","created_at":"2026-07-05T05:56:09.744433+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16729v1","created_at":"2026-07-05T05:56:09.744433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16729","created_at":"2026-07-05T05:56:09.744433+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CIKE6LXQBUP","created_at":"2026-07-05T05:56:09.744433+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CIKE6LXQBUPMCVG","created_at":"2026-07-05T05:56:09.744433+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CIKE6LX","created_at":"2026-07-05T05:56:09.744433+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/5CIKE6LXQBUPMCVGYY5OXGTLKC","json":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC.json","graph_json":"https://pith.science/api/pith-number/5CIKE6LXQBUPMCVGYY5OXGTLKC/graph.json","events_json":"https://pith.science/api/pith-number/5CIKE6LXQBUPMCVGYY5OXGTLKC/events.json","paper":"https://pith.science/paper/5CIKE6LX"},"agent_actions":{"view_html":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC","download_json":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC.json","view_paper":"https://pith.science/paper/5CIKE6LX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16729&json=true","fetch_graph":"https://pith.science/api/pith-number/5CIKE6LXQBUPMCVGYY5OXGTLKC/graph.json","fetch_events":"https://pith.science/api/pith-number/5CIKE6LXQBUPMCVGYY5OXGTLKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC/action/storage_attestation","attest_author":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC/action/author_attestation","sign_citation":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC/action/citation_signature","submit_replication":"https://pith.science/pith/5CIKE6LXQBUPMCVGYY5OXGTLKC/action/replication_record"}},"created_at":"2026-07-05T05:56:09.744433+00:00","updated_at":"2026-07-05T05:56:09.744433+00:00"}