{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DXD7CSUBETCCEGX6QVKHQ37BDX","short_pith_number":"pith:DXD7CSUB","canonical_record":{"source":{"id":"2210.06241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-10-12T14:27:23Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"b594d9d4f8e97228127ca381c0ca7d6c0ff5db782e5e05e16379ab52b1ac4682","abstract_canon_sha256":"a7bc853d9aa6abaf44dcb9a3798643a3ab8d337e4a1b759a8c44ca58a15740ed"},"schema_version":"1.0"},"canonical_sha256":"1dc7f14a8124c4221afe8554786fe11de8d2141d527adbe91dc3f57fe158130b","source":{"kind":"arxiv","id":"2210.06241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.06241","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2210.06241v1","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06241","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"DXD7CSUBETCC","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"DXD7CSUBETCCEGX6","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"DXD7CSUB","created_at":"2026-07-05T05:05:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DXD7CSUBETCCEGX6QVKHQ37BDX","target":"record","payload":{"canonical_record":{"source":{"id":"2210.06241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-10-12T14:27:23Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"b594d9d4f8e97228127ca381c0ca7d6c0ff5db782e5e05e16379ab52b1ac4682","abstract_canon_sha256":"a7bc853d9aa6abaf44dcb9a3798643a3ab8d337e4a1b759a8c44ca58a15740ed"},"schema_version":"1.0"},"canonical_sha256":"1dc7f14a8124c4221afe8554786fe11de8d2141d527adbe91dc3f57fe158130b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:58.099410Z","signature_b64":"O9Sb6SnInowVL440uSHzssmMZpP0HEEUV2kWmusXEBUik1iG3eL2lcQxO9EX05CbhWMFbKY6WR3tI+UafgIoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dc7f14a8124c4221afe8554786fe11de8d2141d527adbe91dc3f57fe158130b","last_reissued_at":"2026-07-05T05:05:58.098987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:58.098987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.06241","source_version":1,"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-07-05T05:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CT2xJVdHY9NxhWa/J9W/SMo2eM/90b1SQW+j56i0Hf2ZdwyRLs0tCWYP9+i2nbOsXRYwoPVAOnP3nd+kE//sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:12:58.322705Z"},"content_sha256":"80c5edb68fb44e8fbc44bcd9237b6ac2eaa7dc43f222979af0ad6ce6d551b561","schema_version":"1.0","event_id":"sha256:80c5edb68fb44e8fbc44bcd9237b6ac2eaa7dc43f222979af0ad6ce6d551b561"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DXD7CSUBETCCEGX6QVKHQ37BDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5","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","submitted_at":"2022-10-12T14:27:23Z","abstract_excerpt":"The purpose of this paper is to solve the two conjectures on the largest minimum distance $d_{so}(n,5)$ of a binary self-orthogonal $[n,5]$ code proposed by Kim and Choi (IEEE Trans. Inf. Theory, 2022). The determination of $d_{so}(n,k)$ has been a fundamental and difficult problem in coding theory because there are too many binary self-orthogonal codes as the dimension $k$ increases. Recently, Kim et al. (2021) considered the shortest self-orthogonal embedding of a binary linear code, and many binary optimal self-orthogonal $[n,k]$ codes were constructed for $k=4,5$. Kim and Choi (2022) impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06241","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/2210.06241/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"},"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-07-05T05:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAhNlxZRrobtGtktCPRHIFVaU8Tz1UXaR6sntpTJ+/hRFpG9awH/ChOYv1RqcvbEUFc23ofRNzGDf7P1bKFgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:12:58.323084Z"},"content_sha256":"9056224d7f8aaae9c7b13e70f8bbd4eaffaa25d9248d397897fef7d21faf4536","schema_version":"1.0","event_id":"sha256:9056224d7f8aaae9c7b13e70f8bbd4eaffaa25d9248d397897fef7d21faf4536"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXD7CSUBETCCEGX6QVKHQ37BDX/bundle.json","state_url":"https://pith.science/pith/DXD7CSUBETCCEGX6QVKHQ37BDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXD7CSUBETCCEGX6QVKHQ37BDX/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-07-06T18:12:58Z","links":{"resolver":"https://pith.science/pith/DXD7CSUBETCCEGX6QVKHQ37BDX","bundle":"https://pith.science/pith/DXD7CSUBETCCEGX6QVKHQ37BDX/bundle.json","state":"https://pith.science/pith/DXD7CSUBETCCEGX6QVKHQ37BDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXD7CSUBETCCEGX6QVKHQ37BDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DXD7CSUBETCCEGX6QVKHQ37BDX","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":"a7bc853d9aa6abaf44dcb9a3798643a3ab8d337e4a1b759a8c44ca58a15740ed","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-10-12T14:27:23Z","title_canon_sha256":"b594d9d4f8e97228127ca381c0ca7d6c0ff5db782e5e05e16379ab52b1ac4682"},"schema_version":"1.0","source":{"id":"2210.06241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.06241","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2210.06241v1","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06241","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"DXD7CSUBETCC","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"DXD7CSUBETCCEGX6","created_at":"2026-07-05T05:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"DXD7CSUB","created_at":"2026-07-05T05:05:58Z"}],"graph_snapshots":[{"event_id":"sha256:9056224d7f8aaae9c7b13e70f8bbd4eaffaa25d9248d397897fef7d21faf4536","target":"graph","created_at":"2026-07-05T05:05:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.06241/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The purpose of this paper is to solve the two conjectures on the largest minimum distance $d_{so}(n,5)$ of a binary self-orthogonal $[n,5]$ code proposed by Kim and Choi (IEEE Trans. Inf. Theory, 2022). The determination of $d_{so}(n,k)$ has been a fundamental and difficult problem in coding theory because there are too many binary self-orthogonal codes as the dimension $k$ increases. Recently, Kim et al. (2021) considered the shortest self-orthogonal embedding of a binary linear code, and many binary optimal self-orthogonal $[n,k]$ codes were constructed for $k=4,5$. Kim and Choi (2022) impro","authors_text":"Jon-Lark Kim, Minjia Shi, Shitao Li","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-10-12T14:27:23Z","title":"Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06241","kind":"arxiv","version":1},"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:80c5edb68fb44e8fbc44bcd9237b6ac2eaa7dc43f222979af0ad6ce6d551b561","target":"record","created_at":"2026-07-05T05:05:58Z","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":"a7bc853d9aa6abaf44dcb9a3798643a3ab8d337e4a1b759a8c44ca58a15740ed","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-10-12T14:27:23Z","title_canon_sha256":"b594d9d4f8e97228127ca381c0ca7d6c0ff5db782e5e05e16379ab52b1ac4682"},"schema_version":"1.0","source":{"id":"2210.06241","kind":"arxiv","version":1}},"canonical_sha256":"1dc7f14a8124c4221afe8554786fe11de8d2141d527adbe91dc3f57fe158130b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dc7f14a8124c4221afe8554786fe11de8d2141d527adbe91dc3f57fe158130b","first_computed_at":"2026-07-05T05:05:58.098987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:05:58.098987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O9Sb6SnInowVL440uSHzssmMZpP0HEEUV2kWmusXEBUik1iG3eL2lcQxO9EX05CbhWMFbKY6WR3tI+UafgIoBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:05:58.099410Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.06241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80c5edb68fb44e8fbc44bcd9237b6ac2eaa7dc43f222979af0ad6ce6d551b561","sha256:9056224d7f8aaae9c7b13e70f8bbd4eaffaa25d9248d397897fef7d21faf4536"],"state_sha256":"d09df81c662f60e1ecd913739c13bc18afead541a3a36b4e86f0868c4de27767"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/ltRlFRWWmHq3ZQd16RGCfzlSdXoi4psqsVvYGhL1TfXmdQD6gm70EVLsxW5lQP/qv6xBKN0FGlYfsz7y/qDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:12:58.325084Z","bundle_sha256":"639961e42b80dc756a416273746a57fbf6072efbb47d246aa4fec5b3684ecd62"}}