{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LRTQTURV6TWUJZTHPKUROGOC2Z","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":"1a05a826a155fed77053fd2086c68c526dce20ae7f2503807b31c0556441a2ee","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T05:01:19Z","title_canon_sha256":"f8eddc50a285be56fadbab739aff4d1518563445f649cc0abca4e992e0846ebe"},"schema_version":"1.0","source":{"id":"2605.13007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13007","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13007v1","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13007","created_at":"2026-05-18T03:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"LRTQTURV6TWU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LRTQTURV6TWUJZTH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LRTQTURV","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:aa775656c43523f709857d2a7dfeb31d7e9292548dbd07ebf09159041c8f6a30","target":"graph","created_at":"2026-05-18T03:09:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we provide a complete classification of ternary maximal self-orthogonal codes of length 25"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The computer enumeration is exhaustive and finds every inequivalent code without omissions or duplicates."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A complete classification of ternary maximal self-orthogonal codes of length 25 is given."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Ternary maximal self-orthogonal codes of length 25 have been completely classified."}],"snapshot_sha256":"479c3f901dde89597973dd15cd292ed91954a9d771121fd766265536974bf20f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$.","authors_text":"Makoto Araya, Masaaki Harada","cross_cats":["math.CO","math.IT"],"headline":"Ternary maximal self-orthogonal codes of length 25 have been completely classified.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T05:01:19Z","title":"Classification of ternary maximal self-orthogonal codes of length 25"},"references":{"count":14,"internal_anchors":0,"resolved_work":14,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"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","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"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","year":1997},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Bounds on the size of linear codes,","work_id":"dc53e789-92d2-4e6d-9a9e-2ffe595f3646","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"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","year":1980},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"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","year":1979}],"snapshot_sha256":"eaf6c6fc3127bcdcd386e71c9e03193d8312d50559f3cfa4a281d0ef1f641215"},"source":{"id":"2605.13007","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:33:21.335370Z","id":"0569a20d-d29b-4782-b5b5-aeba8324b63d","model_set":{"reader":"grok-4.3"},"one_line_summary":"A complete classification of ternary maximal self-orthogonal codes of length 25 is given.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Ternary maximal self-orthogonal codes of length 25 have been completely classified.","strongest_claim":"we provide a complete classification of ternary maximal self-orthogonal codes of length 25","weakest_assumption":"The computer enumeration is exhaustive and finds every inequivalent code without omissions or duplicates."}},"verdict_id":"0569a20d-d29b-4782-b5b5-aeba8324b63d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d4037dceaa4ac65398db8397d1e8241008d8eb3f13af49709e792b570cf549b9","target":"record","created_at":"2026-05-18T03:09:00Z","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":"1a05a826a155fed77053fd2086c68c526dce20ae7f2503807b31c0556441a2ee","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T05:01:19Z","title_canon_sha256":"f8eddc50a285be56fadbab739aff4d1518563445f649cc0abca4e992e0846ebe"},"schema_version":"1.0","source":{"id":"2605.13007","kind":"arxiv","version":1}},"canonical_sha256":"5c6709d235f4ed44e6677aa91719c2d6636ac130f2a0e5b6929d9b7453f91a86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c6709d235f4ed44e6677aa91719c2d6636ac130f2a0e5b6929d9b7453f91a86","first_computed_at":"2026-05-18T03:09:00.305595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:00.305595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgvVc4xdLErBZ06+HYqCy76dTlnchifK3G/5WewkpO1zgLMCLVriuDSbQBPJoyUFpJYC42NqcsZibAhgD7l9Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:00.306472Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4037dceaa4ac65398db8397d1e8241008d8eb3f13af49709e792b570cf549b9","sha256:aa775656c43523f709857d2a7dfeb31d7e9292548dbd07ebf09159041c8f6a30"],"state_sha256":"ef602de34b07208c9bbe748876148ce0bd208d90fe2d0fd47a1537a9b99e4597"}