{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:K37WYM5QK7ZAUTCDUO4Q6MHTDJ","short_pith_number":"pith:K37WYM5Q","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"},"canonical_sha256":"56ff6c33b057f20a4c43a3b90f30f31a5c6ff9ee45cd6940e3224527b0f72aea","source":{"kind":"arxiv","id":"1702.06256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06256","created_at":"2026-05-18T00:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06256v2","created_at":"2026-05-18T00:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06256","created_at":"2026-05-18T00:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"K37WYM5QK7ZA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K37WYM5QK7ZAUTCD","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K37WYM5Q","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:K37WYM5QK7ZAUTCDUO4Q6MHTDJ","target":"record","payload":{"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"},"canonical_sha256":"56ff6c33b057f20a4c43a3b90f30f31a5c6ff9ee45cd6940e3224527b0f72aea","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"},"source_kind":"arxiv","source_id":"1702.06256","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XbUK1f8X2l49La8ho4Oxke9AX5p3AunqgBsnwhzdRrfbPEzFlWvLmHKTAKGx6+aObKoPVr04a8eQH2etiJkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:59:34.248551Z"},"content_sha256":"fa4b5471735cce4034249fb89705a9b84ebdcd7462c1850c66d731447b14fd5b","schema_version":"1.0","event_id":"sha256:fa4b5471735cce4034249fb89705a9b84ebdcd7462c1850c66d731447b14fd5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:K37WYM5QK7ZAUTCDUO4Q6MHTDJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QYE4H+k6mcdwX+XidTBIqlrHKkyL97rXca7c1rGln0K7t/i3KHV+GWSKQnNP76S7909HPeMFixn2zj6aUdTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T12:59:34.249237Z"},"content_sha256":"2d5775176b2c0f02d1a99e66d87ee4a476d01bd7b05c47ffc80c1ba2fe12d0a3","schema_version":"1.0","event_id":"sha256:2d5775176b2c0f02d1a99e66d87ee4a476d01bd7b05c47ffc80c1ba2fe12d0a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/bundle.json","state_url":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T12:59:34Z","links":{"resolver":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ","bundle":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/bundle.json","state":"https://pith.science/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K37WYM5QK7ZAUTCDUO4Q6MHTDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:K37WYM5QK7ZAUTCDUO4Q6MHTDJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0b0bcb39983d1754bef41679dab6b58a728b34ffededb5c2e5f135dbfaa2ed13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-21T04:06:15Z","title_canon_sha256":"5380d66c9dee4cc4be036e76964629bab3a7f5febaed2655eff975203f4a5032"},"schema_version":"1.0","source":{"id":"1702.06256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06256","created_at":"2026-05-18T00:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06256v2","created_at":"2026-05-18T00:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06256","created_at":"2026-05-18T00:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"K37WYM5QK7ZA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"K37WYM5QK7ZAUTCD","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"K37WYM5Q","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:2d5775176b2c0f02d1a99e66d87ee4a476d01bd7b05c47ffc80c1ba2fe12d0a3","target":"graph","created_at":"2026-05-18T00:35:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Guohui Lin, Peng Zhang, Taibo Luo, Tian Liu, Yao Xu, Yong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-21T04:06:15Z","title":"A $(1.4 + \\epsilon)$-approximation algorithm for the $2$-Max-Duo problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06256","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa4b5471735cce4034249fb89705a9b84ebdcd7462c1850c66d731447b14fd5b","target":"record","created_at":"2026-05-18T00:35:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0b0bcb39983d1754bef41679dab6b58a728b34ffededb5c2e5f135dbfaa2ed13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-21T04:06:15Z","title_canon_sha256":"5380d66c9dee4cc4be036e76964629bab3a7f5febaed2655eff975203f4a5032"},"schema_version":"1.0","source":{"id":"1702.06256","kind":"arxiv","version":2}},"canonical_sha256":"56ff6c33b057f20a4c43a3b90f30f31a5c6ff9ee45cd6940e3224527b0f72aea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56ff6c33b057f20a4c43a3b90f30f31a5c6ff9ee45cd6940e3224527b0f72aea","first_computed_at":"2026-05-18T00:35:55.373720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:55.373720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d7NN8YcYu3qslRu0sM40SflxTYiopaIkQgfCHLQU44i1NN6AD5bm2A95jiqpPpC0SG2rSZIlm6ZkmFrYkEQ0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:55.374148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa4b5471735cce4034249fb89705a9b84ebdcd7462c1850c66d731447b14fd5b","sha256:2d5775176b2c0f02d1a99e66d87ee4a476d01bd7b05c47ffc80c1ba2fe12d0a3"],"state_sha256":"8cbd0b872f748eb9a3c1b6e6bac6b8a2c8c30e94580ab533eccf8aa7fcb47e16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEWc3YZiwu3ej1EifuGGsN3gWp9R5PbXfUJGoCN1NAlnRF2Apeb+2dtGjpcrKzJRGoMg/5R4tUHbFQWwfh/4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T12:59:34.252362Z","bundle_sha256":"56cf96e56e81b807a3ccafe8f61367a0679c1af862c99fdc44dd212195c06169"}}