{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QR56CVOACMXMWHJK7YJY3CIG25","short_pith_number":"pith:QR56CVOA","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"},"canonical_sha256":"847be155c0132ecb1d2afe138d8906d76a16883646b0e6471e549bb0f7fbc58b","source":{"kind":"arxiv","id":"2605.27312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27312","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27312v1","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27312","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"QR56CVOACMXM","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"QR56CVOACMXMWHJK","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"QR56CVOA","created_at":"2026-05-27T02:06:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QR56CVOACMXMWHJK7YJY3CIG25","target":"record","payload":{"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"},"canonical_sha256":"847be155c0132ecb1d2afe138d8906d76a16883646b0e6471e549bb0f7fbc58b","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"},"source_kind":"arxiv","source_id":"2605.27312","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-05-27T02:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3wN8QWNrcJ8kXD6gtFk3JqjlS9AqNZC/581fs3k74PBcOsF6Fy7L7NJFbBCAIxTwGDfshdDw/TfWpm9ToAGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:43:38.241976Z"},"content_sha256":"e6fe4b33c6294a8de0b4584e6b1b9c957746689f6e54fd362becae3b730ff22e","schema_version":"1.0","event_id":"sha256:e6fe4b33c6294a8de0b4584e6b1b9c957746689f6e54fd362becae3b730ff22e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QR56CVOACMXMWHJK7YJY3CIG25","target":"graph","payload":{"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"},"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-05-27T02:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MXkLQXZ0kzC+RHquARxKlU31w5a2rv9ZoYZ04SIiGU+1pZDeyPtgTpkqRSt+GbMcedZ/C85r1oQ907qTPqZ8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:43:38.242358Z"},"content_sha256":"f97fa2f5c56fe46d7820f2f85f7490f7bb852aa54500a26f54bcf1edb0440986","schema_version":"1.0","event_id":"sha256:f97fa2f5c56fe46d7820f2f85f7490f7bb852aa54500a26f54bcf1edb0440986"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/bundle.json","state_url":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QR56CVOACMXMWHJK7YJY3CIG25/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-06-23T17:43:38Z","links":{"resolver":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25","bundle":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/bundle.json","state":"https://pith.science/pith/QR56CVOACMXMWHJK7YJY3CIG25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QR56CVOACMXMWHJK7YJY3CIG25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QR56CVOACMXMWHJK7YJY3CIG25","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":"834cbc5ed9ed82759d59ab30dca16bc177a86deda854f380ceb3cea6f81bfc84","cross_cats_sorted":["math.GR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-26T17:23:25Z","title_canon_sha256":"75385639603317d92299b42702c986e2b12155df994dedd5c28d819c4641ac5d"},"schema_version":"1.0","source":{"id":"2605.27312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27312","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27312v1","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27312","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"QR56CVOACMXM","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"QR56CVOACMXMWHJK","created_at":"2026-05-27T02:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"QR56CVOA","created_at":"2026-05-27T02:06:17Z"}],"graph_snapshots":[{"event_id":"sha256:f97fa2f5c56fe46d7820f2f85f7490f7bb852aa54500a26f54bcf1edb0440986","target":"graph","created_at":"2026-05-27T02:06:17Z","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/2605.27312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Harshvardhan Pandey, Prasad Krishnan","cross_cats":["math.GR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-26T17:23:25Z","title":"On the Automorphism Groups of Berman Codes and associated Abelian Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27312","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:e6fe4b33c6294a8de0b4584e6b1b9c957746689f6e54fd362becae3b730ff22e","target":"record","created_at":"2026-05-27T02:06:17Z","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":"834cbc5ed9ed82759d59ab30dca16bc177a86deda854f380ceb3cea6f81bfc84","cross_cats_sorted":["math.GR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-26T17:23:25Z","title_canon_sha256":"75385639603317d92299b42702c986e2b12155df994dedd5c28d819c4641ac5d"},"schema_version":"1.0","source":{"id":"2605.27312","kind":"arxiv","version":1}},"canonical_sha256":"847be155c0132ecb1d2afe138d8906d76a16883646b0e6471e549bb0f7fbc58b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"847be155c0132ecb1d2afe138d8906d76a16883646b0e6471e549bb0f7fbc58b","first_computed_at":"2026-05-27T02:06:17.622246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T02:06:17.622246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cGrPsodIB7FALmes/R5vOJXdRe3GRDkw24P15edaYfJ38MTXlIDFClST7wzzSy/BebVWInqdWpjnD+MeBd0DDA==","signature_status":"signed_v1","signed_at":"2026-05-27T02:06:17.622981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6fe4b33c6294a8de0b4584e6b1b9c957746689f6e54fd362becae3b730ff22e","sha256:f97fa2f5c56fe46d7820f2f85f7490f7bb852aa54500a26f54bcf1edb0440986"],"state_sha256":"3db11b7beb6bd334ff6a59927cfb706dde25358473749b7994b20a6872c8d17a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JL71c/puJl5qK/HCZnXeW3aFam8QgunpvKJgTYeXnHHaRa6Wz3ywowHZzlkMgEyt4Wuu7crpfXe5srFRsWSgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:43:38.244407Z","bundle_sha256":"2fb907531ea47f8c777fd45ee22a916e4400e532893de18a439602defebef748"}}