{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AP7DI73BJMRKPGY66BKMJPOY3U","short_pith_number":"pith:AP7DI73B","schema_version":"1.0","canonical_sha256":"03fe347f614b22a79b1ef054c4bdd8dd37f87211b8c75768b92036d2687b8c0a","source":{"kind":"arxiv","id":"1405.1885","version":2},"attestation_state":"computed","paper":{"title":"Optimal Ferrers Diagram Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Tuvi Etzion","submitted_at":"2014-05-08T11:23:42Z","abstract_excerpt":"Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space. Four techniques and constructions of Ferrers diagram rank-metric codes are presented, each providing optimal codes for different diagrams and parameters."},"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":"1405.1885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-08T11:23:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"105d44a6caf1e29192c53cea8882c3e0706ab298ff36dbd9b93cb5b8426e5b26","abstract_canon_sha256":"54508df7e62892ca0ea4fef58729235c98e06bf496ae89f3366342f67f7a0478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:07.905623Z","signature_b64":"/fgVMU7Xjh4q3Y0kJ5Due0EDoA6HhAm2uF4GjGQ9ocPvwdEgk6UYvAbOI1RXipor0C2ffq+D3Yg4sfFTBbciAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03fe347f614b22a79b1ef054c4bdd8dd37f87211b8c75768b92036d2687b8c0a","last_reissued_at":"2026-05-18T02:51:07.905146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:07.905146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Ferrers Diagram Rank-Metric Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Tuvi Etzion","submitted_at":"2014-05-08T11:23:42Z","abstract_excerpt":"Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space. Four techniques and constructions of Ferrers diagram rank-metric codes are presented, each providing optimal codes for different diagrams and parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1885","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":"1405.1885","created_at":"2026-05-18T02:51:07.905213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1885v2","created_at":"2026-05-18T02:51:07.905213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1885","created_at":"2026-05-18T02:51:07.905213+00:00"},{"alias_kind":"pith_short_12","alias_value":"AP7DI73BJMRK","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AP7DI73BJMRKPGY6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AP7DI73B","created_at":"2026-05-18T12:28:19.803747+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/AP7DI73BJMRKPGY66BKMJPOY3U","json":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U.json","graph_json":"https://pith.science/api/pith-number/AP7DI73BJMRKPGY66BKMJPOY3U/graph.json","events_json":"https://pith.science/api/pith-number/AP7DI73BJMRKPGY66BKMJPOY3U/events.json","paper":"https://pith.science/paper/AP7DI73B"},"agent_actions":{"view_html":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U","download_json":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U.json","view_paper":"https://pith.science/paper/AP7DI73B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1885&json=true","fetch_graph":"https://pith.science/api/pith-number/AP7DI73BJMRKPGY66BKMJPOY3U/graph.json","fetch_events":"https://pith.science/api/pith-number/AP7DI73BJMRKPGY66BKMJPOY3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U/action/storage_attestation","attest_author":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U/action/author_attestation","sign_citation":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U/action/citation_signature","submit_replication":"https://pith.science/pith/AP7DI73BJMRKPGY66BKMJPOY3U/action/replication_record"}},"created_at":"2026-05-18T02:51:07.905213+00:00","updated_at":"2026-05-18T02:51:07.905213+00:00"}