{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ULNTMQAEVXHJUPT76QZX3MLP2Q","short_pith_number":"pith:ULNTMQAE","schema_version":"1.0","canonical_sha256":"a2db364004adce9a3e7ff4337db16fd424cc03a044dc4ef64137a41897297217","source":{"kind":"arxiv","id":"2010.12429","version":1},"attestation_state":"computed","paper":{"title":"Relative projective group codes over chain rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Sihuang Hu, Simon Eisenbarth","submitted_at":"2020-10-23T14:21:43Z","abstract_excerpt":"A structure theorem of the group codes which are relative projective for the subgroup $\\lbrace 1 \\rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to the chains of projective group codes of length $\\ell$ in the group algebra $\\mathbb{F}G$, where $\\mathbb{F}$ is the residue field of $R$. We use a given chain to construct the dual code in $RG$ and also derive the minimum Hamming weight as well as a lower bound of the minimum euclidean weight."},"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":"2010.12429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-23T14:21:43Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"4198a91abaacf2143cb60c4c4a32dcdc7646f5524811b16e7769f449121d1426","abstract_canon_sha256":"76d57a8c372d775a2cbd30a5b804bc12c205694de6378d5f60c5b92d2614e463"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:37.189463Z","signature_b64":"sFwwXv8EoX2ChsEllRM8j5boA7u7Q63KmkfWNcnxdJ/dxo5kvJ+chsBHQshbDdK34VNg+/x4jUfvC3g3TNvHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2db364004adce9a3e7ff4337db16fd424cc03a044dc4ef64137a41897297217","last_reissued_at":"2026-07-05T01:45:37.188979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:37.188979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relative projective group codes over chain rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Sihuang Hu, Simon Eisenbarth","submitted_at":"2020-10-23T14:21:43Z","abstract_excerpt":"A structure theorem of the group codes which are relative projective for the subgroup $\\lbrace 1 \\rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to the chains of projective group codes of length $\\ell$ in the group algebra $\\mathbb{F}G$, where $\\mathbb{F}$ is the residue field of $R$. We use a given chain to construct the dual code in $RG$ and also derive the minimum Hamming weight as well as a lower bound of the minimum euclidean weight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12429","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/2010.12429/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":"2010.12429","created_at":"2026-07-05T01:45:37.189052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.12429v1","created_at":"2026-07-05T01:45:37.189052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12429","created_at":"2026-07-05T01:45:37.189052+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULNTMQAEVXHJ","created_at":"2026-07-05T01:45:37.189052+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULNTMQAEVXHJUPT7","created_at":"2026-07-05T01:45:37.189052+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULNTMQAE","created_at":"2026-07-05T01:45:37.189052+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/ULNTMQAEVXHJUPT76QZX3MLP2Q","json":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q.json","graph_json":"https://pith.science/api/pith-number/ULNTMQAEVXHJUPT76QZX3MLP2Q/graph.json","events_json":"https://pith.science/api/pith-number/ULNTMQAEVXHJUPT76QZX3MLP2Q/events.json","paper":"https://pith.science/paper/ULNTMQAE"},"agent_actions":{"view_html":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q","download_json":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q.json","view_paper":"https://pith.science/paper/ULNTMQAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.12429&json=true","fetch_graph":"https://pith.science/api/pith-number/ULNTMQAEVXHJUPT76QZX3MLP2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ULNTMQAEVXHJUPT76QZX3MLP2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q/action/storage_attestation","attest_author":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q/action/author_attestation","sign_citation":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q/action/citation_signature","submit_replication":"https://pith.science/pith/ULNTMQAEVXHJUPT76QZX3MLP2Q/action/replication_record"}},"created_at":"2026-07-05T01:45:37.189052+00:00","updated_at":"2026-07-05T01:45:37.189052+00:00"}