{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CVFYWBMY4LNYY5YTXLVOYTM5OO","short_pith_number":"pith:CVFYWBMY","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"},"canonical_sha256":"154b8b0598e2db8c7713baeaec4d9d73b3b4641024ab52ab398eff6f69b638ff","source":{"kind":"arxiv","id":"1406.5778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5778","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5778v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5778","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"CVFYWBMY4LNY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CVFYWBMY4LNYY5YT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CVFYWBMY","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CVFYWBMY4LNYY5YTXLVOYTM5OO","target":"record","payload":{"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"},"canonical_sha256":"154b8b0598e2db8c7713baeaec4d9d73b3b4641024ab52ab398eff6f69b638ff","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"},"source_kind":"arxiv","source_id":"1406.5778","source_version":1,"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:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yiM2IcE9lr1RCeo7So64JvP2h45ImP/Hrn2uG2lNY5LKHo4j/abQLLsX34d5LATFh+pGoR8o8GJa4IABOZrzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:38:38.009292Z"},"content_sha256":"f4e2284982b688559df7920f6467512e1b9d6559fd3dfc9b1e77322903f38612","schema_version":"1.0","event_id":"sha256:f4e2284982b688559df7920f6467512e1b9d6559fd3dfc9b1e77322903f38612"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CVFYWBMY4LNYY5YTXLVOYTM5OO","target":"graph","payload":{"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"},"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:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJR/EEm6LUZbWKCfUnU/5icOtaCE6gJfqWKjl62+2nHH03HdnM1DtJ10mNXD20R1kNhuRReHbwp7P4A/Zru2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:38:38.009991Z"},"content_sha256":"de0e2dde328771fdf53096b6893967f52074cd9005c0414147756911f123566c","schema_version":"1.0","event_id":"sha256:de0e2dde328771fdf53096b6893967f52074cd9005c0414147756911f123566c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/bundle.json","state_url":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/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-08T09:38:38Z","links":{"resolver":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO","bundle":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/bundle.json","state":"https://pith.science/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVFYWBMY4LNYY5YTXLVOYTM5OO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CVFYWBMY4LNYY5YTXLVOYTM5OO","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":"9021f6cff7906ea38ec3d87684d17fa44f883e13538df61b78eea11cc34dccb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-22T22:32:14Z","title_canon_sha256":"1ef09aa0fc62f2b804f35e2b4b515c1475b677d131efcf01c519d2ca7c796348"},"schema_version":"1.0","source":{"id":"1406.5778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5778","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5778v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5778","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"CVFYWBMY4LNY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CVFYWBMY4LNYY5YT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CVFYWBMY","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:de0e2dde328771fdf53096b6893967f52074cd9005c0414147756911f123566c","target":"graph","created_at":"2026-05-18T02:49:10Z","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":"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.","authors_text":"Sariel Har-Peled, Subhro Roy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-22T22:32:14Z","title":"Approximating the Maximum Overlap of Polygons under Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5778","kind":"arxiv","version":1},"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:f4e2284982b688559df7920f6467512e1b9d6559fd3dfc9b1e77322903f38612","target":"record","created_at":"2026-05-18T02:49:10Z","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":"9021f6cff7906ea38ec3d87684d17fa44f883e13538df61b78eea11cc34dccb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-22T22:32:14Z","title_canon_sha256":"1ef09aa0fc62f2b804f35e2b4b515c1475b677d131efcf01c519d2ca7c796348"},"schema_version":"1.0","source":{"id":"1406.5778","kind":"arxiv","version":1}},"canonical_sha256":"154b8b0598e2db8c7713baeaec4d9d73b3b4641024ab52ab398eff6f69b638ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"154b8b0598e2db8c7713baeaec4d9d73b3b4641024ab52ab398eff6f69b638ff","first_computed_at":"2026-05-18T02:49:10.768022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:10.768022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wJntAU5rNlSBPxFitZUOyV5HjRQ8BxDlCakRkQOJJSWjN00dkxoqsZH3CNecy+4oddsPMbwO2bqKfPuJF0FsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:10.768441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4e2284982b688559df7920f6467512e1b9d6559fd3dfc9b1e77322903f38612","sha256:de0e2dde328771fdf53096b6893967f52074cd9005c0414147756911f123566c"],"state_sha256":"b905a7aeaedab9192c683025ce1f0564ef3b04fd99940aa85a657c5c8608ca2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvoR4cXz+KAuWAB1ebP2sIWqSDPHHT/uEVAlSsBZaFXu9vX2Qurfg7h4zMtuM8MpUzB3IzgmLwUrHAwoQ1BSCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:38:38.013655Z","bundle_sha256":"be409cd74e2d30e3df9af59988aa724667a427b3c40bd8b2c088a3c9dac6a0df"}}