{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G235HADAEFGMPAIVFCXOUL27BU","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":"0c37ff71921c6c114868c73a130ba116731b66297417b091fce184a8190e6b74","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T10:42:31Z","title_canon_sha256":"0ec32d521da1334c026f351b48aad7f3e524a6b1fd3f1747b7778268b7b1d6ba"},"schema_version":"1.0","source":{"id":"1501.01138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01138","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01138v2","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01138","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"G235HADAEFGM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G235HADAEFGMPAIV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G235HADA","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:d5c8f930a53e13b7c82e6297c42cc47757567feac4ec57ad85b6086eebe7eacb","target":"graph","created_at":"2026-05-18T02:29:54Z","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":"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","authors_text":"Daqing Wan, Jiyou Li, Jun Zhang","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T10:42:31Z","title":"On the minimum distance of elliptic curve codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01138","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:847ef3459ccc2afcef22323a50b2519e2cfc704811ab2990b028f9a6f123099c","target":"record","created_at":"2026-05-18T02:29:54Z","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":"0c37ff71921c6c114868c73a130ba116731b66297417b091fce184a8190e6b74","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T10:42:31Z","title_canon_sha256":"0ec32d521da1334c026f351b48aad7f3e524a6b1fd3f1747b7778268b7b1d6ba"},"schema_version":"1.0","source":{"id":"1501.01138","kind":"arxiv","version":2}},"canonical_sha256":"36b7d38060214cc7811528aeea2f5f0d269c684268d726379fde7a4349e68bdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36b7d38060214cc7811528aeea2f5f0d269c684268d726379fde7a4349e68bdc","first_computed_at":"2026-05-18T02:29:54.577396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:54.577396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZMjBca7i59KE/KvsgVd2NZqrKgADtk9v0jxZI+K8Z93kc/MFbSZNULXac6G/fkP2SJvDSqmujrzv2ZIu0AI3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:54.577789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:847ef3459ccc2afcef22323a50b2519e2cfc704811ab2990b028f9a6f123099c","sha256:d5c8f930a53e13b7c82e6297c42cc47757567feac4ec57ad85b6086eebe7eacb"],"state_sha256":"c860c46f0bc9d9534a8396f5fb7f3603bd23c456db51c3c2cf42f25fff1b1f6f"}