{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LSMWUB34TLXPDLZXCKIVZPC7QH","short_pith_number":"pith:LSMWUB34","canonical_record":{"source":{"id":"1809.10531","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T14:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"47dcf2fd81b8f8e065f0c6e098b382dbbfde23edcf85f4614f32a4054709a881","abstract_canon_sha256":"22e6d903f7566fee70549393438717ca109103ea74d04406de66b7eceefcc8da"},"schema_version":"1.0"},"canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","source":{"kind":"arxiv","id":"1809.10531","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10531","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10531v2","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10531","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"LSMWUB34TLXP","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LSMWUB34TLXPDLZX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LSMWUB34","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LSMWUB34TLXPDLZXCKIVZPC7QH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10531","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T14:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"47dcf2fd81b8f8e065f0c6e098b382dbbfde23edcf85f4614f32a4054709a881","abstract_canon_sha256":"22e6d903f7566fee70549393438717ca109103ea74d04406de66b7eceefcc8da"},"schema_version":"1.0"},"canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.261485Z","signature_b64":"iy6iRSvqe/pr0LC9buFcweDwBitDH2SeSfbP0fu6TQjuiVHTPuIHmQziHj17wcUIChDhJlPJpm5AC9KZ57/rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","last_reissued_at":"2026-05-17T23:49:22.260972Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.260972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10531","source_version":2,"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-17T23:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCtrh4GC+cppUCHmaoXKpf2sFKqapLCm9n1ePHANnggJf/Jg7GAz3whWnrvQbg7+ANvj661HYvCZbWyHjQ0fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:50:33.092726Z"},"content_sha256":"5185c6a807a6a3e951bf2f0fd4542e09ba5d262d3377515ff67c39c91cc466b2","schema_version":"1.0","event_id":"sha256:5185c6a807a6a3e951bf2f0fd4542e09ba5d262d3377515ff67c39c91cc466b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LSMWUB34TLXPDLZXCKIVZPC7QH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Closest-Pair Queries in Fat Rectangles","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Michiel Smid, Sang Won Bae","submitted_at":"2018-09-27T14:15:33Z","abstract_excerpt":"In the range closest pair problem, we want to construct a data structure storing a set $S$ of $n$ points in the plane, such that for any axes-parallel query rectangle $R$, the closest pair in the set $R \\cap S$ can be reported. The currently best result for this problem is by Xue et al.~(SoCG 2018). Their data structure has size $O(n \\log^2 n)$ and query time $O(\\log^2 n)$. We show that a data structure of size $O(n \\log n)$ can be constructed in $O(n \\log n)$ time, such that queries can be answered in $O(\\log n + f \\log f)$ time, where $f$ is the aspect ratio of $R$. Thus, for fat query recta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10531","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"},"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-17T23:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CIwr4iMFDXpL14WmDIWQk657C7TWcLQGFjF4TLs7xqTuidN4chA1FHy0Xtyrer3CfelJm4p2JwXg+bd7/iWwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:50:33.093074Z"},"content_sha256":"026bb8b79b6353bf65b704ac66f0775cd8a1dd7f6ce8b1030a56b17a282eb2f8","schema_version":"1.0","event_id":"sha256:026bb8b79b6353bf65b704ac66f0775cd8a1dd7f6ce8b1030a56b17a282eb2f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/bundle.json","state_url":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/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-19T21:50:33Z","links":{"resolver":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH","bundle":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/bundle.json","state":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LSMWUB34TLXPDLZXCKIVZPC7QH","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":"22e6d903f7566fee70549393438717ca109103ea74d04406de66b7eceefcc8da","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T14:15:33Z","title_canon_sha256":"47dcf2fd81b8f8e065f0c6e098b382dbbfde23edcf85f4614f32a4054709a881"},"schema_version":"1.0","source":{"id":"1809.10531","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10531","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10531v2","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10531","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"LSMWUB34TLXP","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LSMWUB34TLXPDLZX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LSMWUB34","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:026bb8b79b6353bf65b704ac66f0775cd8a1dd7f6ce8b1030a56b17a282eb2f8","target":"graph","created_at":"2026-05-17T23:49:22Z","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":"In the range closest pair problem, we want to construct a data structure storing a set $S$ of $n$ points in the plane, such that for any axes-parallel query rectangle $R$, the closest pair in the set $R \\cap S$ can be reported. The currently best result for this problem is by Xue et al.~(SoCG 2018). Their data structure has size $O(n \\log^2 n)$ and query time $O(\\log^2 n)$. We show that a data structure of size $O(n \\log n)$ can be constructed in $O(n \\log n)$ time, such that queries can be answered in $O(\\log n + f \\log f)$ time, where $f$ is the aspect ratio of $R$. Thus, for fat query recta","authors_text":"Michiel Smid, Sang Won Bae","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T14:15:33Z","title":"Closest-Pair Queries in Fat Rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10531","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:5185c6a807a6a3e951bf2f0fd4542e09ba5d262d3377515ff67c39c91cc466b2","target":"record","created_at":"2026-05-17T23:49:22Z","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":"22e6d903f7566fee70549393438717ca109103ea74d04406de66b7eceefcc8da","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T14:15:33Z","title_canon_sha256":"47dcf2fd81b8f8e065f0c6e098b382dbbfde23edcf85f4614f32a4054709a881"},"schema_version":"1.0","source":{"id":"1809.10531","kind":"arxiv","version":2}},"canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","first_computed_at":"2026-05-17T23:49:22.260972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:22.260972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iy6iRSvqe/pr0LC9buFcweDwBitDH2SeSfbP0fu6TQjuiVHTPuIHmQziHj17wcUIChDhJlPJpm5AC9KZ57/rDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:22.261485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10531","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5185c6a807a6a3e951bf2f0fd4542e09ba5d262d3377515ff67c39c91cc466b2","sha256:026bb8b79b6353bf65b704ac66f0775cd8a1dd7f6ce8b1030a56b17a282eb2f8"],"state_sha256":"80cce199681672b953b7c74b7c7b6166defcd0a864c643d508aa82a9e59b2bc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oi0NVs3hxIn05mNCzoZOy/Ljeg08nhoThYaeIlRgm188jvpe+Rwlpfq6MP2MTN2lpWiGwRuZvqPwu1M+dbaiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T21:50:33.106467Z","bundle_sha256":"aa8deaf95a8f2a1aafeb0e3690d48267d036fa951ff190f00767e02efa591e60"}}