{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BVC3S7KNA2FMQ6234TLD73FECU","short_pith_number":"pith:BVC3S7KN","schema_version":"1.0","canonical_sha256":"0d45b97d4d068ac87b5be4d63feca41531e1494755937967486bf052ba276c90","source":{"kind":"arxiv","id":"1302.3747","version":2},"attestation_state":"computed","paper":{"title":"Construction of minimal non-abelian left group codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.GR","math.IT","math.RA"],"primary_cat":"math.RT","authors_text":"Gabriela Olteanu, Inneke Van Gelder","submitted_at":"2013-02-15T13:03:36Z","abstract_excerpt":"Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G.\n  As an illustration of our methods, alternative constructions to some best linear codes over F_2 and F_3 are given."},"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":"1302.3747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2013-02-15T13:03:36Z","cross_cats_sorted":["cs.IT","math.GR","math.IT","math.RA"],"title_canon_sha256":"db93ebf15e385e3a99206fdf8dbfb929025a77184a9d676052b390a110310114","abstract_canon_sha256":"7e486625443d56a3368267c90375766f30d9e8d5ebc7e819d26ee8d2c5c4d65b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:57.364620Z","signature_b64":"qTswxuSLG7yWyormgFzQh5wjCicLscT9O53oybk9u2fDRjsBjZhmCmoiUbHi5ew0/rDySTFK/0c+ebwIc8ziBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d45b97d4d068ac87b5be4d63feca41531e1494755937967486bf052ba276c90","last_reissued_at":"2026-05-18T03:02:57.363901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:57.363901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of minimal non-abelian left group codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.GR","math.IT","math.RA"],"primary_cat":"math.RT","authors_text":"Gabriela Olteanu, Inneke Van Gelder","submitted_at":"2013-02-15T13:03:36Z","abstract_excerpt":"Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G.\n  As an illustration of our methods, alternative constructions to some best linear codes over F_2 and F_3 are given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3747","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1302.3747","created_at":"2026-05-18T03:02:57.364015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3747v2","created_at":"2026-05-18T03:02:57.364015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3747","created_at":"2026-05-18T03:02:57.364015+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVC3S7KNA2FM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVC3S7KNA2FMQ623","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVC3S7KN","created_at":"2026-05-18T12:27:40.988391+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/BVC3S7KNA2FMQ6234TLD73FECU","json":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU.json","graph_json":"https://pith.science/api/pith-number/BVC3S7KNA2FMQ6234TLD73FECU/graph.json","events_json":"https://pith.science/api/pith-number/BVC3S7KNA2FMQ6234TLD73FECU/events.json","paper":"https://pith.science/paper/BVC3S7KN"},"agent_actions":{"view_html":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU","download_json":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU.json","view_paper":"https://pith.science/paper/BVC3S7KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3747&json=true","fetch_graph":"https://pith.science/api/pith-number/BVC3S7KNA2FMQ6234TLD73FECU/graph.json","fetch_events":"https://pith.science/api/pith-number/BVC3S7KNA2FMQ6234TLD73FECU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU/action/storage_attestation","attest_author":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU/action/author_attestation","sign_citation":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU/action/citation_signature","submit_replication":"https://pith.science/pith/BVC3S7KNA2FMQ6234TLD73FECU/action/replication_record"}},"created_at":"2026-05-18T03:02:57.364015+00:00","updated_at":"2026-05-18T03:02:57.364015+00:00"}