{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3XN6EIEG4NNWKB5RKNCQMGH3UA","short_pith_number":"pith:3XN6EIEG","schema_version":"1.0","canonical_sha256":"dddbe22086e35b6507b153450618fba025d0479d9679c8142fb7320c539525ab","source":{"kind":"arxiv","id":"1205.5465","version":1},"attestation_state":"computed","paper":{"title":"Isometry and Automorphisms of Constant Dimension 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-24T14:32:42Z","abstract_excerpt":"We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived."},"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.5465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-24T14:32:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"335e40c3986e7a26471983df657e281282712f91e81c7621cf7b5f21ff5004fd","abstract_canon_sha256":"b3001a9d14f9f56613f66b4b36f82e8b54f80571a707d017e0f261faaa3762d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.085946Z","signature_b64":"i+8z38WcWIjPRx1LATOwErWLN1uhv0g0vZv1K3++WvyshAsyNP94kzx2aNjjj0+D5LC9SeEeA/QjwjsP1i8WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dddbe22086e35b6507b153450618fba025d0479d9679c8142fb7320c539525ab","last_reissued_at":"2026-05-18T02:49:30.085481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.085481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isometry and Automorphisms of Constant Dimension 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-24T14:32:42Z","abstract_excerpt":"We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5465","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.5465","created_at":"2026-05-18T02:49:30.085557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5465v1","created_at":"2026-05-18T02:49:30.085557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5465","created_at":"2026-05-18T02:49:30.085557+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XN6EIEG4NNW","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XN6EIEG4NNWKB5R","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XN6EIEG","created_at":"2026-05-18T12:26:53.410803+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/3XN6EIEG4NNWKB5RKNCQMGH3UA","json":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA.json","graph_json":"https://pith.science/api/pith-number/3XN6EIEG4NNWKB5RKNCQMGH3UA/graph.json","events_json":"https://pith.science/api/pith-number/3XN6EIEG4NNWKB5RKNCQMGH3UA/events.json","paper":"https://pith.science/paper/3XN6EIEG"},"agent_actions":{"view_html":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA","download_json":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA.json","view_paper":"https://pith.science/paper/3XN6EIEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5465&json=true","fetch_graph":"https://pith.science/api/pith-number/3XN6EIEG4NNWKB5RKNCQMGH3UA/graph.json","fetch_events":"https://pith.science/api/pith-number/3XN6EIEG4NNWKB5RKNCQMGH3UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA/action/storage_attestation","attest_author":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA/action/author_attestation","sign_citation":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA/action/citation_signature","submit_replication":"https://pith.science/pith/3XN6EIEG4NNWKB5RKNCQMGH3UA/action/replication_record"}},"created_at":"2026-05-18T02:49:30.085557+00:00","updated_at":"2026-05-18T02:49:30.085557+00:00"}