{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MYESMZL3APJFYL5FXMXGNPMS6O","short_pith_number":"pith:MYESMZL3","schema_version":"1.0","canonical_sha256":"660926657b03d25c2fa5bb2e66bd92f3a81084f101b7b8ef2f8572b1e128b1d7","source":{"kind":"arxiv","id":"1302.5328","version":2},"attestation_state":"computed","paper":{"title":"Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Maarten L\\\"offler, Wolfgang Mulzer","submitted_at":"2013-02-21T16:30:15Z","abstract_excerpt":"Let $\\mathcal{D}$ be a set of $n$ pairwise disjoint unit disks in the plane. We describe how to build a data structure for $\\mathcal{D}$ so that for any point set $P$ containing exactly one point from each disk, we can quickly find the onion decomposition (convex layers) of $P$.\n  Our data structure can be built in $O(n \\log n)$ time and has linear size. Given $P$, we can find its onion decomposition in $O(n \\log k)$ time, where $k$ is the number of layers. We also provide a matching lower bound. Our solution is based on a recursive space decomposition, combined with a fast algorithm to comput"},"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":"1302.5328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-21T16:30:15Z","cross_cats_sorted":[],"title_canon_sha256":"7b92c811227e5e0bb790c15509c8aec907e9f9c5cb1a5edc622a3dbd27fd836f","abstract_canon_sha256":"6f7870000a91a8a3f536a75ef98c79cec4f987ba8590deaed79091ce75d8d713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:53.631130Z","signature_b64":"uuqjqeO+m2RS1Zg/cJyPTPE/sB3uLPEpOd94a0kpm+zJktmcw69TR4wUMQwB9Oh/2HnQ7bWVwt5f2Be/9JEgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"660926657b03d25c2fa5bb2e66bd92f3a81084f101b7b8ef2f8572b1e128b1d7","last_reissued_at":"2026-05-18T00:52:53.630618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:53.630618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Maarten L\\\"offler, Wolfgang Mulzer","submitted_at":"2013-02-21T16:30:15Z","abstract_excerpt":"Let $\\mathcal{D}$ be a set of $n$ pairwise disjoint unit disks in the plane. We describe how to build a data structure for $\\mathcal{D}$ so that for any point set $P$ containing exactly one point from each disk, we can quickly find the onion decomposition (convex layers) of $P$.\n  Our data structure can be built in $O(n \\log n)$ time and has linear size. Given $P$, we can find its onion decomposition in $O(n \\log k)$ time, where $k$ is the number of layers. We also provide a matching lower bound. Our solution is based on a recursive space decomposition, combined with a fast algorithm to comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5328","kind":"arxiv","version":2},"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":"1302.5328","created_at":"2026-05-18T00:52:53.630707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5328v2","created_at":"2026-05-18T00:52:53.630707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5328","created_at":"2026-05-18T00:52:53.630707+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYESMZL3APJF","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYESMZL3APJFYL5F","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYESMZL3","created_at":"2026-05-18T12:27:52.871228+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/MYESMZL3APJFYL5FXMXGNPMS6O","json":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O.json","graph_json":"https://pith.science/api/pith-number/MYESMZL3APJFYL5FXMXGNPMS6O/graph.json","events_json":"https://pith.science/api/pith-number/MYESMZL3APJFYL5FXMXGNPMS6O/events.json","paper":"https://pith.science/paper/MYESMZL3"},"agent_actions":{"view_html":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O","download_json":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O.json","view_paper":"https://pith.science/paper/MYESMZL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5328&json=true","fetch_graph":"https://pith.science/api/pith-number/MYESMZL3APJFYL5FXMXGNPMS6O/graph.json","fetch_events":"https://pith.science/api/pith-number/MYESMZL3APJFYL5FXMXGNPMS6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O/action/storage_attestation","attest_author":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O/action/author_attestation","sign_citation":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O/action/citation_signature","submit_replication":"https://pith.science/pith/MYESMZL3APJFYL5FXMXGNPMS6O/action/replication_record"}},"created_at":"2026-05-18T00:52:53.630707+00:00","updated_at":"2026-05-18T00:52:53.630707+00:00"}