{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RZRGFOU4MZM3OWQCZM4EDKHUAE","short_pith_number":"pith:RZRGFOU4","schema_version":"1.0","canonical_sha256":"8e6262ba9c6659b75a02cb3841a8f4010a641939b8af8e9a67a6484360bf4cd4","source":{"kind":"arxiv","id":"1112.1124","version":4},"attestation_state":"computed","paper":{"title":"Minimum Convex Partitions and Maximum Empty Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth, Sariel Har-Peled","submitted_at":"2011-12-05T23:44:08Z","abstract_excerpt":"Let $S$ be a set of $n$ points in $\\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\\lceil (n-1)/d\\rceil$ tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension $d\\geq 3$. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position. Establishing a tight lower bo"},"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":"1112.1124","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-05T23:44:08Z","cross_cats_sorted":[],"title_canon_sha256":"0a7b497d8aede56d975ad4b3cb13663f89716a3dbff75d89f6f3d2332d860bdf","abstract_canon_sha256":"66338c0d64bca99e578ae03d9afa8b056a58e71fc81ce72fda94d12830bd52ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:27.164548Z","signature_b64":"yIMvm7eV5EavK8HtCsh0LUXhDIo1dn3+okbCchE0FRLcsYLBoZpURsyZYlikZkZGxgbP5yu9KsuRGom2S9OQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e6262ba9c6659b75a02cb3841a8f4010a641939b8af8e9a67a6484360bf4cd4","last_reissued_at":"2026-05-18T03:00:27.163798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:27.163798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Convex Partitions and Maximum Empty Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth, Sariel Har-Peled","submitted_at":"2011-12-05T23:44:08Z","abstract_excerpt":"Let $S$ be a set of $n$ points in $\\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\\lceil (n-1)/d\\rceil$ tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension $d\\geq 3$. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position. Establishing a tight lower bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1124","kind":"arxiv","version":4},"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":"1112.1124","created_at":"2026-05-18T03:00:27.163908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1124v4","created_at":"2026-05-18T03:00:27.163908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1124","created_at":"2026-05-18T03:00:27.163908+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZRGFOU4MZM3","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZRGFOU4MZM3OWQC","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZRGFOU4","created_at":"2026-05-18T12:26:41.206345+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/RZRGFOU4MZM3OWQCZM4EDKHUAE","json":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE.json","graph_json":"https://pith.science/api/pith-number/RZRGFOU4MZM3OWQCZM4EDKHUAE/graph.json","events_json":"https://pith.science/api/pith-number/RZRGFOU4MZM3OWQCZM4EDKHUAE/events.json","paper":"https://pith.science/paper/RZRGFOU4"},"agent_actions":{"view_html":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE","download_json":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE.json","view_paper":"https://pith.science/paper/RZRGFOU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1124&json=true","fetch_graph":"https://pith.science/api/pith-number/RZRGFOU4MZM3OWQCZM4EDKHUAE/graph.json","fetch_events":"https://pith.science/api/pith-number/RZRGFOU4MZM3OWQCZM4EDKHUAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/action/storage_attestation","attest_author":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/action/author_attestation","sign_citation":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/action/citation_signature","submit_replication":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/action/replication_record"}},"created_at":"2026-05-18T03:00:27.163908+00:00","updated_at":"2026-05-18T03:00:27.163908+00:00"}