{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LRTQTURV6TWUJZTHPKUROGOC2Z","short_pith_number":"pith:LRTQTURV","schema_version":"1.0","canonical_sha256":"5c6709d235f4ed44e6677aa91719c2d6636ac130f2a0e5b6929d9b7453f91a86","source":{"kind":"arxiv","id":"2605.13007","version":1},"attestation_state":"computed","paper":{"title":"Classification of ternary maximal self-orthogonal codes of length 25","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Ternary maximal self-orthogonal codes of length 25 have been completely classified.","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Makoto Araya, Masaaki Harada","submitted_at":"2026-05-13T05:01:19Z","abstract_excerpt":"Ternary maximal self-orthogonal codes have been classified for lengths up to $24$. In this note, we provide a complete classification of ternary maximal self-orthogonal codes of length $25$."},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T05:01:19Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"f8eddc50a285be56fadbab739aff4d1518563445f649cc0abca4e992e0846ebe","abstract_canon_sha256":"1a05a826a155fed77053fd2086c68c526dce20ae7f2503807b31c0556441a2ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:00.306472Z","signature_b64":"EgvVc4xdLErBZ06+HYqCy76dTlnchifK3G/5WewkpO1zgLMCLVriuDSbQBPJoyUFpJYC42NqcsZibAhgD7l9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c6709d235f4ed44e6677aa91719c2d6636ac130f2a0e5b6929d9b7453f91a86","last_reissued_at":"2026-05-18T03:09:00.305595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:00.305595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of ternary maximal self-orthogonal codes of length 25","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Ternary maximal self-orthogonal codes of length 25 have been completely classified.","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Makoto Araya, Masaaki Harada","submitted_at":"2026-05-13T05:01:19Z","abstract_excerpt":"Ternary maximal self-orthogonal codes have been classified for lengths up to $24$. In this note, we provide a complete classification of ternary maximal self-orthogonal codes of length $25$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we provide a complete classification of ternary maximal self-orthogonal codes of length 25","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The computer enumeration is exhaustive and finds every inequivalent code without omissions or duplicates.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A complete classification of ternary maximal self-orthogonal codes of length 25 is given.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Ternary maximal self-orthogonal codes of length 25 have been completely classified.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"479c3f901dde89597973dd15cd292ed91954a9d771121fd766265536974bf20f"},"source":{"id":"2605.13007","kind":"arxiv","version":1},"verdict":{"id":"0569a20d-d29b-4782-b5b5-aeba8324b63d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:33:21.335370Z","strongest_claim":"we provide a complete classification of ternary maximal self-orthogonal codes of length 25","one_line_summary":"A complete classification of ternary maximal self-orthogonal codes of length 25 is given.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The computer enumeration is exhaustive and finds every inequivalent code without omissions or duplicates.","pith_extraction_headline":"Ternary maximal self-orthogonal codes of length 25 have been completely classified."},"references":{"count":14,"sample":[{"doi":"","year":2018,"title":"M. Araya M. Harada and Y. Suzuki, Ternary maximal self-orthogonal codes of lengths 21,22 and 23,J. Algebra Comb. Discrete Struct. Appl. 5(2018), 1–4","work_id":"faacabfe-2154-44ff-8f9e-1bc921957d08","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"W. Bosma, J. Cannon and C. Playoust, The Magma algebra system I: The user language,J. Symbolic Comput.24(1997), 235–265","work_id":"d5d967d7-1dae-4d6d-a5de-f004f3123a21","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Bounds on the size of linear codes,","work_id":"dc53e789-92d2-4e6d-9a9e-2ffe595f3646","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1980,"title":"J.H. Conway and V. Pless, On the enumeration of self-dual codes,J. Combin. Theory Ser. A28(1980), 26–53","work_id":"780759df-7a8b-4c83-840a-5223ca5c25fd","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"J.H. Conway, V. Pless and N.J.A. Sloane, Self-dual codes over GF(3) and GF(4) of length not exceeding 16,IEEE Trans. Inform. Theory25 (1979), 312–322","work_id":"dc25cd2b-8894-481c-b619-b08a14974ba2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"eaf6c6fc3127bcdcd386e71c9e03193d8312d50559f3cfa4a281d0ef1f641215","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":"2605.13007","created_at":"2026-05-18T03:09:00.305726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13007v1","created_at":"2026-05-18T03:09:00.305726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13007","created_at":"2026-05-18T03:09:00.305726+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRTQTURV6TWU","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRTQTURV6TWUJZTH","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRTQTURV","created_at":"2026-05-18T12:33:37.589309+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/LRTQTURV6TWUJZTHPKUROGOC2Z","json":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z.json","graph_json":"https://pith.science/api/pith-number/LRTQTURV6TWUJZTHPKUROGOC2Z/graph.json","events_json":"https://pith.science/api/pith-number/LRTQTURV6TWUJZTHPKUROGOC2Z/events.json","paper":"https://pith.science/paper/LRTQTURV"},"agent_actions":{"view_html":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z","download_json":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z.json","view_paper":"https://pith.science/paper/LRTQTURV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13007&json=true","fetch_graph":"https://pith.science/api/pith-number/LRTQTURV6TWUJZTHPKUROGOC2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/LRTQTURV6TWUJZTHPKUROGOC2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z/action/storage_attestation","attest_author":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z/action/author_attestation","sign_citation":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z/action/citation_signature","submit_replication":"https://pith.science/pith/LRTQTURV6TWUJZTHPKUROGOC2Z/action/replication_record"}},"created_at":"2026-05-18T03:09:00.305726+00:00","updated_at":"2026-05-18T03:09:00.305726+00:00"}