{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MYESMZL3APJFYL5FXMXGNPMS6O","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":"6f7870000a91a8a3f536a75ef98c79cec4f987ba8590deaed79091ce75d8d713","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-21T16:30:15Z","title_canon_sha256":"7b92c811227e5e0bb790c15509c8aec907e9f9c5cb1a5edc622a3dbd27fd836f"},"schema_version":"1.0","source":{"id":"1302.5328","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5328","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5328v2","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5328","created_at":"2026-05-18T00:52:53Z"},{"alias_kind":"pith_short_12","alias_value":"MYESMZL3APJF","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MYESMZL3APJFYL5F","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MYESMZL3","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:5fc459bb82c65242798878ced38e8e0f448fe33a188fd81df715cbb94ea9a27b","target":"graph","created_at":"2026-05-18T00:52:53Z","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 $\\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","authors_text":"Maarten L\\\"offler, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-21T16:30:15Z","title":"Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5328","kind":"arxiv","version":2},"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:c8d752a13a1e3c11233e30d23b47b51bb6a38b3ea7d4d399644bb5882db8fb63","target":"record","created_at":"2026-05-18T00:52:53Z","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":"6f7870000a91a8a3f536a75ef98c79cec4f987ba8590deaed79091ce75d8d713","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-21T16:30:15Z","title_canon_sha256":"7b92c811227e5e0bb790c15509c8aec907e9f9c5cb1a5edc622a3dbd27fd836f"},"schema_version":"1.0","source":{"id":"1302.5328","kind":"arxiv","version":2}},"canonical_sha256":"660926657b03d25c2fa5bb2e66bd92f3a81084f101b7b8ef2f8572b1e128b1d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"660926657b03d25c2fa5bb2e66bd92f3a81084f101b7b8ef2f8572b1e128b1d7","first_computed_at":"2026-05-18T00:52:53.630618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:53.630618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uuqjqeO+m2RS1Zg/cJyPTPE/sB3uLPEpOd94a0kpm+zJktmcw69TR4wUMQwB9Oh/2HnQ7bWVwt5f2Be/9JEgBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:53.631130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5328","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8d752a13a1e3c11233e30d23b47b51bb6a38b3ea7d4d399644bb5882db8fb63","sha256:5fc459bb82c65242798878ced38e8e0f448fe33a188fd81df715cbb94ea9a27b"],"state_sha256":"ed6d202bc2fa412839f4d63e3ffedea4f0507303a08cf35617ec6684ac1ed521"}