{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CNL2GQA7X3DFDFSFS4QQW5DUBE","short_pith_number":"pith:CNL2GQA7","schema_version":"1.0","canonical_sha256":"1357a3401fbec651964597210b74740938de149e200fcc72bc6cbeb80fe64570","source":{"kind":"arxiv","id":"1708.09325","version":1},"attestation_state":"computed","paper":{"title":"Approximating Weighted Duo-Preservation in Comparative Genomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Saeed Mehrabi","submitted_at":"2017-08-30T15:25:16Z","abstract_excerpt":"Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings $s_1$ and $s_2$ from the same alphabet and the goal is to find a mapping $\\pi$ between them so as to maximize the number of duos preserved. A duo is any two consecutive characters in a string and it is preserved in the mapping if its two consecutive characters in $s_1$ are mapped to same two consecutive characters in $s_2$. The MDSM problem is known to be NP-hard and there are approximation algorithms for this problem [3, 5, 13], but all of "},"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":"1708.09325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-30T15:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"b9c2fbdb94ed62a1b8a44add26f8f31d98e6949107ae3253097abed5d293b340","abstract_canon_sha256":"b5382088028860cc6a7b61f2ce0ce079cee2f64739c58f882113d57a97f6ae84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:20.186208Z","signature_b64":"uIs1XzHK2eexzYv8bLBmAOBd73gwFWn0qjRbCmaKkLSvE7+q7XsztGp5C5tpr8Hy046XqE/F+tadtZhj9ABNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1357a3401fbec651964597210b74740938de149e200fcc72bc6cbeb80fe64570","last_reissued_at":"2026-05-18T00:36:20.185582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:20.185582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Weighted Duo-Preservation in Comparative Genomics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Saeed Mehrabi","submitted_at":"2017-08-30T15:25:16Z","abstract_excerpt":"Motivated by comparative genomics, Chen et al. [9] introduced the Maximum Duo-preservation String Mapping (MDSM) problem in which we are given two strings $s_1$ and $s_2$ from the same alphabet and the goal is to find a mapping $\\pi$ between them so as to maximize the number of duos preserved. A duo is any two consecutive characters in a string and it is preserved in the mapping if its two consecutive characters in $s_1$ are mapped to same two consecutive characters in $s_2$. The MDSM problem is known to be NP-hard and there are approximation algorithms for this problem [3, 5, 13], but all of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09325","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":"1708.09325","created_at":"2026-05-18T00:36:20.185668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09325v1","created_at":"2026-05-18T00:36:20.185668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09325","created_at":"2026-05-18T00:36:20.185668+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNL2GQA7X3DF","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNL2GQA7X3DFDFSF","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNL2GQA7","created_at":"2026-05-18T12:31:10.602751+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/CNL2GQA7X3DFDFSFS4QQW5DUBE","json":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE.json","graph_json":"https://pith.science/api/pith-number/CNL2GQA7X3DFDFSFS4QQW5DUBE/graph.json","events_json":"https://pith.science/api/pith-number/CNL2GQA7X3DFDFSFS4QQW5DUBE/events.json","paper":"https://pith.science/paper/CNL2GQA7"},"agent_actions":{"view_html":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE","download_json":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE.json","view_paper":"https://pith.science/paper/CNL2GQA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09325&json=true","fetch_graph":"https://pith.science/api/pith-number/CNL2GQA7X3DFDFSFS4QQW5DUBE/graph.json","fetch_events":"https://pith.science/api/pith-number/CNL2GQA7X3DFDFSFS4QQW5DUBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE/action/storage_attestation","attest_author":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE/action/author_attestation","sign_citation":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE/action/citation_signature","submit_replication":"https://pith.science/pith/CNL2GQA7X3DFDFSFS4QQW5DUBE/action/replication_record"}},"created_at":"2026-05-18T00:36:20.185668+00:00","updated_at":"2026-05-18T00:36:20.185668+00:00"}