{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:K37WYM5QK7ZAUTCDUO4Q6MHTDJ","short_pith_number":"pith:K37WYM5Q","schema_version":"1.0","canonical_sha256":"56ff6c33b057f20a4c43a3b90f30f31a5c6ff9ee45cd6940e3224527b0f72aea","source":{"kind":"arxiv","id":"1702.06256","version":2},"attestation_state":"computed","paper":{"title":"A $(1.4 + \\epsilon)$-approximation algorithm for the $2$-Max-Duo problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guohui Lin, Peng Zhang, Taibo Luo, Tian Liu, Yao Xu, Yong Chen","submitted_at":"2017-02-21T04:06:15Z","abstract_excerpt":"The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including text compression and bioinformatics. $k$-Max-Duo is the restricted version of Max-Duo, where every letter of the alphabet occurs at most $k$ times in each of the strings, which is readily reduced into the well known maximum independent set (MIS) problem on a graph of maximum degree $\\Delta \\le 6(k-1)$. In particular, $2$-Max-Duo can then be approximated arbitrarily close to $1.8$ using the st"},"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":"1702.06256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-21T04:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"5380d66c9dee4cc4be036e76964629bab3a7f5febaed2655eff975203f4a5032","abstract_canon_sha256":"0b0bcb39983d1754bef41679dab6b58a728b34ffededb5c2e5f135dbfaa2ed13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:55.374148Z","signature_b64":"d7NN8YcYu3qslRu0sM40SflxTYiopaIkQgfCHLQU44i1NN6AD5bm2A95jiqpPpC0SG2rSZIlm6ZkmFrYkEQ0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56ff6c33b057f20a4c43a3b90f30f31a5c6ff9ee45cd6940e3224527b0f72aea","last_reissued_at":"2026-05-18T00:35:55.373720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:55.373720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $(1.4 + \\epsilon)$-approximation algorithm for the $2$-Max-Duo problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guohui Lin, Peng Zhang, Taibo Luo, Tian Liu, Yao Xu, Yong Chen","submitted_at":"2017-02-21T04:06:15Z","abstract_excerpt":"The maximum duo-preservation string mapping (Max-Duo) problem is the complement of the well studied minimum common string partition (MCSP) problem, both of which have applications in many fields including text compression and bioinformatics. $k$-Max-Duo is the restricted version of Max-Duo, where every letter of the alphabet occurs at most $k$ times in each of the strings, which is readily reduced into the well known maximum independent set (MIS) problem on a graph of maximum degree $\\Delta \\le 6(k-1)$. In particular, $2$-Max-Duo can then be approximated arbitrarily close to $1.8$ using the st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06256","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":"1702.06256","created_at":"2026-05-18T00:35:55.373793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06256v2","created_at":"2026-05-18T00:35:55.373793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06256","created_at":"2026-05-18T00:35:55.373793+00:00"},{"alias_kind":"pith_short_12","alias_value":"K37WYM5QK7ZA","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"K37WYM5QK7ZAUTCD","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"K37WYM5Q","created_at":"2026-05-18T12:31:24.725408+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/K37WYM5QK7ZAUTCDUO4Q6MHTDJ","json":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ.json","graph_json":"https://pith.science/api/pith-number/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/graph.json","events_json":"https://pith.science/api/pith-number/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/events.json","paper":"https://pith.science/paper/K37WYM5Q"},"agent_actions":{"view_html":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ","download_json":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ.json","view_paper":"https://pith.science/paper/K37WYM5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06256&json=true","fetch_graph":"https://pith.science/api/pith-number/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/action/storage_attestation","attest_author":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/action/author_attestation","sign_citation":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/action/citation_signature","submit_replication":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/action/replication_record"}},"created_at":"2026-05-18T00:35:55.373793+00:00","updated_at":"2026-05-18T00:35:55.373793+00:00"}