{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QUSL7KND34TRCL7VPBKLHGY5IC","short_pith_number":"pith:QUSL7KND","canonical_record":{"source":{"id":"2004.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-04-19T20:01:50Z","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"title_canon_sha256":"9b49ca65d36a3822e712c594b610dbde2d94875d36f64b5469a9ea4227179b41","abstract_canon_sha256":"c1c5ff9f31384bab169c4cf4f5db67ff6bbe5788d77455f2da627234a96b69a0"},"schema_version":"1.0"},"canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","source":{"kind":"arxiv","id":"2004.08949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08949","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08949v1","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08949","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"QUSL7KND34TR","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"pith_short_16","alias_value":"QUSL7KND34TRCL7V","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"pith_short_8","alias_value":"QUSL7KND","created_at":"2026-07-05T00:56:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QUSL7KND34TRCL7VPBKLHGY5IC","target":"record","payload":{"canonical_record":{"source":{"id":"2004.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-04-19T20:01:50Z","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"title_canon_sha256":"9b49ca65d36a3822e712c594b610dbde2d94875d36f64b5469a9ea4227179b41","abstract_canon_sha256":"c1c5ff9f31384bab169c4cf4f5db67ff6bbe5788d77455f2da627234a96b69a0"},"schema_version":"1.0"},"canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:11.684737Z","signature_b64":"JKOWRsyYXQ9r6rTeThBq8YLe5hUx+0BnELwPH+i8UPJx95fjIe7riK8fP0AkABPPORhliFGdI4vAcirRTguYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","last_reissued_at":"2026-07-05T00:56:11.684381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:11.684381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.08949","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-07-05T00:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yXvOl96cMPOa/qKJcBXtkER/qL/K1bru6aHASkSAqfrQlUyswOYDA7be0vFG4aEeUezvf4S1sqNqUT3CbNnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:38:41.945019Z"},"content_sha256":"716fef606f10f462a6109e5626a2bc0366c893552c2c6f720fe7896f439fe415","schema_version":"1.0","event_id":"sha256:716fef606f10f462a6109e5626a2bc0366c893552c2c6f720fe7896f439fe415"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QUSL7KND34TRCL7VPBKLHGY5IC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms for computational geometry problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","quant-ph"],"primary_cat":"cs.CG","authors_text":"Andris Ambainis, Nikita Larka","submitted_at":"2020-04-19T20:01:50Z","abstract_excerpt":"We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES and many other computational geometry problems are known to be 3SUM-HARD. That is, solving them classically requires time $\\Omega(n^{2-o(1)})$, unless there is faster algorithm for the well known 3SUM problem (in which we are given a set $S$ of $n$ integers and have to determine if there are $a, b, c \\in S$ such that $a + b + c = 0$). Quantumly, 3SUM can be s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08949","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.08949/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NW7aWmDZnLxc7TDujrvHVIa5yT6TJaBxf8gzgVsAo4s+3qb1ytzxEfh+9ig6bNp/zSi15fcXtDNlDRV+GATjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T07:38:41.945543Z"},"content_sha256":"e3e64c804d590eb6975304941469612b6ab55290d36ed3f9b15fd23619c003c6","schema_version":"1.0","event_id":"sha256:e3e64c804d590eb6975304941469612b6ab55290d36ed3f9b15fd23619c003c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/bundle.json","state_url":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUSL7KND34TRCL7VPBKLHGY5IC/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-08-07T07:38:41Z","links":{"resolver":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC","bundle":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/bundle.json","state":"https://pith.science/pith/QUSL7KND34TRCL7VPBKLHGY5IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUSL7KND34TRCL7VPBKLHGY5IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QUSL7KND34TRCL7VPBKLHGY5IC","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":"c1c5ff9f31384bab169c4cf4f5db67ff6bbe5788d77455f2da627234a96b69a0","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-04-19T20:01:50Z","title_canon_sha256":"9b49ca65d36a3822e712c594b610dbde2d94875d36f64b5469a9ea4227179b41"},"schema_version":"1.0","source":{"id":"2004.08949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08949","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08949v1","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08949","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"QUSL7KND34TR","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"pith_short_16","alias_value":"QUSL7KND34TRCL7V","created_at":"2026-07-05T00:56:11Z"},{"alias_kind":"pith_short_8","alias_value":"QUSL7KND","created_at":"2026-07-05T00:56:11Z"}],"graph_snapshots":[{"event_id":"sha256:e3e64c804d590eb6975304941469612b6ab55290d36ed3f9b15fd23619c003c6","target":"graph","created_at":"2026-07-05T00:56:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.08949/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study quantum algorithms for problems in computational geometry, such as POINT-ON-3-LINES problem. In this problem, we are given a set of lines and we are asked to find a point that lies on at least $3$ of these lines. POINT-ON-3-LINES and many other computational geometry problems are known to be 3SUM-HARD. That is, solving them classically requires time $\\Omega(n^{2-o(1)})$, unless there is faster algorithm for the well known 3SUM problem (in which we are given a set $S$ of $n$ integers and have to determine if there are $a, b, c \\in S$ such that $a + b + c = 0$). Quantumly, 3SUM can be s","authors_text":"Andris Ambainis, Nikita Larka","cross_cats":["cs.CC","cs.DS","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-04-19T20:01:50Z","title":"Quantum algorithms for computational geometry problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08949","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:716fef606f10f462a6109e5626a2bc0366c893552c2c6f720fe7896f439fe415","target":"record","created_at":"2026-07-05T00:56:11Z","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":"c1c5ff9f31384bab169c4cf4f5db67ff6bbe5788d77455f2da627234a96b69a0","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-04-19T20:01:50Z","title_canon_sha256":"9b49ca65d36a3822e712c594b610dbde2d94875d36f64b5469a9ea4227179b41"},"schema_version":"1.0","source":{"id":"2004.08949","kind":"arxiv","version":1}},"canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8524bfa9a3df27112ff57854b39b1d409d45aa94dc3fa444bff52114d158617f","first_computed_at":"2026-07-05T00:56:11.684381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:56:11.684381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JKOWRsyYXQ9r6rTeThBq8YLe5hUx+0BnELwPH+i8UPJx95fjIe7riK8fP0AkABPPORhliFGdI4vAcirRTguYDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:56:11.684737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:716fef606f10f462a6109e5626a2bc0366c893552c2c6f720fe7896f439fe415","sha256:e3e64c804d590eb6975304941469612b6ab55290d36ed3f9b15fd23619c003c6"],"state_sha256":"b6ac9dfb5a2929c0358273286ff0d20184e6205120568a7c375b049dcd08f5f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vs4lyq0sUaU5xS1dEonqVsGuj3V5RhcAWMY979fBLYpQcZyp9f5BaLJHxgTXtfz3El64olNC4xGBCkj8tOvCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T07:38:41.951031Z","bundle_sha256":"764a30e07c505ec1c7f4a29927ea15d36270818f2139b74b6bf22358631a8390"}}