{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5WQCGMDCPVVLOAZ3JFZPQB5CSJ","short_pith_number":"pith:5WQCGMDC","schema_version":"1.0","canonical_sha256":"eda02330627d6ab7033b4972f807a292738c7e84ab27cf51b14e835830da4f16","source":{"kind":"arxiv","id":"1512.03220","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Mauro Castelli, Riccardo Dondi, Stefano Beretta","submitted_at":"2015-12-10T11:31:53Z","abstract_excerpt":"In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem. We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting a reduction to a kernel of size O(k^6 )."},"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":"1512.03220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-10T11:31:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e9bfda4b5844f16b24fe7f4a37b358b2c91d5cf4a2e1c61673eaad6b5e8d3eca","abstract_canon_sha256":"671f47a16d0a5283a11534600b94d15929cd2055cec2d9156364bc22723ea82c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:37.618113Z","signature_b64":"KG4UyqQLIHluV7INdXBR2yzf2TJvxtcwpU2/b+BwI0BMrttvMVDX3cCjIB0Zs+AtLIzef4yHrwLDn9BIw9sZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eda02330627d6ab7033b4972f807a292738c7e84ab27cf51b14e835830da4f16","last_reissued_at":"2026-05-18T01:24:37.617653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:37.617653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Mauro Castelli, Riccardo Dondi, Stefano Beretta","submitted_at":"2015-12-10T11:31:53Z","abstract_excerpt":"In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem. We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting a reduction to a kernel of size O(k^6 )."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03220","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":"1512.03220","created_at":"2026-05-18T01:24:37.617720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03220v1","created_at":"2026-05-18T01:24:37.617720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03220","created_at":"2026-05-18T01:24:37.617720+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WQCGMDCPVVL","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WQCGMDCPVVLOAZ3","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WQCGMDC","created_at":"2026-05-18T12:29:07.941421+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/5WQCGMDCPVVLOAZ3JFZPQB5CSJ","json":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ.json","graph_json":"https://pith.science/api/pith-number/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/graph.json","events_json":"https://pith.science/api/pith-number/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/events.json","paper":"https://pith.science/paper/5WQCGMDC"},"agent_actions":{"view_html":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ","download_json":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ.json","view_paper":"https://pith.science/paper/5WQCGMDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03220&json=true","fetch_graph":"https://pith.science/api/pith-number/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/action/storage_attestation","attest_author":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/action/author_attestation","sign_citation":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/action/citation_signature","submit_replication":"https://pith.science/pith/5WQCGMDCPVVLOAZ3JFZPQB5CSJ/action/replication_record"}},"created_at":"2026-05-18T01:24:37.617720+00:00","updated_at":"2026-05-18T01:24:37.617720+00:00"}