{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2LYVRN6JL5EOOBNJKSPQFYA7NJ","short_pith_number":"pith:2LYVRN6J","schema_version":"1.0","canonical_sha256":"d2f158b7c95f48e705a9549f02e01f6a6ab6a3eb50c6ef5e3ef2e74b6dcea2f4","source":{"kind":"arxiv","id":"1308.5550","version":1},"attestation_state":"computed","paper":{"title":"Fitting Voronoi Diagrams to Planar Tesselations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dannier Trinchet, Greg Aloupis, Guillermo Pineda-Villavicencio, Hebert P\\'erez-Ros\\'es, Perouz Taslakian","submitted_at":"2013-08-26T12:00:54Z","abstract_excerpt":"Given a tesselation of the plane, defined by a planar straight-line graph $G$, we want to find a minimal set $S$ of points in the plane, such that the Voronoi diagram associated with $S$ \"fits\" \\ $G$. This is the Generalized Inverse Voronoi Problem (GIVP), defined in \\cite{Trin07} and rediscovered recently in \\cite{Baner12}. Here we give an algorithm that solves this problem with a number of points that is linear in the size of $G$, assuming that the smallest angle in $G$ is constant."},"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":"1308.5550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-26T12:00:54Z","cross_cats_sorted":[],"title_canon_sha256":"868c7d570251ba4b20f86af46f07a455022e457e042d395b8d639b400fc9262a","abstract_canon_sha256":"6dd7abcfca05679d3b1cc1168ab43878b9c942193a9c4688828a1ad7f7afc973"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:04.162191Z","signature_b64":"BAnb8NJT0nlq1e/xLcUJoR9wyimcu+6DiidVwTGa7cBh5T/0nIAUzLd4i4Q7V3HXQxHnC9TQGkXL48FEiqnXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2f158b7c95f48e705a9549f02e01f6a6ab6a3eb50c6ef5e3ef2e74b6dcea2f4","last_reissued_at":"2026-05-18T03:15:04.161295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:04.161295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fitting Voronoi Diagrams to Planar Tesselations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dannier Trinchet, Greg Aloupis, Guillermo Pineda-Villavicencio, Hebert P\\'erez-Ros\\'es, Perouz Taslakian","submitted_at":"2013-08-26T12:00:54Z","abstract_excerpt":"Given a tesselation of the plane, defined by a planar straight-line graph $G$, we want to find a minimal set $S$ of points in the plane, such that the Voronoi diagram associated with $S$ \"fits\" \\ $G$. This is the Generalized Inverse Voronoi Problem (GIVP), defined in \\cite{Trin07} and rediscovered recently in \\cite{Baner12}. Here we give an algorithm that solves this problem with a number of points that is linear in the size of $G$, assuming that the smallest angle in $G$ is constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5550","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":"1308.5550","created_at":"2026-05-18T03:15:04.161460+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5550v1","created_at":"2026-05-18T03:15:04.161460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5550","created_at":"2026-05-18T03:15:04.161460+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LYVRN6JL5EO","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LYVRN6JL5EOOBNJ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LYVRN6J","created_at":"2026-05-18T12:27:30.460161+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/2LYVRN6JL5EOOBNJKSPQFYA7NJ","json":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ.json","graph_json":"https://pith.science/api/pith-number/2LYVRN6JL5EOOBNJKSPQFYA7NJ/graph.json","events_json":"https://pith.science/api/pith-number/2LYVRN6JL5EOOBNJKSPQFYA7NJ/events.json","paper":"https://pith.science/paper/2LYVRN6J"},"agent_actions":{"view_html":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ","download_json":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ.json","view_paper":"https://pith.science/paper/2LYVRN6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5550&json=true","fetch_graph":"https://pith.science/api/pith-number/2LYVRN6JL5EOOBNJKSPQFYA7NJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2LYVRN6JL5EOOBNJKSPQFYA7NJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ/action/storage_attestation","attest_author":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ/action/author_attestation","sign_citation":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ/action/citation_signature","submit_replication":"https://pith.science/pith/2LYVRN6JL5EOOBNJKSPQFYA7NJ/action/replication_record"}},"created_at":"2026-05-18T03:15:04.161460+00:00","updated_at":"2026-05-18T03:15:04.161460+00:00"}