{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UQZPYLHE7TFGOHE6NGRFOUH72R","short_pith_number":"pith:UQZPYLHE","schema_version":"1.0","canonical_sha256":"a432fc2ce4fcca671c9e69a25750ffd4646b6f4a5ea22034757ba2d151a7bc72","source":{"kind":"arxiv","id":"2101.09679","version":3},"attestation_state":"computed","paper":{"title":"On the Automorphism Group of Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Elkelesh, Marvin Geiselhart, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2021-01-24T09:47:29Z","abstract_excerpt":"The automorphism group of a code is the set of permutations of the codeword symbols that map the whole code onto itself. For polar codes, only a part of the automorphism group was known, namely the lower-triangular affine group (LTA), which is solely based upon the partial order of the code's synthetic channels. Depending on the design, however, polar codes can have a richer set of automorphisms. In this paper, we extend the LTA to a larger subgroup of the general affine group (GA), namely the block lower-triangular affine group (BLTA) and show that it is contained in the automorphism group of"},"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":"2101.09679","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-01-24T09:47:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4da989ce3ca0ce6e275f00bb2f5e78963a749d44b360f336167d92150663703a","abstract_canon_sha256":"93acac63b55f86e8b1a4ba42683480a3956727ecc6d296d2b1f02c48fcc29b89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:12.731710Z","signature_b64":"O5rBHIVsvP1EPsXx4RCGtKyUGgP7nNH+lmPbavgrUGz8FybWPHaWh/0iDBDVZ7/BaccVljz6xgbFS7njVjGzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a432fc2ce4fcca671c9e69a25750ffd4646b6f4a5ea22034757ba2d151a7bc72","last_reissued_at":"2026-07-05T02:39:12.731209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:12.731209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Automorphism Group of Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Elkelesh, Marvin Geiselhart, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2021-01-24T09:47:29Z","abstract_excerpt":"The automorphism group of a code is the set of permutations of the codeword symbols that map the whole code onto itself. For polar codes, only a part of the automorphism group was known, namely the lower-triangular affine group (LTA), which is solely based upon the partial order of the code's synthetic channels. Depending on the design, however, polar codes can have a richer set of automorphisms. In this paper, we extend the LTA to a larger subgroup of the general affine group (GA), namely the block lower-triangular affine group (BLTA) and show that it is contained in the automorphism group of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09679","kind":"arxiv","version":3},"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/2101.09679/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":"2101.09679","created_at":"2026-07-05T02:39:12.731270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09679v3","created_at":"2026-07-05T02:39:12.731270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09679","created_at":"2026-07-05T02:39:12.731270+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQZPYLHE7TFG","created_at":"2026-07-05T02:39:12.731270+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQZPYLHE7TFGOHE6","created_at":"2026-07-05T02:39:12.731270+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQZPYLHE","created_at":"2026-07-05T02:39:12.731270+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22142","citing_title":"Interpolation of Quantum Polar Codes and Quantum Reed-Muller Codes","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R","json":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R.json","graph_json":"https://pith.science/api/pith-number/UQZPYLHE7TFGOHE6NGRFOUH72R/graph.json","events_json":"https://pith.science/api/pith-number/UQZPYLHE7TFGOHE6NGRFOUH72R/events.json","paper":"https://pith.science/paper/UQZPYLHE"},"agent_actions":{"view_html":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R","download_json":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R.json","view_paper":"https://pith.science/paper/UQZPYLHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09679&json=true","fetch_graph":"https://pith.science/api/pith-number/UQZPYLHE7TFGOHE6NGRFOUH72R/graph.json","fetch_events":"https://pith.science/api/pith-number/UQZPYLHE7TFGOHE6NGRFOUH72R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R/action/storage_attestation","attest_author":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R/action/author_attestation","sign_citation":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R/action/citation_signature","submit_replication":"https://pith.science/pith/UQZPYLHE7TFGOHE6NGRFOUH72R/action/replication_record"}},"created_at":"2026-07-05T02:39:12.731270+00:00","updated_at":"2026-07-05T02:39:12.731270+00:00"}