{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CVFYWBMY4LNYY5YTXLVOYTM5OO","short_pith_number":"pith:CVFYWBMY","schema_version":"1.0","canonical_sha256":"154b8b0598e2db8c7713baeaec4d9d73b3b4641024ab52ab398eff6f69b638ff","source":{"kind":"arxiv","id":"1406.5778","version":1},"attestation_state":"computed","paper":{"title":"Approximating the Maximum Overlap of Polygons under Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Subhro Roy","submitted_at":"2014-06-22T22:32:14Z","abstract_excerpt":"Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which maximizes its area of overlap with $P$. Our algorithm runs in $O(c n)$ time, where $c$ is a constant that depends only on $k$ and $\\varepsilon$.\n  This suggest that for polygons that are \"close\" to being convex, the problem can be solved (approximately), in near linear time."},"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":"1406.5778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-22T22:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"1ef09aa0fc62f2b804f35e2b4b515c1475b677d131efcf01c519d2ca7c796348","abstract_canon_sha256":"9021f6cff7906ea38ec3d87684d17fa44f883e13538df61b78eea11cc34dccb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:10.768441Z","signature_b64":"wJntAU5rNlSBPxFitZUOyV5HjRQ8BxDlCakRkQOJJSWjN00dkxoqsZH3CNecy+4oddsPMbwO2bqKfPuJF0FsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"154b8b0598e2db8c7713baeaec4d9d73b3b4641024ab52ab398eff6f69b638ff","last_reissued_at":"2026-05-18T02:49:10.768022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:10.768022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating the Maximum Overlap of Polygons under Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled, Subhro Roy","submitted_at":"2014-06-22T22:32:14Z","abstract_excerpt":"Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which maximizes its area of overlap with $P$. Our algorithm runs in $O(c n)$ time, where $c$ is a constant that depends only on $k$ and $\\varepsilon$.\n  This suggest that for polygons that are \"close\" to being convex, the problem can be solved (approximately), in near linear time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5778","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":"1406.5778","created_at":"2026-05-18T02:49:10.768084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5778v1","created_at":"2026-05-18T02:49:10.768084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5778","created_at":"2026-05-18T02:49:10.768084+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVFYWBMY4LNY","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVFYWBMY4LNYY5YT","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVFYWBMY","created_at":"2026-05-18T12:28:25.294606+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/CVFYWBMY4LNYY5YTXLVOYTM5OO","json":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO.json","graph_json":"https://pith.science/api/pith-number/CVFYWBMY4LNYY5YTXLVOYTM5OO/graph.json","events_json":"https://pith.science/api/pith-number/CVFYWBMY4LNYY5YTXLVOYTM5OO/events.json","paper":"https://pith.science/paper/CVFYWBMY"},"agent_actions":{"view_html":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO","download_json":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO.json","view_paper":"https://pith.science/paper/CVFYWBMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5778&json=true","fetch_graph":"https://pith.science/api/pith-number/CVFYWBMY4LNYY5YTXLVOYTM5OO/graph.json","fetch_events":"https://pith.science/api/pith-number/CVFYWBMY4LNYY5YTXLVOYTM5OO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/action/storage_attestation","attest_author":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/action/author_attestation","sign_citation":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/action/citation_signature","submit_replication":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/action/replication_record"}},"created_at":"2026-05-18T02:49:10.768084+00:00","updated_at":"2026-05-18T02:49:10.768084+00:00"}