{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3ICJC4BXS5T2EZPLXAZBPWYEV5","short_pith_number":"pith:3ICJC4BX","schema_version":"1.0","canonical_sha256":"da049170379767a265ebb83217db04af535e374a363522f49c14f3d84c54e903","source":{"kind":"arxiv","id":"1204.2201","version":1},"attestation_state":"computed","paper":{"title":"The complexity of string partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Anne Condon, Chris Thachuk, J\\'an Ma\\v{n}uch","submitted_at":"2012-04-10T16:00:02Z","abstract_excerpt":"Given a string $w$ over a finite alphabet $\\Sigma$ and an integer $K$, can $w$ be partitioned into strings of length at most $K$, such that there are no \\emph{collisions}? We refer to this question as the \\emph{string partition} problem and show it is \\NP-complete for various definitions of collision and for a number of interesting restrictions including $|\\Sigma|=2$. This establishes the hardness of an important problem in contemporary synthetic biology, namely, oligo design for gene synthesis."},"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":"1204.2201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-10T16:00:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"7fa2d269dff59bc19924becdf498faec60b56529ebebc4c030378fdbad1e31e8","abstract_canon_sha256":"5050115af5544da32938fc44285b526e931cb8291509fbfc124af4520781d095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.046284Z","signature_b64":"CAqm+JHUqnHNGJZ8nhVtHaz4QomKD7hT8nrrzxE/hjIAm/NMuo0lIe5mWfOPn9lEiLaCcFYOC6BxhHFqnYLCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da049170379767a265ebb83217db04af535e374a363522f49c14f3d84c54e903","last_reissued_at":"2026-05-18T03:58:13.045607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.045607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of string partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Anne Condon, Chris Thachuk, J\\'an Ma\\v{n}uch","submitted_at":"2012-04-10T16:00:02Z","abstract_excerpt":"Given a string $w$ over a finite alphabet $\\Sigma$ and an integer $K$, can $w$ be partitioned into strings of length at most $K$, such that there are no \\emph{collisions}? We refer to this question as the \\emph{string partition} problem and show it is \\NP-complete for various definitions of collision and for a number of interesting restrictions including $|\\Sigma|=2$. This establishes the hardness of an important problem in contemporary synthetic biology, namely, oligo design for gene synthesis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2201","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":"1204.2201","created_at":"2026-05-18T03:58:13.045707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2201v1","created_at":"2026-05-18T03:58:13.045707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2201","created_at":"2026-05-18T03:58:13.045707+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ICJC4BXS5T2","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ICJC4BXS5T2EZPL","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ICJC4BX","created_at":"2026-05-18T12:26:50.516681+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/3ICJC4BXS5T2EZPLXAZBPWYEV5","json":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5.json","graph_json":"https://pith.science/api/pith-number/3ICJC4BXS5T2EZPLXAZBPWYEV5/graph.json","events_json":"https://pith.science/api/pith-number/3ICJC4BXS5T2EZPLXAZBPWYEV5/events.json","paper":"https://pith.science/paper/3ICJC4BX"},"agent_actions":{"view_html":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5","download_json":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5.json","view_paper":"https://pith.science/paper/3ICJC4BX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2201&json=true","fetch_graph":"https://pith.science/api/pith-number/3ICJC4BXS5T2EZPLXAZBPWYEV5/graph.json","fetch_events":"https://pith.science/api/pith-number/3ICJC4BXS5T2EZPLXAZBPWYEV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5/action/storage_attestation","attest_author":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5/action/author_attestation","sign_citation":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5/action/citation_signature","submit_replication":"https://pith.science/pith/3ICJC4BXS5T2EZPLXAZBPWYEV5/action/replication_record"}},"created_at":"2026-05-18T03:58:13.045707+00:00","updated_at":"2026-05-18T03:58:13.045707+00:00"}