{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZR3323NUHN453CFXRGP6BO3Q4R","short_pith_number":"pith:ZR3323NU","canonical_record":{"source":{"id":"1809.01308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T03:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"27bf5d4fa6145c9b313a8c9f589de2c720fb271b0c9ec4404c5153757cba437a","abstract_canon_sha256":"c10f6053a77d460400640d6af26aa93d957ab5df20af8bb4ab3db0af0cd6a8e4"},"schema_version":"1.0"},"canonical_sha256":"cc77bd6db43b79dd88b7899fe0bb70e46f4a10a985ecc2c4795ea60eeb3ea131","source":{"kind":"arxiv","id":"1809.01308","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01308","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01308v1","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01308","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZR3323NUHN45","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZR3323NUHN453CFX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZR3323NU","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZR3323NUHN453CFXRGP6BO3Q4R","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T03:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"27bf5d4fa6145c9b313a8c9f589de2c720fb271b0c9ec4404c5153757cba437a","abstract_canon_sha256":"c10f6053a77d460400640d6af26aa93d957ab5df20af8bb4ab3db0af0cd6a8e4"},"schema_version":"1.0"},"canonical_sha256":"cc77bd6db43b79dd88b7899fe0bb70e46f4a10a985ecc2c4795ea60eeb3ea131","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:28.070374Z","signature_b64":"G/7QFWRDCuRSjM3j3p5UbZf98B7c720wAyqQ9pwgM8lQLFiQ1OreAx7DX5cKCYwjIFJ5b5nwDK+t+8255EXABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc77bd6db43b79dd88b7899fe0bb70e46f4a10a985ecc2c4795ea60eeb3ea131","last_reissued_at":"2026-05-18T00:06:28.069838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:28.069838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01308","source_version":1,"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-18T00:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kDEsGQIens/0xSVjxBCTVWqCRjpFX6VOo9EpYMFS+lW77shlVfY1uWC5FIWNSdCN8PyZ355kFHKKMNlLugfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:17:38.907660Z"},"content_sha256":"878b29943e436c77cfa8047b1eca1e4fb5103f273fe81b87742310d0cc07228c","schema_version":"1.0","event_id":"sha256:878b29943e436c77cfa8047b1eca1e4fb5103f273fe81b87742310d0cc07228c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZR3323NUHN453CFXRGP6BO3Q4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Incremental Construction of Net-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Donald R. Sheehy, Mahmoodreza Jahanseir","submitted_at":"2018-09-05T03:33:42Z","abstract_excerpt":"Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct net-trees on doubling metrics using $O(n\\log n)$ time in expectation. Along the way, we define a new, linear-size net-tree variant that simplifies the analyses and algorithms. We show a connection between these trees and approximate Voronoi diagrams and use this to simplify the point location necessary in net-tree construction. Our analysis uses a novel backwards analysis that may be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01308","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"},"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-18T00:06:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idm3pIS6gMUcBXZGTKMIEwhsP+V5KKX74fPJV9tmniAfVs1TFj1+Uu61lmbS5+hAHupgy0Cchpz5MXWzKIDqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:17:38.908048Z"},"content_sha256":"031f4ebf151b16c60e9dd10dd70ec35d6e5e9e527bea6dd263031807f118320b","schema_version":"1.0","event_id":"sha256:031f4ebf151b16c60e9dd10dd70ec35d6e5e9e527bea6dd263031807f118320b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR3323NUHN453CFXRGP6BO3Q4R/bundle.json","state_url":"https://pith.science/pith/ZR3323NUHN453CFXRGP6BO3Q4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR3323NUHN453CFXRGP6BO3Q4R/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-26T13:17:38Z","links":{"resolver":"https://pith.science/pith/ZR3323NUHN453CFXRGP6BO3Q4R","bundle":"https://pith.science/pith/ZR3323NUHN453CFXRGP6BO3Q4R/bundle.json","state":"https://pith.science/pith/ZR3323NUHN453CFXRGP6BO3Q4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR3323NUHN453CFXRGP6BO3Q4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZR3323NUHN453CFXRGP6BO3Q4R","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":"c10f6053a77d460400640d6af26aa93d957ab5df20af8bb4ab3db0af0cd6a8e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T03:33:42Z","title_canon_sha256":"27bf5d4fa6145c9b313a8c9f589de2c720fb271b0c9ec4404c5153757cba437a"},"schema_version":"1.0","source":{"id":"1809.01308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01308","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01308v1","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01308","created_at":"2026-05-18T00:06:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZR3323NUHN45","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZR3323NUHN453CFX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZR3323NU","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:031f4ebf151b16c60e9dd10dd70ec35d6e5e9e527bea6dd263031807f118320b","target":"graph","created_at":"2026-05-18T00:06:28Z","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":"Net-trees are a general purpose data structure for metric data that have been used to solve a wide range of algorithmic problems. We give a simple randomized algorithm to construct net-trees on doubling metrics using $O(n\\log n)$ time in expectation. Along the way, we define a new, linear-size net-tree variant that simplifies the analyses and algorithms. We show a connection between these trees and approximate Voronoi diagrams and use this to simplify the point location necessary in net-tree construction. Our analysis uses a novel backwards analysis that may be of independent interest.","authors_text":"Donald R. Sheehy, Mahmoodreza Jahanseir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T03:33:42Z","title":"Randomized Incremental Construction of Net-Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01308","kind":"arxiv","version":1},"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:878b29943e436c77cfa8047b1eca1e4fb5103f273fe81b87742310d0cc07228c","target":"record","created_at":"2026-05-18T00:06:28Z","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":"c10f6053a77d460400640d6af26aa93d957ab5df20af8bb4ab3db0af0cd6a8e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-05T03:33:42Z","title_canon_sha256":"27bf5d4fa6145c9b313a8c9f589de2c720fb271b0c9ec4404c5153757cba437a"},"schema_version":"1.0","source":{"id":"1809.01308","kind":"arxiv","version":1}},"canonical_sha256":"cc77bd6db43b79dd88b7899fe0bb70e46f4a10a985ecc2c4795ea60eeb3ea131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc77bd6db43b79dd88b7899fe0bb70e46f4a10a985ecc2c4795ea60eeb3ea131","first_computed_at":"2026-05-18T00:06:28.069838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:28.069838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/7QFWRDCuRSjM3j3p5UbZf98B7c720wAyqQ9pwgM8lQLFiQ1OreAx7DX5cKCYwjIFJ5b5nwDK+t+8255EXABQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:28.070374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:878b29943e436c77cfa8047b1eca1e4fb5103f273fe81b87742310d0cc07228c","sha256:031f4ebf151b16c60e9dd10dd70ec35d6e5e9e527bea6dd263031807f118320b"],"state_sha256":"c840812f5c6040c50a7a4f54282644f50ca95db85c603b1b16a301f26496ca25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7h1b7x6TDwtaVomBTltZqcfIWp/hyb0v6yXTi3CUYiVckPUhHE+p0FRyKCWiLeSiaHmU7uwmSmZxJnw5NH//Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:17:38.911580Z","bundle_sha256":"6aef20e94940e2b5ed5aae62e074131fbcbb2c0ba5dc50ff4ce0c6002d6a79f2"}}