{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7QWJPUUK3OGZWFO5XEPTHOMMML","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":"be0b38702bf169bf010013819f581523fa1ca3fc10619d9e96b31b50e5184f71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-18T21:07:53Z","title_canon_sha256":"430f3b7096e38e6aa1869a2e3c331e0ffa8441fef8d919858019ae76dc61e8ba"},"schema_version":"1.0","source":{"id":"1807.07151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07151","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07151v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07151","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"7QWJPUUK3OGZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7QWJPUUK3OGZWFO5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7QWJPUUK","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:c0ac8eb7020bed266d905e3476c0eaad94747b968d3a063289974bb0f2b9067a","target":"graph","created_at":"2026-05-18T00:10:21Z","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":"We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the problem, so that its space of solutions does not depend on the size of the base field or the dimension of the code. Actually, the efficiency of our method only grows non-polynomially with respect to the length of the code.","authors_text":"F. J. Lobillo, Gabriel Navarro, Jos\\'e G\\'omez-Torrecillas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-18T21:07:53Z","title":"Minimum distance computation of linear codes via genetic algorithms with permutation encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07151","kind":"arxiv","version":1},"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:00b125a49af850660cd863d277120ae560c72ec890ed40a157fe557fe15193d4","target":"record","created_at":"2026-05-18T00:10:21Z","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":"be0b38702bf169bf010013819f581523fa1ca3fc10619d9e96b31b50e5184f71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-18T21:07:53Z","title_canon_sha256":"430f3b7096e38e6aa1869a2e3c331e0ffa8441fef8d919858019ae76dc61e8ba"},"schema_version":"1.0","source":{"id":"1807.07151","kind":"arxiv","version":1}},"canonical_sha256":"fc2c97d28adb8d9b15ddb91f33b98c62ff85a885e17c32aebce33755e24afba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2c97d28adb8d9b15ddb91f33b98c62ff85a885e17c32aebce33755e24afba3","first_computed_at":"2026-05-18T00:10:21.124962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:21.124962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j875SjuV6sfkuEnE4CaP6AHgqTqDSq0uaEAQnFq90Bp/fORKZqCDr9okdoelYZdECupMaz531i3m+PJymv3cAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:21.125466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00b125a49af850660cd863d277120ae560c72ec890ed40a157fe557fe15193d4","sha256:c0ac8eb7020bed266d905e3476c0eaad94747b968d3a063289974bb0f2b9067a"],"state_sha256":"a566438a996a401fec688871b4e14dec4fe08b5bee99067c46ece51929db7ab1"}