{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QR56CVOACMXMWHJK7YJY3CIG25","short_pith_number":"pith:QR56CVOA","schema_version":"1.0","canonical_sha256":"847be155c0132ecb1d2afe138d8906d76a16883646b0e6471e549bb0f7fbc58b","source":{"kind":"arxiv","id":"2605.27312","version":1},"attestation_state":"computed","paper":{"title":"On the Automorphism Groups of Berman Codes and associated Abelian Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.IT"],"primary_cat":"cs.IT","authors_text":"Harshvardhan Pandey, Prasad Krishnan","submitted_at":"2026-05-26T17:23:25Z","abstract_excerpt":"The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\\geq 2$ and $m\\geq 1$, and this class includes the Reed-Muller codes as well. The class of Berman codes and their duals were recently shown to achieve the capacity of the binary erasure channel. A number of abelian codes that arise from the intersection and subspace sums of Berman and Dual Berman codes were also identified recently, for odd $n\\geq 3$. A subclass of these abelian codes was shown to have good short bloc"},"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":"2605.27312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-26T17:23:25Z","cross_cats_sorted":["math.GR","math.IT"],"title_canon_sha256":"75385639603317d92299b42702c986e2b12155df994dedd5c28d819c4641ac5d","abstract_canon_sha256":"834cbc5ed9ed82759d59ab30dca16bc177a86deda854f380ceb3cea6f81bfc84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:06:17.622981Z","signature_b64":"cGrPsodIB7FALmes/R5vOJXdRe3GRDkw24P15edaYfJ38MTXlIDFClST7wzzSy/BebVWInqdWpjnD+MeBd0DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847be155c0132ecb1d2afe138d8906d76a16883646b0e6471e549bb0f7fbc58b","last_reissued_at":"2026-05-27T02:06:17.622246Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:06:17.622246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Automorphism Groups of Berman Codes and associated Abelian Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.IT"],"primary_cat":"cs.IT","authors_text":"Harshvardhan Pandey, Prasad Krishnan","submitted_at":"2026-05-26T17:23:25Z","abstract_excerpt":"The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\\geq 2$ and $m\\geq 1$, and this class includes the Reed-Muller codes as well. The class of Berman codes and their duals were recently shown to achieve the capacity of the binary erasure channel. A number of abelian codes that arise from the intersection and subspace sums of Berman and Dual Berman codes were also identified recently, for odd $n\\geq 3$. A subclass of these abelian codes was shown to have good short bloc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27312","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/2605.27312/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":"2605.27312","created_at":"2026-05-27T02:06:17.622366+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27312v1","created_at":"2026-05-27T02:06:17.622366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27312","created_at":"2026-05-27T02:06:17.622366+00:00"},{"alias_kind":"pith_short_12","alias_value":"QR56CVOACMXM","created_at":"2026-05-27T02:06:17.622366+00:00"},{"alias_kind":"pith_short_16","alias_value":"QR56CVOACMXMWHJK","created_at":"2026-05-27T02:06:17.622366+00:00"},{"alias_kind":"pith_short_8","alias_value":"QR56CVOA","created_at":"2026-05-27T02:06:17.622366+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/QR56CVOACMXMWHJK7YJY3CIG25","json":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25.json","graph_json":"https://pith.science/api/pith-number/QR56CVOACMXMWHJK7YJY3CIG25/graph.json","events_json":"https://pith.science/api/pith-number/QR56CVOACMXMWHJK7YJY3CIG25/events.json","paper":"https://pith.science/paper/QR56CVOA"},"agent_actions":{"view_html":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25","download_json":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25.json","view_paper":"https://pith.science/paper/QR56CVOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27312&json=true","fetch_graph":"https://pith.science/api/pith-number/QR56CVOACMXMWHJK7YJY3CIG25/graph.json","fetch_events":"https://pith.science/api/pith-number/QR56CVOACMXMWHJK7YJY3CIG25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/action/storage_attestation","attest_author":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/action/author_attestation","sign_citation":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/action/citation_signature","submit_replication":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/action/replication_record"}},"created_at":"2026-05-27T02:06:17.622366+00:00","updated_at":"2026-05-27T02:06:17.622366+00:00"}