{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:O7OIIHJFWPPNJGWMDB5GWQONCQ","short_pith_number":"pith:O7OIIHJF","schema_version":"1.0","canonical_sha256":"77dc841d25b3ded49acc187a6b41cd142f48421ca930ba8c0abc283b497101c3","source":{"kind":"arxiv","id":"1901.04738","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms to Test Digital Convexity","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":"2019-01-15T10:02:33Z","abstract_excerpt":"A set $S \\subset \\mathbb{Z}^d$ is digital convex if $conv(S) \\cap \\mathbb{Z}^d = S$, where $conv(S)$ denotes the convex hull of $S$. In this paper, we consider the algorithmic problem of testing whether a given set $S$ of $n$ lattice points is digital convex. Although convex hull computation requires $\\Omega(n \\log n)$ time even for dimension $d = 2$, we provide an algorithm for testing the digital convexity of $S\\subset \\mathbb{Z}^2$ in $O(n + h \\log r)$ time, where $h$ is the number of edges of the convex hull and $r$ is the diameter of $S$. This main result is obtained by proving that if $S"},"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":"1901.04738","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2019-01-15T10:02:33Z","cross_cats_sorted":[],"title_canon_sha256":"53fde5c39a319ff1858d5abe8429aded961740ed4c793f8bbebf85c0a76b55fd","abstract_canon_sha256":"749dd25d79f06e52ab5285de80061d2d9144c6adb8666d92ec227b069511f15e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:21.883856Z","signature_b64":"BSie4TqPCcv9agnJa4adMfve6dXXuFavMotRXJKy6zYO5uph0SWw3ro1FMw+byUrWi4PGQVu+QJRRNdT2mpxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77dc841d25b3ded49acc187a6b41cd142f48421ca930ba8c0abc283b497101c3","last_reissued_at":"2026-05-17T23:56:21.883223Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:21.883223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms to Test Digital Convexity","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":"2019-01-15T10:02:33Z","abstract_excerpt":"A set $S \\subset \\mathbb{Z}^d$ is digital convex if $conv(S) \\cap \\mathbb{Z}^d = S$, where $conv(S)$ denotes the convex hull of $S$. In this paper, we consider the algorithmic problem of testing whether a given set $S$ of $n$ lattice points is digital convex. Although convex hull computation requires $\\Omega(n \\log n)$ time even for dimension $d = 2$, we provide an algorithm for testing the digital convexity of $S\\subset \\mathbb{Z}^2$ in $O(n + h \\log r)$ time, where $h$ is the number of edges of the convex hull and $r$ is the diameter of $S$. This main result is obtained by proving that if $S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04738","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.04738","created_at":"2026-05-17T23:56:21.883323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04738v1","created_at":"2026-05-17T23:56:21.883323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04738","created_at":"2026-05-17T23:56:21.883323+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7OIIHJFWPPN","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7OIIHJFWPPNJGWM","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7OIIHJF","created_at":"2026-05-18T12:33:24.271573+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/O7OIIHJFWPPNJGWMDB5GWQONCQ","json":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ.json","graph_json":"https://pith.science/api/pith-number/O7OIIHJFWPPNJGWMDB5GWQONCQ/graph.json","events_json":"https://pith.science/api/pith-number/O7OIIHJFWPPNJGWMDB5GWQONCQ/events.json","paper":"https://pith.science/paper/O7OIIHJF"},"agent_actions":{"view_html":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ","download_json":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ.json","view_paper":"https://pith.science/paper/O7OIIHJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04738&json=true","fetch_graph":"https://pith.science/api/pith-number/O7OIIHJFWPPNJGWMDB5GWQONCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/O7OIIHJFWPPNJGWMDB5GWQONCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ/action/storage_attestation","attest_author":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ/action/author_attestation","sign_citation":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ/action/citation_signature","submit_replication":"https://pith.science/pith/O7OIIHJFWPPNJGWMDB5GWQONCQ/action/replication_record"}},"created_at":"2026-05-17T23:56:21.883323+00:00","updated_at":"2026-05-17T23:56:21.883323+00:00"}