{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2FQKESVRBZZFRG2DBT4NLWGZNK","short_pith_number":"pith:2FQKESVR","canonical_record":{"source":{"id":"1401.4539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T13:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"cfad066deee0be51f3d2403f9f4ca93a74fd8fcecba6017c83bace701d3c23e3","abstract_canon_sha256":"313fc546143f00ea157a8e3fa639f884fbbeef3b4c092827d53436ee218a9d6a"},"schema_version":"1.0"},"canonical_sha256":"d160a24ab10e72589b430cf8d5d8d96a9a12f7617bbae638328a628d63a20587","source":{"kind":"arxiv","id":"1401.4539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4539","created_at":"2026-05-18T01:42:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4539v2","created_at":"2026-05-18T01:42:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4539","created_at":"2026-05-18T01:42:57Z"},{"alias_kind":"pith_short_12","alias_value":"2FQKESVRBZZF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FQKESVRBZZFRG2D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FQKESVR","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2FQKESVRBZZFRG2DBT4NLWGZNK","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T13:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"cfad066deee0be51f3d2403f9f4ca93a74fd8fcecba6017c83bace701d3c23e3","abstract_canon_sha256":"313fc546143f00ea157a8e3fa639f884fbbeef3b4c092827d53436ee218a9d6a"},"schema_version":"1.0"},"canonical_sha256":"d160a24ab10e72589b430cf8d5d8d96a9a12f7617bbae638328a628d63a20587","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:57.592645Z","signature_b64":"dKlp5NdRjp6QHzpoXVbSgWkoVsdozvcYCmOMIaPr8Kw052mbzQLU4xgP5iIpaNiB0sv68W9AuTidYnw8cRtqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d160a24ab10e72589b430cf8d5d8d96a9a12f7617bbae638328a628d63a20587","last_reissued_at":"2026-05-18T01:42:57.591855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:57.591855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4539","source_version":2,"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-18T01:42:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1IGyP9NAJjfYaTeUnAuFZWS3RgiPqIwPrmrTIZL42DOHUMHUIBdwLbvB5TTjioLzZjfTP3j/DqPgEQIq99OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:01:14.289474Z"},"content_sha256":"0cbd94e532a17b13c8b1bd9a9b8e0f399764bbef28e0c471db4e0516c2ca54ed","schema_version":"1.0","event_id":"sha256:0cbd94e532a17b13c8b1bd9a9b8e0f399764bbef28e0c471db4e0516c2ca54ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2FQKESVRBZZFRG2DBT4NLWGZNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Minimum Common String Partition Problem with the Help of Ants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"M. Sohel Rahman, S.M. Ferdous","submitted_at":"2014-01-18T13:15:30Z","abstract_excerpt":"In this paper, we consider the problem of finding a minimum common partition of two strings. The problem has its application in genome comparison. As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic technique, namely, MAX-MIN ant system to solve this problem. To achieve better efficiency we first map the problem instance into a special kind of graph. Subsequently, we employ a MAX-MIN ant system to achieve high quality solutions for the problem. Experimental results show the superiority of our algorithm in comparison with the state of art algorithm in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4539","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"},"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-18T01:42:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZ48IN/8P6Yisic9dWPWarCR22ERC//Glu5XDS0BDvHDfpWQcNC+dKZ1P/7AXRmBqV+gEtVumi72MmTmqRqqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:01:14.289939Z"},"content_sha256":"ac40b7575b4b867e22a0cf7254f01f18e9aae9cf0fb4471546d103e35c067dbc","schema_version":"1.0","event_id":"sha256:ac40b7575b4b867e22a0cf7254f01f18e9aae9cf0fb4471546d103e35c067dbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FQKESVRBZZFRG2DBT4NLWGZNK/bundle.json","state_url":"https://pith.science/pith/2FQKESVRBZZFRG2DBT4NLWGZNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FQKESVRBZZFRG2DBT4NLWGZNK/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-06-24T06:01:14Z","links":{"resolver":"https://pith.science/pith/2FQKESVRBZZFRG2DBT4NLWGZNK","bundle":"https://pith.science/pith/2FQKESVRBZZFRG2DBT4NLWGZNK/bundle.json","state":"https://pith.science/pith/2FQKESVRBZZFRG2DBT4NLWGZNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FQKESVRBZZFRG2DBT4NLWGZNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2FQKESVRBZZFRG2DBT4NLWGZNK","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":"313fc546143f00ea157a8e3fa639f884fbbeef3b4c092827d53436ee218a9d6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T13:15:30Z","title_canon_sha256":"cfad066deee0be51f3d2403f9f4ca93a74fd8fcecba6017c83bace701d3c23e3"},"schema_version":"1.0","source":{"id":"1401.4539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4539","created_at":"2026-05-18T01:42:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4539v2","created_at":"2026-05-18T01:42:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4539","created_at":"2026-05-18T01:42:57Z"},{"alias_kind":"pith_short_12","alias_value":"2FQKESVRBZZF","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"2FQKESVRBZZFRG2D","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"2FQKESVR","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:ac40b7575b4b867e22a0cf7254f01f18e9aae9cf0fb4471546d103e35c067dbc","target":"graph","created_at":"2026-05-18T01:42:57Z","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":"In this paper, we consider the problem of finding a minimum common partition of two strings. The problem has its application in genome comparison. As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic technique, namely, MAX-MIN ant system to solve this problem. To achieve better efficiency we first map the problem instance into a special kind of graph. Subsequently, we employ a MAX-MIN ant system to achieve high quality solutions for the problem. Experimental results show the superiority of our algorithm in comparison with the state of art algorithm in the","authors_text":"M. Sohel Rahman, S.M. Ferdous","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T13:15:30Z","title":"Solving the Minimum Common String Partition Problem with the Help of Ants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4539","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:0cbd94e532a17b13c8b1bd9a9b8e0f399764bbef28e0c471db4e0516c2ca54ed","target":"record","created_at":"2026-05-18T01:42:57Z","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":"313fc546143f00ea157a8e3fa639f884fbbeef3b4c092827d53436ee218a9d6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-18T13:15:30Z","title_canon_sha256":"cfad066deee0be51f3d2403f9f4ca93a74fd8fcecba6017c83bace701d3c23e3"},"schema_version":"1.0","source":{"id":"1401.4539","kind":"arxiv","version":2}},"canonical_sha256":"d160a24ab10e72589b430cf8d5d8d96a9a12f7617bbae638328a628d63a20587","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d160a24ab10e72589b430cf8d5d8d96a9a12f7617bbae638328a628d63a20587","first_computed_at":"2026-05-18T01:42:57.591855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:57.591855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dKlp5NdRjp6QHzpoXVbSgWkoVsdozvcYCmOMIaPr8Kw052mbzQLU4xgP5iIpaNiB0sv68W9AuTidYnw8cRtqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:57.592645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cbd94e532a17b13c8b1bd9a9b8e0f399764bbef28e0c471db4e0516c2ca54ed","sha256:ac40b7575b4b867e22a0cf7254f01f18e9aae9cf0fb4471546d103e35c067dbc"],"state_sha256":"dfaa41493e7bdcc84c50dba744c33ba4d9f654f7e95a3b02b2abd066814d34e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i92LI00UuqDX4cgT8TI1lztT3AQBXXEkfbRGnFwd1OUl3MHlovhuCmAdrIcjYrqcATMx4iw3jRiBLfIpZZsJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:01:14.292484Z","bundle_sha256":"39659b21003306d9c1fec5bfcbdf3d16b2d5342cffe9c4d5ce212b1c37bf284e"}}