{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CKEHACDEULUS6LBL2UAS2ZTBVI","short_pith_number":"pith:CKEHACDE","schema_version":"1.0","canonical_sha256":"1288700864a2e92f2c2bd5012d6661aa163d9a663b4756c66b317ecd4b3ed573","source":{"kind":"arxiv","id":"1205.1823","version":1},"attestation_state":"computed","paper":{"title":"Pl\\\"ucker Embedding of 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","submitted_at":"2012-05-08T20:52:28Z","abstract_excerpt":"Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\\\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words."},"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":"1205.1823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-08T20:52:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c0dab3a924bea70c17b35f8bea0f3ef9704e1d6e382367b533ad8de9daf38dd4","abstract_canon_sha256":"6f88407d276ff29264c3b32c703d23cc95443e8d35d1b8fd2f88ee41c0a638b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:58.592344Z","signature_b64":"tNjIrNdvf/fAwpXS2jteoUg4+blv6D/7tZbpfGEr+9ICwTXxsVzTe/jFJqlS+Ey22/+RdTr+q/nu8L+APst4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1288700864a2e92f2c2bd5012d6661aa163d9a663b4756c66b317ecd4b3ed573","last_reissued_at":"2026-05-18T03:55:58.591728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:58.591728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pl\\\"ucker Embedding of 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","submitted_at":"2012-05-08T20:52:28Z","abstract_excerpt":"Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Pl\\\"ucker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1823","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":"1205.1823","created_at":"2026-05-18T03:55:58.591827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1823v1","created_at":"2026-05-18T03:55:58.591827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1823","created_at":"2026-05-18T03:55:58.591827+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKEHACDEULUS","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKEHACDEULUS6LBL","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKEHACDE","created_at":"2026-05-18T12:27:01.376967+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/CKEHACDEULUS6LBL2UAS2ZTBVI","json":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI.json","graph_json":"https://pith.science/api/pith-number/CKEHACDEULUS6LBL2UAS2ZTBVI/graph.json","events_json":"https://pith.science/api/pith-number/CKEHACDEULUS6LBL2UAS2ZTBVI/events.json","paper":"https://pith.science/paper/CKEHACDE"},"agent_actions":{"view_html":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI","download_json":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI.json","view_paper":"https://pith.science/paper/CKEHACDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1823&json=true","fetch_graph":"https://pith.science/api/pith-number/CKEHACDEULUS6LBL2UAS2ZTBVI/graph.json","fetch_events":"https://pith.science/api/pith-number/CKEHACDEULUS6LBL2UAS2ZTBVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI/action/storage_attestation","attest_author":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI/action/author_attestation","sign_citation":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI/action/citation_signature","submit_replication":"https://pith.science/pith/CKEHACDEULUS6LBL2UAS2ZTBVI/action/replication_record"}},"created_at":"2026-05-18T03:55:58.591827+00:00","updated_at":"2026-05-18T03:55:58.591827+00:00"}