{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4S7CK376CJQPVVUKDGHVW3XVYZ","short_pith_number":"pith:4S7CK376","schema_version":"1.0","canonical_sha256":"e4be256ffe1260fad68a198f5b6ef5c640e56490c79d4b8e0313903dd5f71a16","source":{"kind":"arxiv","id":"1409.2457","version":2},"attestation_state":"computed","paper":{"title":"On the Chain Pair Simplification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binhai Zhu, Chenglin Fan, Matthew J. Katz, Omrit Filtser, Tim Wylie","submitted_at":"2014-09-08T18:37:29Z","abstract_excerpt":"The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led Bereg et al. to pose the Chain Pair Simplification problem (CPS). In this problem, given two polygonal chains $A$ and $B$ of lengths $m$ and $n$, respectively, one needs to simplify them simultaneously, such that each of the resulting simplified chains, $A'$ and $B'$, is of length at most $k$ and the discrete \\frechet\\ distance between $A'$ and $B'$ is at most $\\delta$, where $k$ and $\\delta$ are given parameters.\n  In this paper we study the complexity of CPS under"},"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":"1409.2457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-08T18:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"a756c047413407ed8fdb7a8e81de918f90a9c36c5dbecd33008f9dd34b028831","abstract_canon_sha256":"2a6ee33af98f20306a7fe5689d290ccf583fd16fe22682fa445c93f4c07df1d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:21.906588Z","signature_b64":"l/81ZOXUmLDf5Y/6kpmF8aEhh4m1c65zw1di+RGk1gIDP9J1RxZpXsTdsIKCid0u3DWxTMj122nVrxWzeKtZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4be256ffe1260fad68a198f5b6ef5c640e56490c79d4b8e0313903dd5f71a16","last_reissued_at":"2026-05-18T02:32:21.906054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:21.906054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Chain Pair Simplification Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Binhai Zhu, Chenglin Fan, Matthew J. Katz, Omrit Filtser, Tim Wylie","submitted_at":"2014-09-08T18:37:29Z","abstract_excerpt":"The problem of efficiently computing and visualizing the structural resemblance between a pair of protein backbones in 3D has led Bereg et al. to pose the Chain Pair Simplification problem (CPS). In this problem, given two polygonal chains $A$ and $B$ of lengths $m$ and $n$, respectively, one needs to simplify them simultaneously, such that each of the resulting simplified chains, $A'$ and $B'$, is of length at most $k$ and the discrete \\frechet\\ distance between $A'$ and $B'$ is at most $\\delta$, where $k$ and $\\delta$ are given parameters.\n  In this paper we study the complexity of CPS under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2457","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":"1409.2457","created_at":"2026-05-18T02:32:21.906133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2457v2","created_at":"2026-05-18T02:32:21.906133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2457","created_at":"2026-05-18T02:32:21.906133+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S7CK376CJQP","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S7CK376CJQPVVUK","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S7CK376","created_at":"2026-05-18T12:28:14.216126+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/4S7CK376CJQPVVUKDGHVW3XVYZ","json":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ.json","graph_json":"https://pith.science/api/pith-number/4S7CK376CJQPVVUKDGHVW3XVYZ/graph.json","events_json":"https://pith.science/api/pith-number/4S7CK376CJQPVVUKDGHVW3XVYZ/events.json","paper":"https://pith.science/paper/4S7CK376"},"agent_actions":{"view_html":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ","download_json":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ.json","view_paper":"https://pith.science/paper/4S7CK376","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2457&json=true","fetch_graph":"https://pith.science/api/pith-number/4S7CK376CJQPVVUKDGHVW3XVYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4S7CK376CJQPVVUKDGHVW3XVYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/action/storage_attestation","attest_author":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/action/author_attestation","sign_citation":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/action/citation_signature","submit_replication":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/action/replication_record"}},"created_at":"2026-05-18T02:32:21.906133+00:00","updated_at":"2026-05-18T02:32:21.906133+00:00"}