{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6AONANURF2W55WAQFICLEIWERN","short_pith_number":"pith:6AONANUR","canonical_record":{"source":{"id":"1505.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-27T15:06:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27097e3069559025e0857c80621cd6b7ed1c8e795debdb9dc676cf116a596b8f","abstract_canon_sha256":"25995204d7909f35ccf3767191e56dd981bc34505d975b61a87dae81844f65b2"},"schema_version":"1.0"},"canonical_sha256":"f01cd036912eadded8102a04b222c48b76468d03dd247249fa8bf70d3fb73f84","source":{"kind":"arxiv","id":"1505.07363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07363","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07363v2","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07363","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"6AONANURF2W5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6AONANURF2W55WAQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6AONANUR","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6AONANURF2W55WAQFICLEIWERN","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-27T15:06:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27097e3069559025e0857c80621cd6b7ed1c8e795debdb9dc676cf116a596b8f","abstract_canon_sha256":"25995204d7909f35ccf3767191e56dd981bc34505d975b61a87dae81844f65b2"},"schema_version":"1.0"},"canonical_sha256":"f01cd036912eadded8102a04b222c48b76468d03dd247249fa8bf70d3fb73f84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:37.983717Z","signature_b64":"4nCRb2fYJtaICZ21wExC3+TRB1y4Zp7fDAdxHnc8+I2vB9Q3762RqfcMbgkxgBfEKFGibk4CW/r/41SQlQ77BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01cd036912eadded8102a04b222c48b76468d03dd247249fa8bf70d3fb73f84","last_reissued_at":"2026-05-18T01:36:37.982813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:37.982813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07363","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DyAAs1/miRG2XUxU641uyHKZPT0PVKVuXgpLvY1HZkgaYAT0mPGMyc3yOVbd5d4itRihCUDiCZeToKoSwpLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:15:04.425701Z"},"content_sha256":"af1af00c95cd57a444019a6e44bf2811973c42a9ae843cf2ba02cc075f610f11","schema_version":"1.0","event_id":"sha256:af1af00c95cd57a444019a6e44bf2811973c42a9ae843cf2ba02cc075f610f11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6AONANURF2W55WAQFICLEIWERN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Enumeration of the Equivalence Classes of Self-Dual Matrix Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Katherine Morrison","submitted_at":"2015-05-27T15:06:37Z","abstract_excerpt":"As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes, space-time codes over finite fields, and array codes. We focus on characterizing matrix codes that are both efficient (have high rate) and effective at error correction (have high minimum rank-distance). It is well known that the inherent trade-off between dimension and minimum distance for a matrix code is reversed for its dual code; specifically, if a matrix code h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07363","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvtqR0jnNf9+yUmjFdeh6cpP9ry/f4kTr6n5qBRl0aOiUz+LIzU2d549fqEU+qPzyIClqCl5MBr4set1PF6vBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:15:04.426490Z"},"content_sha256":"b10ce0619ad2607d3fe8adb7b7d1b0a2fe7e0cf4baa8d38cbaba9f6f5eea7065","schema_version":"1.0","event_id":"sha256:b10ce0619ad2607d3fe8adb7b7d1b0a2fe7e0cf4baa8d38cbaba9f6f5eea7065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/bundle.json","state_url":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AONANURF2W55WAQFICLEIWERN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T01:15:04Z","links":{"resolver":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN","bundle":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/bundle.json","state":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AONANURF2W55WAQFICLEIWERN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6AONANURF2W55WAQFICLEIWERN","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":"25995204d7909f35ccf3767191e56dd981bc34505d975b61a87dae81844f65b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-27T15:06:37Z","title_canon_sha256":"27097e3069559025e0857c80621cd6b7ed1c8e795debdb9dc676cf116a596b8f"},"schema_version":"1.0","source":{"id":"1505.07363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07363","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07363v2","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07363","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"6AONANURF2W5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6AONANURF2W55WAQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6AONANUR","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:b10ce0619ad2607d3fe8adb7b7d1b0a2fe7e0cf4baa8d38cbaba9f6f5eea7065","target":"graph","created_at":"2026-05-18T01:36:37Z","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":"As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes, space-time codes over finite fields, and array codes. We focus on characterizing matrix codes that are both efficient (have high rate) and effective at error correction (have high minimum rank-distance). It is well known that the inherent trade-off between dimension and minimum distance for a matrix code is reversed for its dual code; specifically, if a matrix code h","authors_text":"Katherine Morrison","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-27T15:06:37Z","title":"An Enumeration of the Equivalence Classes of Self-Dual Matrix Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07363","kind":"arxiv","version":2},"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:af1af00c95cd57a444019a6e44bf2811973c42a9ae843cf2ba02cc075f610f11","target":"record","created_at":"2026-05-18T01:36:37Z","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":"25995204d7909f35ccf3767191e56dd981bc34505d975b61a87dae81844f65b2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-27T15:06:37Z","title_canon_sha256":"27097e3069559025e0857c80621cd6b7ed1c8e795debdb9dc676cf116a596b8f"},"schema_version":"1.0","source":{"id":"1505.07363","kind":"arxiv","version":2}},"canonical_sha256":"f01cd036912eadded8102a04b222c48b76468d03dd247249fa8bf70d3fb73f84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f01cd036912eadded8102a04b222c48b76468d03dd247249fa8bf70d3fb73f84","first_computed_at":"2026-05-18T01:36:37.982813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:37.982813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4nCRb2fYJtaICZ21wExC3+TRB1y4Zp7fDAdxHnc8+I2vB9Q3762RqfcMbgkxgBfEKFGibk4CW/r/41SQlQ77BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:37.983717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af1af00c95cd57a444019a6e44bf2811973c42a9ae843cf2ba02cc075f610f11","sha256:b10ce0619ad2607d3fe8adb7b7d1b0a2fe7e0cf4baa8d38cbaba9f6f5eea7065"],"state_sha256":"4e438cf1f3c24936e6af17ca5978db5bf14e29364ebc3853e67c3d068e05cfc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCX9j0/x99j4VAbJUn57eG3jZ1m1ZPO1uQ7Fs2kmN/uvvQT06y6v1Oym8OKbBg2duFCmE5fy9yPB8kgwH4w2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:15:04.430931Z","bundle_sha256":"50107e1dc273cc60863e262d0c0dd46703ae974637a9266721cc7fa8f6b7ab4b"}}