{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:J4LPISDN5D7QWXNLMSMVCN54SA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"82a7a712cd954e2f5a97e8f8639f65f3a5377a4cab78156b9ca5d2d65f307404","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-18T15:30:52Z","title_canon_sha256":"51d673638fd066d59bcb45e539c895d38545d47917922063f94f3aefc88ee91e"},"schema_version":"1.0","source":{"id":"1201.3825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3825","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3825v1","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3825","created_at":"2026-05-18T02:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"J4LPISDN5D7Q","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"J4LPISDN5D7QWXNL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"J4LPISDN","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:b8576505d6db483c4ee2a3df9c64f62396938aa1e04f4d82ab24014ef8455b7a","target":"graph","created_at":"2026-05-18T02:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anna-Lena Trautmann, Joachim Rosenthal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-18T15:30:52Z","title":"A Complete Characterization of Irreducible Cyclic Orbit Codes and their Pl\\\"ucker Embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3825","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ec7f1cfe987bb5ae70ce01cd4c8573269c3d035fd1edd6dd0d4a8a0f86d40458","target":"record","created_at":"2026-05-18T02:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"82a7a712cd954e2f5a97e8f8639f65f3a5377a4cab78156b9ca5d2d65f307404","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-18T15:30:52Z","title_canon_sha256":"51d673638fd066d59bcb45e539c895d38545d47917922063f94f3aefc88ee91e"},"schema_version":"1.0","source":{"id":"1201.3825","kind":"arxiv","version":1}},"canonical_sha256":"4f16f4486de8ff0b5dab64995137bc903049ebb8708cd851e67a3b5cc030b585","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f16f4486de8ff0b5dab64995137bc903049ebb8708cd851e67a3b5cc030b585","first_computed_at":"2026-05-18T02:49:30.133375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:30.133375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rIqCarQt0oQeqkI/xTFBt2XtXmJCMGfeLeUL/gQaqqiCdJNWu3cxiLVBCxjZRK0jpNwb00snENaSHcNvQ9smCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:30.133836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec7f1cfe987bb5ae70ce01cd4c8573269c3d035fd1edd6dd0d4a8a0f86d40458","sha256:b8576505d6db483c4ee2a3df9c64f62396938aa1e04f4d82ab24014ef8455b7a"],"state_sha256":"1178132127d4917f5dd0f667fa9e1a43849bda3f4c74d90acbfa31f4db98cfc7"}