{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5YTS4QAYHRFDQXRHXQVINY7L7X","short_pith_number":"pith:5YTS4QAY","canonical_record":{"source":{"id":"1507.01767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T11:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"0cdff6d633a5e1b58cefde9ad5441ef7b4df9c69ea5526f459fec48d0ea47f35","abstract_canon_sha256":"a0ae342ce8148ae6bb79df33127b52440ca10f4bd51494d231921634ebafec4a"},"schema_version":"1.0"},"canonical_sha256":"ee272e40183c4a385e27bc2a86e3ebfdcae248406a7ced3f98cd660a6f94937e","source":{"kind":"arxiv","id":"1507.01767","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01767","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01767v2","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01767","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"5YTS4QAYHRFD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5YTS4QAYHRFDQXRH","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5YTS4QAY","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5YTS4QAYHRFDQXRHXQVINY7L7X","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T11:53:49Z","cross_cats_sorted":[],"title_canon_sha256":"0cdff6d633a5e1b58cefde9ad5441ef7b4df9c69ea5526f459fec48d0ea47f35","abstract_canon_sha256":"a0ae342ce8148ae6bb79df33127b52440ca10f4bd51494d231921634ebafec4a"},"schema_version":"1.0"},"canonical_sha256":"ee272e40183c4a385e27bc2a86e3ebfdcae248406a7ced3f98cd660a6f94937e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:29.699707Z","signature_b64":"ywDT9dXAX6g4WCmFt0klYqLmVV6JTK6ghmlYaBAHbA77xNsL6SKd7tvqf9+j1z1R67XgRqnwlo4VZkjvnAhLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee272e40183c4a385e27bc2a86e3ebfdcae248406a7ced3f98cd660a6f94937e","last_reissued_at":"2026-05-18T01:16:29.699190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:29.699190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01767","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-18T01:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4JK+T6BKmLspoTfEIZJT2smu09kg4wiZPGsYTnjpsqFlEAjgwNfYQUeqPsAuKCfMRLi/+r7k1uq6qW9qnGSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:22:50.556414Z"},"content_sha256":"929e3a6de721b524fac80f5266194d9bffc9bae236b4d30e63b7f332a1b5bd9f","schema_version":"1.0","event_id":"sha256:929e3a6de721b524fac80f5266194d9bffc9bae236b4d30e63b7f332a1b5bd9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5YTS4QAYHRFDQXRHXQVINY7L7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient Plane-Sweep Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Frank Kammer","submitted_at":"2015-07-07T11:53:49Z","abstract_excerpt":"We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\\Theta(s)$ bits, where $\\lg n \\leq s \\leq n \\cdot \\lg n$. Three techniques that can be used as general tools in different space-efficient algorithms are introduced and employed within our algorithms. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of $n$ points that runs in $O(n^2/s + n \\cdot \\lg s)$ time. We also give a simple algorithm to enumerate the interse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01767","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-18T01:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbtNw/UGZ/gR1iO4QLP+n9w2hzFfFiOf9W9KkRKlSUYDXJ9z732WDBbvJdPYUI2ezMOKNUYTGT0J+FOzj5XBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:22:50.556741Z"},"content_sha256":"af113562869fb8cd064a1109cae2537b95b6f8e6f234b2ade079933c81e3d78e","schema_version":"1.0","event_id":"sha256:af113562869fb8cd064a1109cae2537b95b6f8e6f234b2ade079933c81e3d78e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YTS4QAYHRFDQXRHXQVINY7L7X/bundle.json","state_url":"https://pith.science/pith/5YTS4QAYHRFDQXRHXQVINY7L7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YTS4QAYHRFDQXRHXQVINY7L7X/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-06-24T07:22:50Z","links":{"resolver":"https://pith.science/pith/5YTS4QAYHRFDQXRHXQVINY7L7X","bundle":"https://pith.science/pith/5YTS4QAYHRFDQXRHXQVINY7L7X/bundle.json","state":"https://pith.science/pith/5YTS4QAYHRFDQXRHXQVINY7L7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YTS4QAYHRFDQXRHXQVINY7L7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5YTS4QAYHRFDQXRHXQVINY7L7X","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":"a0ae342ce8148ae6bb79df33127b52440ca10f4bd51494d231921634ebafec4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T11:53:49Z","title_canon_sha256":"0cdff6d633a5e1b58cefde9ad5441ef7b4df9c69ea5526f459fec48d0ea47f35"},"schema_version":"1.0","source":{"id":"1507.01767","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01767","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01767v2","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01767","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"5YTS4QAYHRFD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5YTS4QAYHRFDQXRH","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5YTS4QAY","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:af113562869fb8cd064a1109cae2537b95b6f8e6f234b2ade079933c81e3d78e","target":"graph","created_at":"2026-05-18T01:16:29Z","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 introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\\Theta(s)$ bits, where $\\lg n \\leq s \\leq n \\cdot \\lg n$. Three techniques that can be used as general tools in different space-efficient algorithms are introduced and employed within our algorithms. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of $n$ points that runs in $O(n^2/s + n \\cdot \\lg s)$ time. We also give a simple algorithm to enumerate the interse","authors_text":"Amr Elmasry, Frank Kammer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T11:53:49Z","title":"Space-Efficient Plane-Sweep Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01767","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:929e3a6de721b524fac80f5266194d9bffc9bae236b4d30e63b7f332a1b5bd9f","target":"record","created_at":"2026-05-18T01:16:29Z","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":"a0ae342ce8148ae6bb79df33127b52440ca10f4bd51494d231921634ebafec4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T11:53:49Z","title_canon_sha256":"0cdff6d633a5e1b58cefde9ad5441ef7b4df9c69ea5526f459fec48d0ea47f35"},"schema_version":"1.0","source":{"id":"1507.01767","kind":"arxiv","version":2}},"canonical_sha256":"ee272e40183c4a385e27bc2a86e3ebfdcae248406a7ced3f98cd660a6f94937e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee272e40183c4a385e27bc2a86e3ebfdcae248406a7ced3f98cd660a6f94937e","first_computed_at":"2026-05-18T01:16:29.699190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:29.699190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ywDT9dXAX6g4WCmFt0klYqLmVV6JTK6ghmlYaBAHbA77xNsL6SKd7tvqf9+j1z1R67XgRqnwlo4VZkjvnAhLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:29.699707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01767","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:929e3a6de721b524fac80f5266194d9bffc9bae236b4d30e63b7f332a1b5bd9f","sha256:af113562869fb8cd064a1109cae2537b95b6f8e6f234b2ade079933c81e3d78e"],"state_sha256":"f73bd26dc92aad063a1b78678d1fb69230b0e292878ef5d853f0bd2533e3e1c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRVlf/ZBGMbU1YgDKH7rPKhpsTpHOsuC7Wi+ZVQ2qa7L/0rWXaOzzTEhj6yx8BqA9MUScg+dpq9ziu7ZT/F6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:22:50.558502Z","bundle_sha256":"2676d4cf1e2d299b9c23a5dc1c5ecff3452ab9f08799d49fb8963c009d3c4f04"}}