{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7LWZKSPMYF42SP6K3TBT7RBBVL","short_pith_number":"pith:7LWZKSPM","schema_version":"1.0","canonical_sha256":"faed9549ecc179a93fcadcc33fc421aad9cfc46b188c70ce2800cf2a6bc4ac16","source":{"kind":"arxiv","id":"1102.3167","version":4},"attestation_state":"computed","paper":{"title":"A Complete Characterization of Irreducible Cyclic Orbit Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Joachim Rosenthal","submitted_at":"2011-02-15T20:06:43Z","abstract_excerpt":"We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum distance."},"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":"1102.3167","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:06:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3473747abe70629b79eb1ec21685a40615a2d854847790f92aef18c2e8ca8337","abstract_canon_sha256":"be04cd31c901fdc14916352ab2d42f9db5bcf37c3a237b80e7a2e65c7316cb29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:31.633432Z","signature_b64":"mwN9GL7l2Sb3rVkQZwzM37A0MuaVXbXpyCn1fy7VtMTag2L7wY1fwYl/V+tKnVEDjDH1gE7eaIIqAjyxlHqYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faed9549ecc179a93fcadcc33fc421aad9cfc46b188c70ce2800cf2a6bc4ac16","last_reissued_at":"2026-05-18T02:22:31.632959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:31.632959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complete Characterization of Irreducible Cyclic Orbit Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anna-Lena Trautmann, Joachim Rosenthal","submitted_at":"2011-02-15T20:06:43Z","abstract_excerpt":"We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum distance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3167","kind":"arxiv","version":4},"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":"1102.3167","created_at":"2026-05-18T02:22:31.633030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.3167v4","created_at":"2026-05-18T02:22:31.633030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3167","created_at":"2026-05-18T02:22:31.633030+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LWZKSPMYF42","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LWZKSPMYF42SP6K","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LWZKSPM","created_at":"2026-05-18T12:26:22.705136+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/7LWZKSPMYF42SP6K3TBT7RBBVL","json":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL.json","graph_json":"https://pith.science/api/pith-number/7LWZKSPMYF42SP6K3TBT7RBBVL/graph.json","events_json":"https://pith.science/api/pith-number/7LWZKSPMYF42SP6K3TBT7RBBVL/events.json","paper":"https://pith.science/paper/7LWZKSPM"},"agent_actions":{"view_html":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL","download_json":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL.json","view_paper":"https://pith.science/paper/7LWZKSPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.3167&json=true","fetch_graph":"https://pith.science/api/pith-number/7LWZKSPMYF42SP6K3TBT7RBBVL/graph.json","fetch_events":"https://pith.science/api/pith-number/7LWZKSPMYF42SP6K3TBT7RBBVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL/action/storage_attestation","attest_author":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL/action/author_attestation","sign_citation":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL/action/citation_signature","submit_replication":"https://pith.science/pith/7LWZKSPMYF42SP6K3TBT7RBBVL/action/replication_record"}},"created_at":"2026-05-18T02:22:31.633030+00:00","updated_at":"2026-05-18T02:22:31.633030+00:00"}