{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G235HADAEFGMPAIVFCXOUL27BU","short_pith_number":"pith:G235HADA","schema_version":"1.0","canonical_sha256":"36b7d38060214cc7811528aeea2f5f0d269c684268d726379fde7a4349e68bdc","source":{"kind":"arxiv","id":"1501.01138","version":2},"attestation_state":"computed","paper":{"title":"On the minimum distance of elliptic curve codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Daqing Wan, Jiyou Li, Jun Zhang","submitted_at":"2015-01-06T10:42:31Z","abstract_excerpt":"Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \\np-hard problem for general linear codes. In practice, one often uses codes with additional mathematical structure, such as AG codes. For AG codes of genus $0$ (generalized Reed-Solomon codes), the minimum distance has a simple explicit formula. An interesting result of Cheng [3] says that the minimum distance problem is already \\np-hard (under \\rp-reduction) for general elliptic curve codes (ECAG codes, or AG codes of genus $1$). In this paper, we s"},"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":"1501.01138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T10:42:31Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"0ec32d521da1334c026f351b48aad7f3e524a6b1fd3f1747b7778268b7b1d6ba","abstract_canon_sha256":"0c37ff71921c6c114868c73a130ba116731b66297417b091fce184a8190e6b74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:54.577789Z","signature_b64":"ZMjBca7i59KE/KvsgVd2NZqrKgADtk9v0jxZI+K8Z93kc/MFbSZNULXac6G/fkP2SJvDSqmujrzv2ZIu0AI3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36b7d38060214cc7811528aeea2f5f0d269c684268d726379fde7a4349e68bdc","last_reissued_at":"2026-05-18T02:29:54.577396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:54.577396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the minimum distance of elliptic curve codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Daqing Wan, Jiyou Li, Jun Zhang","submitted_at":"2015-01-06T10:42:31Z","abstract_excerpt":"Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \\np-hard problem for general linear codes. In practice, one often uses codes with additional mathematical structure, such as AG codes. For AG codes of genus $0$ (generalized Reed-Solomon codes), the minimum distance has a simple explicit formula. An interesting result of Cheng [3] says that the minimum distance problem is already \\np-hard (under \\rp-reduction) for general elliptic curve codes (ECAG codes, or AG codes of genus $1$). In this paper, we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01138","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":"1501.01138","created_at":"2026-05-18T02:29:54.577452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01138v2","created_at":"2026-05-18T02:29:54.577452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01138","created_at":"2026-05-18T02:29:54.577452+00:00"},{"alias_kind":"pith_short_12","alias_value":"G235HADAEFGM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G235HADAEFGMPAIV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G235HADA","created_at":"2026-05-18T12:29:22.688609+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/G235HADAEFGMPAIVFCXOUL27BU","json":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU.json","graph_json":"https://pith.science/api/pith-number/G235HADAEFGMPAIVFCXOUL27BU/graph.json","events_json":"https://pith.science/api/pith-number/G235HADAEFGMPAIVFCXOUL27BU/events.json","paper":"https://pith.science/paper/G235HADA"},"agent_actions":{"view_html":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU","download_json":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU.json","view_paper":"https://pith.science/paper/G235HADA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01138&json=true","fetch_graph":"https://pith.science/api/pith-number/G235HADAEFGMPAIVFCXOUL27BU/graph.json","fetch_events":"https://pith.science/api/pith-number/G235HADAEFGMPAIVFCXOUL27BU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU/action/storage_attestation","attest_author":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU/action/author_attestation","sign_citation":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU/action/citation_signature","submit_replication":"https://pith.science/pith/G235HADAEFGMPAIVFCXOUL27BU/action/replication_record"}},"created_at":"2026-05-18T02:29:54.577452+00:00","updated_at":"2026-05-18T02:29:54.577452+00:00"}