{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5QKLHWK423ZDU2DFTJN67ZXVIZ","short_pith_number":"pith:5QKLHWK4","schema_version":"1.0","canonical_sha256":"ec14b3d95cd6f23a68659a5befe6f546547a28578db845ef7390cd3f196606e0","source":{"kind":"arxiv","id":"1305.0649","version":2},"attestation_state":"computed","paper":{"title":"Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Komusiewicz, Laurent Bulteau","submitted_at":"2013-05-03T09:26:21Z","abstract_excerpt":"The NP-hard Minimum Common String Partition problem asks whether two strings $x$ and $y$ can each be partitioned into at most $k$ substrings, called blocks, such that both partitions use exactly the same blocks in a different order. We present the first fixed-parameter algorithm for Minimum Common String Partition using only parameter $k$."},"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":"1305.0649","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-03T09:26:21Z","cross_cats_sorted":[],"title_canon_sha256":"440809029a82efdb76976e0ab737c8e93cfdc65a7ac55cb92ee1c0a8403123c1","abstract_canon_sha256":"1bec0131d10ffc5bbccf40fad30d3391e1b46772b29524e1887796936a566249"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:47.140098Z","signature_b64":"s/CJi1tIwdMaffoBOfYTytHZQOYvrk7vmBLbXZj0H0eOlPs1zBJKyK9S9x6clizr1s9lIEwoFcQej4EUUDBLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec14b3d95cd6f23a68659a5befe6f546547a28578db845ef7390cd3f196606e0","last_reissued_at":"2026-05-18T03:08:47.139652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:47.139652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Komusiewicz, Laurent Bulteau","submitted_at":"2013-05-03T09:26:21Z","abstract_excerpt":"The NP-hard Minimum Common String Partition problem asks whether two strings $x$ and $y$ can each be partitioned into at most $k$ substrings, called blocks, such that both partitions use exactly the same blocks in a different order. We present the first fixed-parameter algorithm for Minimum Common String Partition using only parameter $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0649","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.0649","created_at":"2026-05-18T03:08:47.139717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0649v2","created_at":"2026-05-18T03:08:47.139717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0649","created_at":"2026-05-18T03:08:47.139717+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QKLHWK423ZD","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QKLHWK423ZDU2DF","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QKLHWK4","created_at":"2026-05-18T12:27:34.582898+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/5QKLHWK423ZDU2DFTJN67ZXVIZ","json":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ.json","graph_json":"https://pith.science/api/pith-number/5QKLHWK423ZDU2DFTJN67ZXVIZ/graph.json","events_json":"https://pith.science/api/pith-number/5QKLHWK423ZDU2DFTJN67ZXVIZ/events.json","paper":"https://pith.science/paper/5QKLHWK4"},"agent_actions":{"view_html":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ","download_json":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ.json","view_paper":"https://pith.science/paper/5QKLHWK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0649&json=true","fetch_graph":"https://pith.science/api/pith-number/5QKLHWK423ZDU2DFTJN67ZXVIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5QKLHWK423ZDU2DFTJN67ZXVIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ/action/storage_attestation","attest_author":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ/action/author_attestation","sign_citation":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ/action/citation_signature","submit_replication":"https://pith.science/pith/5QKLHWK423ZDU2DFTJN67ZXVIZ/action/replication_record"}},"created_at":"2026-05-18T03:08:47.139717+00:00","updated_at":"2026-05-18T03:08:47.139717+00:00"}