{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M2WUJKBIJ6PSNRFXUYQAX4BSLY","short_pith_number":"pith:M2WUJKBI","schema_version":"1.0","canonical_sha256":"66ad44a8284f9f26c4b7a6200bf0325e2c54da4feab998a7ab8f87ae770597ca","source":{"kind":"arxiv","id":"1405.6081","version":1},"attestation_state":"computed","paper":{"title":"An Integer Programming Formulation of the Minimum Common String Partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DM","authors_text":"M. Sohel Rahman, S. M. Ferdous","submitted_at":"2014-05-23T14:43:11Z","abstract_excerpt":"We consider the problem of finding a minimum common partition of two strings (MCSP). The problem has its application in genome comparison. MCSP problem is proved to be NP-hard. In this paper, we develop an Integer Programming (IP) formulation for the problem and implement it. The experimental results are compared with the previous state-of-the-art algorithms and are found to be promising."},"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":"1405.6081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-05-23T14:43:11Z","cross_cats_sorted":["math.CO","math.OC"],"title_canon_sha256":"7efe10e379961509fe5813f066938d3d82b1f3779648edefb2a764c27d484d8e","abstract_canon_sha256":"86c45fe16baaa328bc78b47a3c60a8aef1c5d3688ec38407a32d41571780f8aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:57.478366Z","signature_b64":"dlSjheufuguC+dp10SFy/IlV2ahS7iDTkztjuDIvkOMorVi2f9gODVFKJAp7+WlHX/xI4EMtp875nisjiJ+gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ad44a8284f9f26c4b7a6200bf0325e2c54da4feab998a7ab8f87ae770597ca","last_reissued_at":"2026-05-18T01:42:57.477609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:57.477609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Integer Programming Formulation of the Minimum Common String Partition problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.OC"],"primary_cat":"cs.DM","authors_text":"M. Sohel Rahman, S. M. Ferdous","submitted_at":"2014-05-23T14:43:11Z","abstract_excerpt":"We consider the problem of finding a minimum common partition of two strings (MCSP). The problem has its application in genome comparison. MCSP problem is proved to be NP-hard. In this paper, we develop an Integer Programming (IP) formulation for the problem and implement it. The experimental results are compared with the previous state-of-the-art algorithms and are found to be promising."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6081","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.6081","created_at":"2026-05-18T01:42:57.477727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6081v1","created_at":"2026-05-18T01:42:57.477727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6081","created_at":"2026-05-18T01:42:57.477727+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2WUJKBIJ6PS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2WUJKBIJ6PSNRFX","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2WUJKBI","created_at":"2026-05-18T12:28:38.356838+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/M2WUJKBIJ6PSNRFXUYQAX4BSLY","json":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY.json","graph_json":"https://pith.science/api/pith-number/M2WUJKBIJ6PSNRFXUYQAX4BSLY/graph.json","events_json":"https://pith.science/api/pith-number/M2WUJKBIJ6PSNRFXUYQAX4BSLY/events.json","paper":"https://pith.science/paper/M2WUJKBI"},"agent_actions":{"view_html":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY","download_json":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY.json","view_paper":"https://pith.science/paper/M2WUJKBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6081&json=true","fetch_graph":"https://pith.science/api/pith-number/M2WUJKBIJ6PSNRFXUYQAX4BSLY/graph.json","fetch_events":"https://pith.science/api/pith-number/M2WUJKBIJ6PSNRFXUYQAX4BSLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY/action/storage_attestation","attest_author":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY/action/author_attestation","sign_citation":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY/action/citation_signature","submit_replication":"https://pith.science/pith/M2WUJKBIJ6PSNRFXUYQAX4BSLY/action/replication_record"}},"created_at":"2026-05-18T01:42:57.477727+00:00","updated_at":"2026-05-18T01:42:57.477727+00:00"}