{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QJWFRXCGRQAR4GRLG6OSEFLNCO","short_pith_number":"pith:QJWFRXCG","canonical_record":{"source":{"id":"1502.06079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-21T07:27:49Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"db19fd87bed423d631acc8c37784208a2017e8eb400d1939619bb1e5431377ae","abstract_canon_sha256":"7aab12c7b32942a40a33fb355e790d35a68a3bd148ad33c530007f72f3f99911"},"schema_version":"1.0"},"canonical_sha256":"826c58dc468c011e1a2b379d22156d13b1f66fff7da5690324d4908d55063a74","source":{"kind":"arxiv","id":"1502.06079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06079","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06079v1","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06079","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"QJWFRXCGRQAR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QJWFRXCGRQAR4GRL","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QJWFRXCG","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QJWFRXCGRQAR4GRLG6OSEFLNCO","target":"record","payload":{"canonical_record":{"source":{"id":"1502.06079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-21T07:27:49Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"db19fd87bed423d631acc8c37784208a2017e8eb400d1939619bb1e5431377ae","abstract_canon_sha256":"7aab12c7b32942a40a33fb355e790d35a68a3bd148ad33c530007f72f3f99911"},"schema_version":"1.0"},"canonical_sha256":"826c58dc468c011e1a2b379d22156d13b1f66fff7da5690324d4908d55063a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.121784Z","signature_b64":"gj2eOjpPNWERdSL70Rvzm7Z5mIvC84RVIbJFeYzY98Z8WX/oT2zAve8YsPOopYX/VZnbNmh5aY/IZ3x53ZmpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826c58dc468c011e1a2b379d22156d13b1f66fff7da5690324d4908d55063a74","last_reissued_at":"2026-05-18T02:26:38.121207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.121207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.06079","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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wIgRXGvN0MU5Fvel43n0rUC/v7hWSXjM3YmGNY1H/k6kwsvZjG9meT2VdtP8dDbqfadgmQ8JzDRN1spug6ZzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:23:18.740718Z"},"content_sha256":"25e63a0228b9edf0118196f4de805aad5f1e3a2bb11dbffbfff82eb9ef1105fa","schema_version":"1.0","event_id":"sha256:25e63a0228b9edf0118196f4de805aad5f1e3a2bb11dbffbfff82eb9ef1105fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QJWFRXCGRQAR4GRLG6OSEFLNCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Pairwise Intersections Inside a Query Range","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Ali D. Mehrabi, Joachim Gudmundsson, Mark de Berg","submitted_at":"2015-02-21T07:27:49Z","abstract_excerpt":"We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-aligned query range Q. We present data structures of size $O(n({\\rm polylog} n))$ and with query time $O((k+1)({\\rm polylog} n))$ time, where k is the number of reported pairs, for two classes of objects in the plane: axis-aligned rectangles and objects with small union complexity. For the 3-dimensional case where the objects and the query range are axis-aligned boxes in R^3, we present a data structures of size $O(n\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06079","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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdH3k3gvj86ay9FaCAoiXf960QURQPvOEFsLauIEc6rVeNAecOwqt9P5VfSN6ANGQYcjYiKXo+OLot5ky2AjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:23:18.741436Z"},"content_sha256":"16970b2d0a7181677756336172218929b18e2f6d01d63293fe3a6c7fb9fb32b6","schema_version":"1.0","event_id":"sha256:16970b2d0a7181677756336172218929b18e2f6d01d63293fe3a6c7fb9fb32b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/bundle.json","state_url":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/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-26T08:23:18Z","links":{"resolver":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO","bundle":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/bundle.json","state":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QJWFRXCGRQAR4GRLG6OSEFLNCO","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":"7aab12c7b32942a40a33fb355e790d35a68a3bd148ad33c530007f72f3f99911","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-21T07:27:49Z","title_canon_sha256":"db19fd87bed423d631acc8c37784208a2017e8eb400d1939619bb1e5431377ae"},"schema_version":"1.0","source":{"id":"1502.06079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.06079","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1502.06079v1","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06079","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"QJWFRXCGRQAR","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QJWFRXCGRQAR4GRL","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QJWFRXCG","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:16970b2d0a7181677756336172218929b18e2f6d01d63293fe3a6c7fb9fb32b6","target":"graph","created_at":"2026-05-18T02:26:38Z","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":"We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-aligned query range Q. We present data structures of size $O(n({\\rm polylog} n))$ and with query time $O((k+1)({\\rm polylog} n))$ time, where k is the number of reported pairs, for two classes of objects in the plane: axis-aligned rectangles and objects with small union complexity. For the 3-dimensional case where the objects and the query range are axis-aligned boxes in R^3, we present a data structures of size $O(n\\","authors_text":"Ali D. Mehrabi, Joachim Gudmundsson, Mark de Berg","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-21T07:27:49Z","title":"Finding Pairwise Intersections Inside a Query Range"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06079","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:25e63a0228b9edf0118196f4de805aad5f1e3a2bb11dbffbfff82eb9ef1105fa","target":"record","created_at":"2026-05-18T02:26:38Z","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":"7aab12c7b32942a40a33fb355e790d35a68a3bd148ad33c530007f72f3f99911","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-21T07:27:49Z","title_canon_sha256":"db19fd87bed423d631acc8c37784208a2017e8eb400d1939619bb1e5431377ae"},"schema_version":"1.0","source":{"id":"1502.06079","kind":"arxiv","version":1}},"canonical_sha256":"826c58dc468c011e1a2b379d22156d13b1f66fff7da5690324d4908d55063a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"826c58dc468c011e1a2b379d22156d13b1f66fff7da5690324d4908d55063a74","first_computed_at":"2026-05-18T02:26:38.121207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.121207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gj2eOjpPNWERdSL70Rvzm7Z5mIvC84RVIbJFeYzY98Z8WX/oT2zAve8YsPOopYX/VZnbNmh5aY/IZ3x53ZmpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.121784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.06079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25e63a0228b9edf0118196f4de805aad5f1e3a2bb11dbffbfff82eb9ef1105fa","sha256:16970b2d0a7181677756336172218929b18e2f6d01d63293fe3a6c7fb9fb32b6"],"state_sha256":"f2e9f709f98e2c0931274f9e01be33c31ec7a6b6914f7ee310ddde338ec34d81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MuLbGW0t+LF6zH7S2Zh186jsw6KY+Bh5DlmwmfpIUgApKewKwu1m106NKvRqeZ85HlSzBlAvJw16yf1xCjNCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:23:18.744960Z","bundle_sha256":"8c2112cac67333efdf01ec99e1f2a7f6be7ea2d0bf5c41d65b7a3416dcce0f81"}}