{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6AONANURF2W55WAQFICLEIWERN","short_pith_number":"pith:6AONANUR","schema_version":"1.0","canonical_sha256":"f01cd036912eadded8102a04b222c48b76468d03dd247249fa8bf70d3fb73f84","source":{"kind":"arxiv","id":"1505.07363","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.07363","created_at":"2026-05-18T01:36:37.982959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07363v2","created_at":"2026-05-18T01:36:37.982959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07363","created_at":"2026-05-18T01:36:37.982959+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AONANURF2W5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AONANURF2W55WAQ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AONANUR","created_at":"2026-05-18T12:29:07.941421+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/6AONANURF2W55WAQFICLEIWERN","json":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN.json","graph_json":"https://pith.science/api/pith-number/6AONANURF2W55WAQFICLEIWERN/graph.json","events_json":"https://pith.science/api/pith-number/6AONANURF2W55WAQFICLEIWERN/events.json","paper":"https://pith.science/paper/6AONANUR"},"agent_actions":{"view_html":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN","download_json":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN.json","view_paper":"https://pith.science/paper/6AONANUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07363&json=true","fetch_graph":"https://pith.science/api/pith-number/6AONANURF2W55WAQFICLEIWERN/graph.json","fetch_events":"https://pith.science/api/pith-number/6AONANURF2W55WAQFICLEIWERN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/action/storage_attestation","attest_author":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/action/author_attestation","sign_citation":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/action/citation_signature","submit_replication":"https://pith.science/pith/6AONANURF2W55WAQFICLEIWERN/action/replication_record"}},"created_at":"2026-05-18T01:36:37.982959+00:00","updated_at":"2026-05-18T01:36:37.982959+00:00"}