{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RZRGFOU4MZM3OWQCZM4EDKHUAE","short_pith_number":"pith:RZRGFOU4","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"},"canonical_sha256":"8e6262ba9c6659b75a02cb3841a8f4010a641939b8af8e9a67a6484360bf4cd4","source":{"kind":"arxiv","id":"1112.1124","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1124","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1124v4","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1124","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"RZRGFOU4MZM3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZRGFOU4MZM3OWQC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZRGFOU4","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RZRGFOU4MZM3OWQCZM4EDKHUAE","target":"record","payload":{"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"},"canonical_sha256":"8e6262ba9c6659b75a02cb3841a8f4010a641939b8af8e9a67a6484360bf4cd4","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"},"source_kind":"arxiv","source_id":"1112.1124","source_version":4,"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-18T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELN3DK+uuVWPFF3CA7dM3YrZ3qzgzUiNsyVEPoI2D3cT/qlEXw8rzXIK+GoY8qscGaIeK4G83jsh8dV43zsdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:36:29.361223Z"},"content_sha256":"095c047ed502e5c6106a3167cf46667ab3a2b56d40670888bcf9bfe8d9789006","schema_version":"1.0","event_id":"sha256:095c047ed502e5c6106a3167cf46667ab3a2b56d40670888bcf9bfe8d9789006"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RZRGFOU4MZM3OWQCZM4EDKHUAE","target":"graph","payload":{"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"},"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-18T03:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4NvDuTbt0JNXHPg+CDmdZtl1XWvSVMnIti81Z5SJaWfC+Dg7fgCa7DKr7yepv8V/jwjWpAFnSmfBag5J+gvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:36:29.361867Z"},"content_sha256":"3bf7140dcffb403b14ae871dca7b326eb42b23b550a126735a2a78cfc0b06cd3","schema_version":"1.0","event_id":"sha256:3bf7140dcffb403b14ae871dca7b326eb42b23b550a126735a2a78cfc0b06cd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/bundle.json","state_url":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/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-05-30T14:36:29Z","links":{"resolver":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE","bundle":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/bundle.json","state":"https://pith.science/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZRGFOU4MZM3OWQCZM4EDKHUAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RZRGFOU4MZM3OWQCZM4EDKHUAE","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":"66338c0d64bca99e578ae03d9afa8b056a58e71fc81ce72fda94d12830bd52ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-05T23:44:08Z","title_canon_sha256":"0a7b497d8aede56d975ad4b3cb13663f89716a3dbff75d89f6f3d2332d860bdf"},"schema_version":"1.0","source":{"id":"1112.1124","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1124","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1124v4","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1124","created_at":"2026-05-18T03:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"RZRGFOU4MZM3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZRGFOU4MZM3OWQC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZRGFOU4","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:3bf7140dcffb403b14ae871dca7b326eb42b23b550a126735a2a78cfc0b06cd3","target":"graph","created_at":"2026-05-18T03:00:27Z","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":"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","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-05T23:44:08Z","title":"Minimum Convex Partitions and Maximum Empty Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1124","kind":"arxiv","version":4},"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:095c047ed502e5c6106a3167cf46667ab3a2b56d40670888bcf9bfe8d9789006","target":"record","created_at":"2026-05-18T03:00:27Z","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":"66338c0d64bca99e578ae03d9afa8b056a58e71fc81ce72fda94d12830bd52ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-12-05T23:44:08Z","title_canon_sha256":"0a7b497d8aede56d975ad4b3cb13663f89716a3dbff75d89f6f3d2332d860bdf"},"schema_version":"1.0","source":{"id":"1112.1124","kind":"arxiv","version":4}},"canonical_sha256":"8e6262ba9c6659b75a02cb3841a8f4010a641939b8af8e9a67a6484360bf4cd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e6262ba9c6659b75a02cb3841a8f4010a641939b8af8e9a67a6484360bf4cd4","first_computed_at":"2026-05-18T03:00:27.163798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:27.163798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yIMvm7eV5EavK8HtCsh0LUXhDIo1dn3+okbCchE0FRLcsYLBoZpURsyZYlikZkZGxgbP5yu9KsuRGom2S9OQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:27.164548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1124","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:095c047ed502e5c6106a3167cf46667ab3a2b56d40670888bcf9bfe8d9789006","sha256:3bf7140dcffb403b14ae871dca7b326eb42b23b550a126735a2a78cfc0b06cd3"],"state_sha256":"ca8ee70dee540d4f94f8911cbd2e01a93814b3228d46a600c6960b083bd9f12f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGNcWMZN7/LcaGyoakW4BKm3L+NOUODPywgjZjek82739Fnd1oN1fAyrJ7tk/svC0KKAlQOCLSDx5HCtxeN5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:36:29.365194Z","bundle_sha256":"fdc2f619946d4e0e05310ae868ad8529101fe8a2c3074755c57457d4368acfa2"}}