{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FJCS2DGMRH7GHA763QGPFCYIKA","short_pith_number":"pith:FJCS2DGM","schema_version":"1.0","canonical_sha256":"2a452d0ccc89fe6383fedc0cf28b08502797b2c0ad980c9491b7f518fb48ee1e","source":{"kind":"arxiv","id":"1502.01779","version":1},"attestation_state":"computed","paper":{"title":"The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Michael Gene Dobbins, Otfried Cheong, Xavier Goaoc","submitted_at":"2015-02-06T02:33:11Z","abstract_excerpt":"We show that the union of $n$ translates of a convex body in $\\mathbb{R}^3$ can have $\\Theta(n^3)$ holes in the worst case, where a hole in a set $X$ is a connected component of $\\mathbb{R}^3 \\setminus X$. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions."},"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":"1502.01779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-06T02:33:11Z","cross_cats_sorted":[],"title_canon_sha256":"49e1f627b57f84b85a9c23b0578ac04a367aa7410e10a1600cb36d75ba9de0f7","abstract_canon_sha256":"d5a0c6da672fef6ff0476fc04a79aa19433eb012037f788f9fc48733b81bc112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.463516Z","signature_b64":"qQJV0GiYiSGhGjsF7wk/FhfWl4wkl5yxMZqRXLcbtZgH4IflBt0PgAW67jXE25NjkK/CLK8VV7EPIpfBmsnOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a452d0ccc89fe6383fedc0cf28b08502797b2c0ad980c9491b7f518fb48ee1e","last_reissued_at":"2026-05-17T23:43:54.463002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.463002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Michael Gene Dobbins, Otfried Cheong, Xavier Goaoc","submitted_at":"2015-02-06T02:33:11Z","abstract_excerpt":"We show that the union of $n$ translates of a convex body in $\\mathbb{R}^3$ can have $\\Theta(n^3)$ holes in the worst case, where a hole in a set $X$ is a connected component of $\\mathbb{R}^3 \\setminus X$. This refutes a 20-year-old conjecture. As a consequence, we also obtain improved lower bounds on the complexity of motion planning problems and of Voronoi diagrams with convex distance functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01779","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":"1502.01779","created_at":"2026-05-17T23:43:54.463073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01779v1","created_at":"2026-05-17T23:43:54.463073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01779","created_at":"2026-05-17T23:43:54.463073+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJCS2DGMRH7G","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJCS2DGMRH7GHA76","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJCS2DGM","created_at":"2026-05-18T12:29:19.899920+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/FJCS2DGMRH7GHA763QGPFCYIKA","json":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA.json","graph_json":"https://pith.science/api/pith-number/FJCS2DGMRH7GHA763QGPFCYIKA/graph.json","events_json":"https://pith.science/api/pith-number/FJCS2DGMRH7GHA763QGPFCYIKA/events.json","paper":"https://pith.science/paper/FJCS2DGM"},"agent_actions":{"view_html":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA","download_json":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA.json","view_paper":"https://pith.science/paper/FJCS2DGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01779&json=true","fetch_graph":"https://pith.science/api/pith-number/FJCS2DGMRH7GHA763QGPFCYIKA/graph.json","fetch_events":"https://pith.science/api/pith-number/FJCS2DGMRH7GHA763QGPFCYIKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA/action/storage_attestation","attest_author":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA/action/author_attestation","sign_citation":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA/action/citation_signature","submit_replication":"https://pith.science/pith/FJCS2DGMRH7GHA763QGPFCYIKA/action/replication_record"}},"created_at":"2026-05-17T23:43:54.463073+00:00","updated_at":"2026-05-17T23:43:54.463073+00:00"}