{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4PJGC4UKFDKL2WXLYU5A6CF2XU","short_pith_number":"pith:4PJGC4UK","schema_version":"1.0","canonical_sha256":"e3d261728a28d4bd5aebc53a0f08babd1fe69e433df62d0f2f0c71b75e042cbc","source":{"kind":"arxiv","id":"1406.1368","version":3},"attestation_state":"computed","paper":{"title":"Peeling potatoes near-optimally in near-linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.MG"],"primary_cat":"cs.CG","authors_text":"Jan Kyn\\v{c}l, Josef Cibulka, Maria Saumell, Pavel Valtr, Sergio Cabello","submitted_at":"2014-06-05T12:54:07Z","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"},"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.1368","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-05T12:54:07Z","cross_cats_sorted":["cs.DS","math.MG"],"title_canon_sha256":"8c05a8f27afd4e97ac750d001c54a64ed0930645dba590619b37a706393a8277","abstract_canon_sha256":"06d0a765cf6ba18e4e8bcc1efc19c80c55fc196fb07bb3d72e12650e4b10d246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:55.819285Z","signature_b64":"ZKX+wRz1kwcrI5CX9r16aMkb9GPH/qwTMe0Zst8VgiCud4uvbwWEoaeX5Q0opyNmnC8UM2Mvr3gd8kvIcSpNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d261728a28d4bd5aebc53a0f08babd1fe69e433df62d0f2f0c71b75e042cbc","last_reissued_at":"2026-05-18T00:32:55.818346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:55.818346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Peeling potatoes near-optimally in near-linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.MG"],"primary_cat":"cs.CG","authors_text":"Jan Kyn\\v{c}l, Josef Cibulka, Maria Saumell, Pavel Valtr, Sergio Cabello","submitted_at":"2014-06-05T12:54:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1368","kind":"arxiv","version":3},"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.1368","created_at":"2026-05-18T00:32:55.818484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1368v3","created_at":"2026-05-18T00:32:55.818484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1368","created_at":"2026-05-18T00:32:55.818484+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PJGC4UKFDKL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PJGC4UKFDKL2WXL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PJGC4UK","created_at":"2026-05-18T12:28:14.216126+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/4PJGC4UKFDKL2WXLYU5A6CF2XU","json":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU.json","graph_json":"https://pith.science/api/pith-number/4PJGC4UKFDKL2WXLYU5A6CF2XU/graph.json","events_json":"https://pith.science/api/pith-number/4PJGC4UKFDKL2WXLYU5A6CF2XU/events.json","paper":"https://pith.science/paper/4PJGC4UK"},"agent_actions":{"view_html":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU","download_json":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU.json","view_paper":"https://pith.science/paper/4PJGC4UK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1368&json=true","fetch_graph":"https://pith.science/api/pith-number/4PJGC4UKFDKL2WXLYU5A6CF2XU/graph.json","fetch_events":"https://pith.science/api/pith-number/4PJGC4UKFDKL2WXLYU5A6CF2XU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU/action/storage_attestation","attest_author":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU/action/author_attestation","sign_citation":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU/action/citation_signature","submit_replication":"https://pith.science/pith/4PJGC4UKFDKL2WXLYU5A6CF2XU/action/replication_record"}},"created_at":"2026-05-18T00:32:55.818484+00:00","updated_at":"2026-05-18T00:32:55.818484+00:00"}