{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QJWFRXCGRQAR4GRLG6OSEFLNCO","short_pith_number":"pith:QJWFRXCG","schema_version":"1.0","canonical_sha256":"826c58dc468c011e1a2b379d22156d13b1f66fff7da5690324d4908d55063a74","source":{"kind":"arxiv","id":"1502.06079","version":1},"attestation_state":"computed","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\\"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.06079","created_at":"2026-05-18T02:26:38.121299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06079v1","created_at":"2026-05-18T02:26:38.121299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06079","created_at":"2026-05-18T02:26:38.121299+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJWFRXCGRQAR","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJWFRXCGRQAR4GRL","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJWFRXCG","created_at":"2026-05-18T12:29:37.295048+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/QJWFRXCGRQAR4GRLG6OSEFLNCO","json":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO.json","graph_json":"https://pith.science/api/pith-number/QJWFRXCGRQAR4GRLG6OSEFLNCO/graph.json","events_json":"https://pith.science/api/pith-number/QJWFRXCGRQAR4GRLG6OSEFLNCO/events.json","paper":"https://pith.science/paper/QJWFRXCG"},"agent_actions":{"view_html":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO","download_json":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO.json","view_paper":"https://pith.science/paper/QJWFRXCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06079&json=true","fetch_graph":"https://pith.science/api/pith-number/QJWFRXCGRQAR4GRLG6OSEFLNCO/graph.json","fetch_events":"https://pith.science/api/pith-number/QJWFRXCGRQAR4GRLG6OSEFLNCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/action/storage_attestation","attest_author":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/action/author_attestation","sign_citation":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/action/citation_signature","submit_replication":"https://pith.science/pith/QJWFRXCGRQAR4GRLG6OSEFLNCO/action/replication_record"}},"created_at":"2026-05-18T02:26:38.121299+00:00","updated_at":"2026-05-18T02:26:38.121299+00:00"}