{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RGYABWGOQHBDJ6VYO735YFKFQB","short_pith_number":"pith:RGYABWGO","schema_version":"1.0","canonical_sha256":"89b000d8ce81c234fab877f7dc1545807e7515a7ba25eea602ede7442c3f1d8d","source":{"kind":"arxiv","id":"1711.11202","version":3},"attestation_state":"computed","paper":{"title":"On deep-holes of Gabidulin codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daqing Wan, Li-Ping Wang, Weijun Fang","submitted_at":"2017-11-30T03:14:04Z","abstract_excerpt":"In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of a special class of words to certain Gabidulin codes."},"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":"1711.11202","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-30T03:14:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8a7b483593e2807d51d43c5da4d045d0c72d694c7bfc53cb5afbd22fe0bf438b","abstract_canon_sha256":"b4f18706086efd7a4ce6c6b9b192a1d5ef62712b8f3795967c2a7e9f8594eda8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:12.058739Z","signature_b64":"V16a7DCUPmBkgHFmbYd8UoBjpGzo2p7Vjst+MZyMIFEdXgkq4bp22LN85vGXPuCXapd0MQNVa0FYtmDahMbFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89b000d8ce81c234fab877f7dc1545807e7515a7ba25eea602ede7442c3f1d8d","last_reissued_at":"2026-05-18T00:06:12.058002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:12.058002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On deep-holes of Gabidulin codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daqing Wan, Li-Ping Wang, Weijun Fang","submitted_at":"2017-11-30T03:14:04Z","abstract_excerpt":"In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of a special class of words to certain Gabidulin codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11202","kind":"arxiv","version":3},"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":"1711.11202","created_at":"2026-05-18T00:06:12.058103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.11202v3","created_at":"2026-05-18T00:06:12.058103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11202","created_at":"2026-05-18T00:06:12.058103+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGYABWGOQHBD","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGYABWGOQHBDJ6VY","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGYABWGO","created_at":"2026-05-18T12:31:39.905425+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/RGYABWGOQHBDJ6VYO735YFKFQB","json":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB.json","graph_json":"https://pith.science/api/pith-number/RGYABWGOQHBDJ6VYO735YFKFQB/graph.json","events_json":"https://pith.science/api/pith-number/RGYABWGOQHBDJ6VYO735YFKFQB/events.json","paper":"https://pith.science/paper/RGYABWGO"},"agent_actions":{"view_html":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB","download_json":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB.json","view_paper":"https://pith.science/paper/RGYABWGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.11202&json=true","fetch_graph":"https://pith.science/api/pith-number/RGYABWGOQHBDJ6VYO735YFKFQB/graph.json","fetch_events":"https://pith.science/api/pith-number/RGYABWGOQHBDJ6VYO735YFKFQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB/action/storage_attestation","attest_author":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB/action/author_attestation","sign_citation":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB/action/citation_signature","submit_replication":"https://pith.science/pith/RGYABWGOQHBDJ6VYO735YFKFQB/action/replication_record"}},"created_at":"2026-05-18T00:06:12.058103+00:00","updated_at":"2026-05-18T00:06:12.058103+00:00"}