{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N33IQFBQHKTTCKQR5OERJG6QPL","short_pith_number":"pith:N33IQFBQ","schema_version":"1.0","canonical_sha256":"6ef68814303aa7312a11eb89149bd07aea5f342f05f6275e737b38b5e1f4555a","source":{"kind":"arxiv","id":"1607.06539","version":1},"attestation_state":"computed","paper":{"title":"An Interesting Gadget for Chain Pair Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Tim Wylie","submitted_at":"2016-07-22T02:07:17Z","abstract_excerpt":"In this paper we present an interesting gadget based on the chain pair simplification problem under the discrete Fr\\'echet distance (CPS-3F), which allows the construction of arbitrarily long paths that must be chosen in the simplification of the two curves. A pseudopolynomial time reduction from set partition is given as an example. For clarification, CPS-3F was recently shown to be in \\textbf{P}, and the reduction is merely to show how the gadget works."},"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":"1607.06539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-22T02:07:17Z","cross_cats_sorted":[],"title_canon_sha256":"3af81e27d0d7473ba3af482bad40fae1890c6293957b6df718f5ef1de2d4154d","abstract_canon_sha256":"a90c282eb2ab6c69e1c864585df2142c851816a1fca57edaccf090e8ed432483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:39.595893Z","signature_b64":"bOMQmBvQ89GZiikyEdESaw0ewsu6c2FQquk3UkCIILzO0eBfM6hpuZRV0U4jQxcX8RkUw4Ji2uVvbbeEGfUcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef68814303aa7312a11eb89149bd07aea5f342f05f6275e737b38b5e1f4555a","last_reissued_at":"2026-05-18T01:10:39.595402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:39.595402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Interesting Gadget for Chain Pair Simplification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Tim Wylie","submitted_at":"2016-07-22T02:07:17Z","abstract_excerpt":"In this paper we present an interesting gadget based on the chain pair simplification problem under the discrete Fr\\'echet distance (CPS-3F), which allows the construction of arbitrarily long paths that must be chosen in the simplification of the two curves. A pseudopolynomial time reduction from set partition is given as an example. For clarification, CPS-3F was recently shown to be in \\textbf{P}, and the reduction is merely to show how the gadget works."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06539","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":"1607.06539","created_at":"2026-05-18T01:10:39.595490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06539v1","created_at":"2026-05-18T01:10:39.595490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06539","created_at":"2026-05-18T01:10:39.595490+00:00"},{"alias_kind":"pith_short_12","alias_value":"N33IQFBQHKTT","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N33IQFBQHKTTCKQR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N33IQFBQ","created_at":"2026-05-18T12:30:32.724797+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/N33IQFBQHKTTCKQR5OERJG6QPL","json":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL.json","graph_json":"https://pith.science/api/pith-number/N33IQFBQHKTTCKQR5OERJG6QPL/graph.json","events_json":"https://pith.science/api/pith-number/N33IQFBQHKTTCKQR5OERJG6QPL/events.json","paper":"https://pith.science/paper/N33IQFBQ"},"agent_actions":{"view_html":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL","download_json":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL.json","view_paper":"https://pith.science/paper/N33IQFBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06539&json=true","fetch_graph":"https://pith.science/api/pith-number/N33IQFBQHKTTCKQR5OERJG6QPL/graph.json","fetch_events":"https://pith.science/api/pith-number/N33IQFBQHKTTCKQR5OERJG6QPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL/action/storage_attestation","attest_author":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL/action/author_attestation","sign_citation":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL/action/citation_signature","submit_replication":"https://pith.science/pith/N33IQFBQHKTTCKQR5OERJG6QPL/action/replication_record"}},"created_at":"2026-05-18T01:10:39.595490+00:00","updated_at":"2026-05-18T01:10:39.595490+00:00"}