{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OZ7UAY3UFEKPVQMU5MBP5BY453","short_pith_number":"pith:OZ7UAY3U","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"},"canonical_sha256":"767f4063742914fac194eb02fe871ceee4b1af673b68f6352a23e0b9c6a54044","source":{"kind":"arxiv","id":"1812.05410","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05410","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05410v2","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05410","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"OZ7UAY3UFEKP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZ7UAY3UFEKPVQMU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZ7UAY3U","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OZ7UAY3UFEKPVQMU5MBP5BY453","target":"record","payload":{"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"},"canonical_sha256":"767f4063742914fac194eb02fe871ceee4b1af673b68f6352a23e0b9c6a54044","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"},"source_kind":"arxiv","source_id":"1812.05410","source_version":2,"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-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9AYVNaAu6Tw+5T+tQnU2VissfWX4k9bL3+0C9xFRdI4DnJ7IKQ7EMfEEpf0MTRcmyYMr0Ar0vxiOxEBeL6yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T15:13:06.151562Z"},"content_sha256":"6f3684b40432381f010d2f389fd998a32973ef91b47e5adea76ec253177b4916","schema_version":"1.0","event_id":"sha256:6f3684b40432381f010d2f389fd998a32973ef91b47e5adea76ec253177b4916"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OZ7UAY3UFEKPVQMU5MBP5BY453","target":"graph","payload":{"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"},"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-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NSmrvOVONmBITeZY7R7YwzD9IecsN4lgBqGhyox5fwVK6qnMRJQnG1kibJLoSjfFGG/prLU9MIAfqt5wTOuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T15:13:06.151902Z"},"content_sha256":"6144928980bd6991a361aab575e7070f4e8355c679d07d717da90966357c3a18","schema_version":"1.0","event_id":"sha256:6144928980bd6991a361aab575e7070f4e8355c679d07d717da90966357c3a18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/bundle.json","state_url":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/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-07-02T15:13:06Z","links":{"resolver":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453","bundle":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/bundle.json","state":"https://pith.science/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZ7UAY3UFEKPVQMU5MBP5BY453/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OZ7UAY3UFEKPVQMU5MBP5BY453","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":"8036c03d9ff019eff73a9a5e112e5cd8a142e0dfd92651654a8c843f41a889e9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-12-13T13:19:40Z","title_canon_sha256":"8726be03f7158ac444b71e586dbba6fbc37e4ba20684e8937d1a389cfc846971"},"schema_version":"1.0","source":{"id":"1812.05410","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05410","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05410v2","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05410","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"OZ7UAY3UFEKP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZ7UAY3UFEKPVQMU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZ7UAY3U","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:6144928980bd6991a361aab575e7070f4e8355c679d07d717da90966357c3a18","target":"graph","created_at":"2026-05-17T23:42:42Z","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":"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","authors_text":"Guilherme D. da Fonseca, Lo\\\"ic Crombez, Yan G\\'erard","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-12-13T13:19:40Z","title":"Peeling Digital Potatoes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05410","kind":"arxiv","version":2},"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:6f3684b40432381f010d2f389fd998a32973ef91b47e5adea76ec253177b4916","target":"record","created_at":"2026-05-17T23:42:42Z","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":"8036c03d9ff019eff73a9a5e112e5cd8a142e0dfd92651654a8c843f41a889e9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2018-12-13T13:19:40Z","title_canon_sha256":"8726be03f7158ac444b71e586dbba6fbc37e4ba20684e8937d1a389cfc846971"},"schema_version":"1.0","source":{"id":"1812.05410","kind":"arxiv","version":2}},"canonical_sha256":"767f4063742914fac194eb02fe871ceee4b1af673b68f6352a23e0b9c6a54044","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"767f4063742914fac194eb02fe871ceee4b1af673b68f6352a23e0b9c6a54044","first_computed_at":"2026-05-17T23:42:42.636970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:42.636970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LifGqvPDOTaweB337UYkkaFZyxcmLB3gbM98wuTuq089YVZv9UuU+GiFH/Daufg6ML08i67zAEQLFDqcYTO9Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:42.637756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05410","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f3684b40432381f010d2f389fd998a32973ef91b47e5adea76ec253177b4916","sha256:6144928980bd6991a361aab575e7070f4e8355c679d07d717da90966357c3a18"],"state_sha256":"10dda056c014a39f38a8aca90f5aba135235209694cbfce8d7b5759e753ecdd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wV9yc/5mZdJqWZUAWo6YEeN2ZQcZS1Ic+h1dDdTc8g3oWRCD99MokZDnvUk8JNRsnRGlvM6qGkbBiGiwlWhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T15:13:06.153740Z","bundle_sha256":"450799bd04f8bbb833dd5c095a2ffbfa75e84f0a6982bdfebcf065905eac9b9c"}}