{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4S7CK376CJQPVVUKDGHVW3XVYZ","short_pith_number":"pith:4S7CK376","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"},"canonical_sha256":"e4be256ffe1260fad68a198f5b6ef5c640e56490c79d4b8e0313903dd5f71a16","source":{"kind":"arxiv","id":"1409.2457","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2457","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2457v2","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2457","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"4S7CK376CJQP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4S7CK376CJQPVVUK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4S7CK376","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4S7CK376CJQPVVUKDGHVW3XVYZ","target":"record","payload":{"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"},"canonical_sha256":"e4be256ffe1260fad68a198f5b6ef5c640e56490c79d4b8e0313903dd5f71a16","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"},"source_kind":"arxiv","source_id":"1409.2457","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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLSNTxGOD86E28lj3OP7hlw/cc67IGr09jH56OZXWyAWGQPrrq2uV6jvQDP3Up3dxgMCl11pVgAiMJlY+O76Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:57:09.159072Z"},"content_sha256":"794c5a84d014108ed52545e14660e87d75eb56ffd15a91e35b5a02fc59a22dd6","schema_version":"1.0","event_id":"sha256:794c5a84d014108ed52545e14660e87d75eb56ffd15a91e35b5a02fc59a22dd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4S7CK376CJQPVVUKDGHVW3XVYZ","target":"graph","payload":{"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"},"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-18T02:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z10FogfYXfvaDwg5NbUAlIU7/T2b9N83FtF9U7AnZACR2Nr+pdhJjkbt5QEXFD3iR9o8sM4VsKDYL4LtdKaUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:57:09.159699Z"},"content_sha256":"6672383924a45ff46cfb186c2ce677a00d8adf4ec6b7130a97a5117fd0bafa05","schema_version":"1.0","event_id":"sha256:6672383924a45ff46cfb186c2ce677a00d8adf4ec6b7130a97a5117fd0bafa05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/bundle.json","state_url":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/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-06-02T19:57:09Z","links":{"resolver":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ","bundle":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/bundle.json","state":"https://pith.science/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4S7CK376CJQPVVUKDGHVW3XVYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4S7CK376CJQPVVUKDGHVW3XVYZ","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":"2a6ee33af98f20306a7fe5689d290ccf583fd16fe22682fa445c93f4c07df1d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-08T18:37:29Z","title_canon_sha256":"a756c047413407ed8fdb7a8e81de918f90a9c36c5dbecd33008f9dd34b028831"},"schema_version":"1.0","source":{"id":"1409.2457","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2457","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2457v2","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2457","created_at":"2026-05-18T02:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"4S7CK376CJQP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4S7CK376CJQPVVUK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4S7CK376","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:6672383924a45ff46cfb186c2ce677a00d8adf4ec6b7130a97a5117fd0bafa05","target":"graph","created_at":"2026-05-18T02:32:21Z","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 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","authors_text":"Binhai Zhu, Chenglin Fan, Matthew J. Katz, Omrit Filtser, Tim Wylie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-08T18:37:29Z","title":"On the Chain Pair Simplification Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2457","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:794c5a84d014108ed52545e14660e87d75eb56ffd15a91e35b5a02fc59a22dd6","target":"record","created_at":"2026-05-18T02:32:21Z","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":"2a6ee33af98f20306a7fe5689d290ccf583fd16fe22682fa445c93f4c07df1d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-09-08T18:37:29Z","title_canon_sha256":"a756c047413407ed8fdb7a8e81de918f90a9c36c5dbecd33008f9dd34b028831"},"schema_version":"1.0","source":{"id":"1409.2457","kind":"arxiv","version":2}},"canonical_sha256":"e4be256ffe1260fad68a198f5b6ef5c640e56490c79d4b8e0313903dd5f71a16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4be256ffe1260fad68a198f5b6ef5c640e56490c79d4b8e0313903dd5f71a16","first_computed_at":"2026-05-18T02:32:21.906054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:21.906054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/81ZOXUmLDf5Y/6kpmF8aEhh4m1c65zw1di+RGk1gIDP9J1RxZpXsTdsIKCid0u3DWxTMj122nVrxWzeKtZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:21.906588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2457","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:794c5a84d014108ed52545e14660e87d75eb56ffd15a91e35b5a02fc59a22dd6","sha256:6672383924a45ff46cfb186c2ce677a00d8adf4ec6b7130a97a5117fd0bafa05"],"state_sha256":"2629673e4356e18eb8546027722107f46139b8334f907e7a807dc1d7c1c2d64e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWJmuM/EwDfaWMMi86Xs0Xgm3mDdlYIoHcrlbb02lp35z1i2qSofXdOJk/PlLAvWrfpqjhFSmCvA6Lz7vJACDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:57:09.163483Z","bundle_sha256":"d6f0f611eae3ac2d1e9852f59acd3f0703066e9fef8186d3a853379799f88ead"}}