{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OZ7UAY3UFEKPVQMU5MBP5BY453","short_pith_number":"pith:OZ7UAY3U","schema_version":"1.0","canonical_sha256":"767f4063742914fac194eb02fe871ceee4b1af673b68f6352a23e0b9c6a54044","source":{"kind":"arxiv","id":"1812.05410","version":2},"attestation_state":"computed","paper":{"title":"Peeling Digital Potatoes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Guilherme D. da Fonseca, Lo\\\"ic Crombez, Yan G\\'erard","submitted_at":"2018-12-13T13:19:40Z","abstract_excerpt":"The potato-peeling problem (also known as convex skull) is a fundamental computational geometry problem and the fastest algorithm to date runs in $O(n^8)$ time for a polygon with $n$ vertices that may have holes. In this paper, we consider a digital version of the problem. A set $K \\subset \\mathbb{Z}^2$ is digital convex if $conv(K) \\cap \\mathbb{Z}^2 = K$, where $conv(K)$ denotes the convex hull of $K$. Given a set $S$ of $n$ lattice points, we present polynomial time algorithms to the problems of finding the largest digital convex subset $K$ of $S$ (digital potato-peeling problem) and the lar"},"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":"1812.05410","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-12-13T13:19:40Z","cross_cats_sorted":[],"title_canon_sha256":"8726be03f7158ac444b71e586dbba6fbc37e4ba20684e8937d1a389cfc846971","abstract_canon_sha256":"8036c03d9ff019eff73a9a5e112e5cd8a142e0dfd92651654a8c843f41a889e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:42.637756Z","signature_b64":"LifGqvPDOTaweB337UYkkaFZyxcmLB3gbM98wuTuq089YVZv9UuU+GiFH/Daufg6ML08i67zAEQLFDqcYTO9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"767f4063742914fac194eb02fe871ceee4b1af673b68f6352a23e0b9c6a54044","last_reissued_at":"2026-05-17T23:42:42.636970Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:42.636970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Peeling Digital Potatoes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Guilherme D. da Fonseca, Lo\\\"ic Crombez, Yan G\\'erard","submitted_at":"2018-12-13T13:19:40Z","abstract_excerpt":"The potato-peeling problem (also known as convex skull) is a fundamental computational geometry problem and the fastest algorithm to date runs in $O(n^8)$ time for a polygon with $n$ vertices that may have holes. In this paper, we consider a digital version of the problem. A set $K \\subset \\mathbb{Z}^2$ is digital convex if $conv(K) \\cap \\mathbb{Z}^2 = K$, where $conv(K)$ denotes the convex hull of $K$. Given a set $S$ of $n$ lattice points, we present polynomial time algorithms to the problems of finding the largest digital convex subset $K$ of $S$ (digital potato-peeling problem) and the lar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05410","kind":"arxiv","version":2},"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":"1812.05410","created_at":"2026-05-17T23:42:42.637098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05410v2","created_at":"2026-05-17T23:42:42.637098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05410","created_at":"2026-05-17T23:42:42.637098+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZ7UAY3UFEKP","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZ7UAY3UFEKPVQMU","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZ7UAY3U","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17983","citing_title":"Peeling Rotten Potatoes for a Faster Approximation of Convex Cover","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453","json":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453.json","graph_json":"https://pith.science/api/pith-number/OZ7UAY3UFEKPVQMU5MBP5BY453/graph.json","events_json":"https://pith.science/api/pith-number/OZ7UAY3UFEKPVQMU5MBP5BY453/events.json","paper":"https://pith.science/paper/OZ7UAY3U"},"agent_actions":{"view_html":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453","download_json":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453.json","view_paper":"https://pith.science/paper/OZ7UAY3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05410&json=true","fetch_graph":"https://pith.science/api/pith-number/OZ7UAY3UFEKPVQMU5MBP5BY453/graph.json","fetch_events":"https://pith.science/api/pith-number/OZ7UAY3UFEKPVQMU5MBP5BY453/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/action/storage_attestation","attest_author":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/action/author_attestation","sign_citation":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/action/citation_signature","submit_replication":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/action/replication_record"}},"created_at":"2026-05-17T23:42:42.637098+00:00","updated_at":"2026-05-17T23:42:42.637098+00:00"}