{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:R74OOINWPRYES5JPB5VX5IIY5D","short_pith_number":"pith:R74OOINW","canonical_record":{"source":{"id":"1303.4375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T19:42:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"328013de2b69c9e7a2e4146a752290f974a057a35554554db52427765dc02a9a","abstract_canon_sha256":"dba920e2d25316a8d9cc783d3f08c66a572e8d25ebf2a4e02cdd4118121c579c"},"schema_version":"1.0"},"canonical_sha256":"8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd","source":{"kind":"arxiv","id":"1303.4375","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4375","created_at":"2026-05-18T03:30:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4375v1","created_at":"2026-05-18T03:30:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4375","created_at":"2026-05-18T03:30:38Z"},{"alias_kind":"pith_short_12","alias_value":"R74OOINWPRYE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R74OOINWPRYES5JP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R74OOINW","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:R74OOINWPRYES5JPB5VX5IIY5D","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T19:42:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"328013de2b69c9e7a2e4146a752290f974a057a35554554db52427765dc02a9a","abstract_canon_sha256":"dba920e2d25316a8d9cc783d3f08c66a572e8d25ebf2a4e02cdd4118121c579c"},"schema_version":"1.0"},"canonical_sha256":"8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:38.731053Z","signature_b64":"0HuR/Mj+fHhVN9qwy/d0Cq+2zGFk1yd+mpH/23XlctUcmgdUJbjTg1D6wJmz8NPENv7xxM7ECX/CiyQPf37FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd","last_reissued_at":"2026-05-18T03:30:38.730232Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:38.730232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4375","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:30:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DBxcaX2rXkAiP6FDleVNFQAKtAPXkbexDAb8AqbDdbHnW/G+gNtqmOmI+4YMsOd8N6LlKmD67mN7VVDAd8nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:48:35.639140Z"},"content_sha256":"462cfcebadeb3b1c2fa093345820bdd189b423992ba333791217e3180294eea8","schema_version":"1.0","event_id":"sha256:462cfcebadeb3b1c2fa093345820bdd189b423992ba333791217e3180294eea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:R74OOINWPRYES5JPB5VX5IIY5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Azouaoui, Mohamed Askali, Mostafa Belkasmi, Sa\\\"id Nouh","submitted_at":"2013-03-18T19:42:10Z","abstract_excerpt":"The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4375","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:30:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"inVFY2g7daywNsGBm+4w5mfPJfTongqAuyYK7QDLTTM06ySub3KzSUAMvOgJJCn4/1R8BsVwr3Dr5pSBsM7sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:48:35.639620Z"},"content_sha256":"cc24a68a9932eae4fcb812268b1dd10154e70ea445362e87c5256272d02c089f","schema_version":"1.0","event_id":"sha256:cc24a68a9932eae4fcb812268b1dd10154e70ea445362e87c5256272d02c089f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R74OOINWPRYES5JPB5VX5IIY5D/bundle.json","state_url":"https://pith.science/pith/R74OOINWPRYES5JPB5VX5IIY5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R74OOINWPRYES5JPB5VX5IIY5D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T07:48:35Z","links":{"resolver":"https://pith.science/pith/R74OOINWPRYES5JPB5VX5IIY5D","bundle":"https://pith.science/pith/R74OOINWPRYES5JPB5VX5IIY5D/bundle.json","state":"https://pith.science/pith/R74OOINWPRYES5JPB5VX5IIY5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R74OOINWPRYES5JPB5VX5IIY5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:R74OOINWPRYES5JPB5VX5IIY5D","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":"dba920e2d25316a8d9cc783d3f08c66a572e8d25ebf2a4e02cdd4118121c579c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T19:42:10Z","title_canon_sha256":"328013de2b69c9e7a2e4146a752290f974a057a35554554db52427765dc02a9a"},"schema_version":"1.0","source":{"id":"1303.4375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4375","created_at":"2026-05-18T03:30:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4375v1","created_at":"2026-05-18T03:30:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4375","created_at":"2026-05-18T03:30:38Z"},{"alias_kind":"pith_short_12","alias_value":"R74OOINWPRYE","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"R74OOINWPRYES5JP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"R74OOINW","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:cc24a68a9932eae4fcb812268b1dd10154e70ea445362e87c5256272d02c089f","target":"graph","created_at":"2026-05-18T03:30:38Z","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":"The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which ","authors_text":"Ahmed Azouaoui, Mohamed Askali, Mostafa Belkasmi, Sa\\\"id Nouh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T19:42:10Z","title":"On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4375","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:462cfcebadeb3b1c2fa093345820bdd189b423992ba333791217e3180294eea8","target":"record","created_at":"2026-05-18T03:30:38Z","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":"dba920e2d25316a8d9cc783d3f08c66a572e8d25ebf2a4e02cdd4118121c579c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T19:42:10Z","title_canon_sha256":"328013de2b69c9e7a2e4146a752290f974a057a35554554db52427765dc02a9a"},"schema_version":"1.0","source":{"id":"1303.4375","kind":"arxiv","version":1}},"canonical_sha256":"8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd","first_computed_at":"2026-05-18T03:30:38.730232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:38.730232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0HuR/Mj+fHhVN9qwy/d0Cq+2zGFk1yd+mpH/23XlctUcmgdUJbjTg1D6wJmz8NPENv7xxM7ECX/CiyQPf37FDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:38.731053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:462cfcebadeb3b1c2fa093345820bdd189b423992ba333791217e3180294eea8","sha256:cc24a68a9932eae4fcb812268b1dd10154e70ea445362e87c5256272d02c089f"],"state_sha256":"500d633c1ae8e7bbc7b07c7c9721b3c88f23f7f66e11639662c9ad75a3a41752"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVO2CJCeTIC92L1gCL710xzC8kBnVQuUndDUlGGg0UW89Tf+ScVxd/sMMPY/9h/dceUl3c9946U7/t2Zanh7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:48:35.643850Z","bundle_sha256":"e24906c79e97c1da91239010dc1b1d6e29d9158ed56193a34512a9d3bdc28a93"}}