{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:J4LPISDN5D7QWXNLMSMVCN54SA","short_pith_number":"pith:J4LPISDN","schema_version":"1.0","canonical_sha256":"4f16f4486de8ff0b5dab64995137bc903049ebb8708cd851e67a3b5cc030b585","source":{"kind":"arxiv","id":"1201.3825","version":1},"attestation_state":"computed","paper":{"title":"A Complete Characterization of Irreducible Cyclic Orbit Codes and their Pl\\\"ucker Embedding","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":"2012-01-18T15:30:52Z","abstract_excerpt":"Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as orbits of a subgroup of the general linear group on the Grassmannian. This paper gives a complete characterization of orbit codes that are generated by an irreducible cyclic group, i.e. a group having one generator that has no non-trivial invariant subspace. We show how some of the basic properties of these codes, the cardinality and the minimum distance, can be"},"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":"1201.3825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-18T15:30:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51d673638fd066d59bcb45e539c895d38545d47917922063f94f3aefc88ee91e","abstract_canon_sha256":"82a7a712cd954e2f5a97e8f8639f65f3a5377a4cab78156b9ca5d2d65f307404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.133836Z","signature_b64":"rIqCarQt0oQeqkI/xTFBt2XtXmJCMGfeLeUL/gQaqqiCdJNWu3cxiLVBCxjZRK0jpNwb00snENaSHcNvQ9smCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f16f4486de8ff0b5dab64995137bc903049ebb8708cd851e67a3b5cc030b585","last_reissued_at":"2026-05-18T02:49:30.133375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.133375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complete Characterization of Irreducible Cyclic Orbit Codes and their Pl\\\"ucker Embedding","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":"2012-01-18T15:30:52Z","abstract_excerpt":"Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as orbits of a subgroup of the general linear group on the Grassmannian. This paper gives a complete characterization of orbit codes that are generated by an irreducible cyclic group, i.e. a group having one generator that has no non-trivial invariant subspace. We show how some of the basic properties of these codes, the cardinality and the minimum distance, can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3825","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":""},"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":"1201.3825","created_at":"2026-05-18T02:49:30.133461+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3825v1","created_at":"2026-05-18T02:49:30.133461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3825","created_at":"2026-05-18T02:49:30.133461+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4LPISDN5D7Q","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4LPISDN5D7QWXNL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4LPISDN","created_at":"2026-05-18T12:27:09.501522+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/J4LPISDN5D7QWXNLMSMVCN54SA","json":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA.json","graph_json":"https://pith.science/api/pith-number/J4LPISDN5D7QWXNLMSMVCN54SA/graph.json","events_json":"https://pith.science/api/pith-number/J4LPISDN5D7QWXNLMSMVCN54SA/events.json","paper":"https://pith.science/paper/J4LPISDN"},"agent_actions":{"view_html":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA","download_json":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA.json","view_paper":"https://pith.science/paper/J4LPISDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3825&json=true","fetch_graph":"https://pith.science/api/pith-number/J4LPISDN5D7QWXNLMSMVCN54SA/graph.json","fetch_events":"https://pith.science/api/pith-number/J4LPISDN5D7QWXNLMSMVCN54SA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA/action/storage_attestation","attest_author":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA/action/author_attestation","sign_citation":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA/action/citation_signature","submit_replication":"https://pith.science/pith/J4LPISDN5D7QWXNLMSMVCN54SA/action/replication_record"}},"created_at":"2026-05-18T02:49:30.133461+00:00","updated_at":"2026-05-18T02:49:30.133461+00:00"}