{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C65DWT7YZ255RO7WELZ5L5E55U","short_pith_number":"pith:C65DWT7Y","schema_version":"1.0","canonical_sha256":"17ba3b4ff8cebbd8bbf622f3d5f49ded2fb49a5516e314362ffa5a580076ae5c","source":{"kind":"arxiv","id":"1307.3107","version":2},"attestation_state":"computed","paper":{"title":"An improvement of the Feng-Rao bound for primary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Olav Geil, Stefano Martin","submitted_at":"2013-07-11T13:40:19Z","abstract_excerpt":"We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method does not only work for the minimum distance but can be applied to any generalised Hamming weight"},"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":"1307.3107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-11T13:40:19Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"dfb9cc0ac9443f421988f99897347b762839bf115e9f409c3231be437b648f4a","abstract_canon_sha256":"d68b62a9b13ec76a2fe666cf6114bc63215b0dc1de4b7ca2c5d8ec19b4726f34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:44.035720Z","signature_b64":"jSyyA5Boa2MvJ3wZaURJLDDzLVCQIahZ+Je3BuqUz3FdoDfDm9Iz9gh1qQWezGdMWyEIY13lvuTPj1Xnl7jiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17ba3b4ff8cebbd8bbf622f3d5f49ded2fb49a5516e314362ffa5a580076ae5c","last_reissued_at":"2026-05-18T03:17:44.035157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:44.035157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improvement of the Feng-Rao bound for primary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Olav Geil, Stefano Martin","submitted_at":"2013-07-11T13:40:19Z","abstract_excerpt":"We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method does not only work for the minimum distance but can be applied to any generalised Hamming weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3107","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":"1307.3107","created_at":"2026-05-18T03:17:44.035243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3107v2","created_at":"2026-05-18T03:17:44.035243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3107","created_at":"2026-05-18T03:17:44.035243+00:00"},{"alias_kind":"pith_short_12","alias_value":"C65DWT7YZ255","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C65DWT7YZ255RO7W","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C65DWT7Y","created_at":"2026-05-18T12:27:40.988391+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/C65DWT7YZ255RO7WELZ5L5E55U","json":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U.json","graph_json":"https://pith.science/api/pith-number/C65DWT7YZ255RO7WELZ5L5E55U/graph.json","events_json":"https://pith.science/api/pith-number/C65DWT7YZ255RO7WELZ5L5E55U/events.json","paper":"https://pith.science/paper/C65DWT7Y"},"agent_actions":{"view_html":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U","download_json":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U.json","view_paper":"https://pith.science/paper/C65DWT7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3107&json=true","fetch_graph":"https://pith.science/api/pith-number/C65DWT7YZ255RO7WELZ5L5E55U/graph.json","fetch_events":"https://pith.science/api/pith-number/C65DWT7YZ255RO7WELZ5L5E55U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U/action/storage_attestation","attest_author":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U/action/author_attestation","sign_citation":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U/action/citation_signature","submit_replication":"https://pith.science/pith/C65DWT7YZ255RO7WELZ5L5E55U/action/replication_record"}},"created_at":"2026-05-18T03:17:44.035243+00:00","updated_at":"2026-05-18T03:17:44.035243+00:00"}