{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4PJGC4UKFDKL2WXLYU5A6CF2XU","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":"06d0a765cf6ba18e4e8bcc1efc19c80c55fc196fb07bb3d72e12650e4b10d246","cross_cats_sorted":["cs.DS","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-05T12:54:07Z","title_canon_sha256":"8c05a8f27afd4e97ac750d001c54a64ed0930645dba590619b37a706393a8277"},"schema_version":"1.0","source":{"id":"1406.1368","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1368","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1368v3","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1368","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"4PJGC4UKFDKL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4PJGC4UKFDKL2WXL","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4PJGC4UK","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:ba29f9680f4e4e98faa5d0d0e42b8992efbb74cab8bdabccc87d3220188d6d3e","target":"graph","created_at":"2026-05-18T00:32:55Z","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":"We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\\varepsilon)$-approximation algorithm for this problem: in $O(n( \\log^2 n + (1/\\varepsilon^3) \\log n + 1/\\varepsilon^4))$ time we find a convex polygon contained in $P$ that, with probability at least $2/3$, has area at least $(1-\\varepsilon)$ times the area of an optimal solution. We also obtain similar results for the variant of computing a convex polygon inside $P$ with maximum perimeter.\n  To ach","authors_text":"Jan Kyn\\v{c}l, Josef Cibulka, Maria Saumell, Pavel Valtr, Sergio Cabello","cross_cats":["cs.DS","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-05T12:54:07Z","title":"Peeling potatoes near-optimally in near-linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1368","kind":"arxiv","version":3},"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:d4b27f9f6406d38c8608721a9bc27be2b997de4fc50e85f64071b26ffeb78bfa","target":"record","created_at":"2026-05-18T00:32:55Z","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":"06d0a765cf6ba18e4e8bcc1efc19c80c55fc196fb07bb3d72e12650e4b10d246","cross_cats_sorted":["cs.DS","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-05T12:54:07Z","title_canon_sha256":"8c05a8f27afd4e97ac750d001c54a64ed0930645dba590619b37a706393a8277"},"schema_version":"1.0","source":{"id":"1406.1368","kind":"arxiv","version":3}},"canonical_sha256":"e3d261728a28d4bd5aebc53a0f08babd1fe69e433df62d0f2f0c71b75e042cbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3d261728a28d4bd5aebc53a0f08babd1fe69e433df62d0f2f0c71b75e042cbc","first_computed_at":"2026-05-18T00:32:55.818346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:55.818346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKX+wRz1kwcrI5CX9r16aMkb9GPH/qwTMe0Zst8VgiCud4uvbwWEoaeX5Q0opyNmnC8UM2Mvr3gd8kvIcSpNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:55.819285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1368","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4b27f9f6406d38c8608721a9bc27be2b997de4fc50e85f64071b26ffeb78bfa","sha256:ba29f9680f4e4e98faa5d0d0e42b8992efbb74cab8bdabccc87d3220188d6d3e"],"state_sha256":"ef6952c64b47e0ddaf126e139c10f9939bf0cfc8ae34e779216742878a443c43"}