{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LKUTVI3IRFFQV2Y2LGET2X3BLC","short_pith_number":"pith:LKUTVI3I","canonical_record":{"source":{"id":"1810.06740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-15T22:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"59552ec26d177c760ae1c4dc3165605d6ba9df00ee65f54835579488b9dd05ad","abstract_canon_sha256":"97ec8026b161cf83cfc8cf69a5a6449c9c74b9255e316211ef3ae7fb43b5ad46"},"schema_version":"1.0"},"canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","source":{"kind":"arxiv","id":"1810.06740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06740","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06740v1","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06740","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"LKUTVI3IRFFQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LKUTVI3IRFFQV2Y2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LKUTVI3I","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LKUTVI3IRFFQV2Y2LGET2X3BLC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-15T22:51:50Z","cross_cats_sorted":[],"title_canon_sha256":"59552ec26d177c760ae1c4dc3165605d6ba9df00ee65f54835579488b9dd05ad","abstract_canon_sha256":"97ec8026b161cf83cfc8cf69a5a6449c9c74b9255e316211ef3ae7fb43b5ad46"},"schema_version":"1.0"},"canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:11.730553Z","signature_b64":"g/g1PN0JzczfaX0XXb6VFLXCwehU25ZTOubWRMOoT6Ib7IV5sXaVb5r6veNLxfiCIl96HroiMLQ8iFQFafKKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","last_reissued_at":"2026-05-18T00:03:11.729801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:11.729801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06740","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-18T00:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gu/VSwBkwHFDSetMI0HlOkBOg4scXdvqlk/TShpqKu8z3mQ2HA7TPIxPi3U1GvJDPAMQCPcQVi9zL9XR9CFWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:51:52.919085Z"},"content_sha256":"91c973e9ca3007b114469f3d673ef86dfc2247dc6adc425c6319cd409f22fc49","schema_version":"1.0","event_id":"sha256:91c973e9ca3007b114469f3d673ef86dfc2247dc6adc425c6319cd409f22fc49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LKUTVI3IRFFQV2Y2LGET2X3BLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Illuminating Algorithm for the Light Bulb Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Josh Alman","submitted_at":"2018-10-15T22:51:50Z","abstract_excerpt":"The Light Bulb Problem is one of the most basic problems in data analysis. One is given as input $n$ vectors in $\\{-1,1\\}^d$, which are all independently and uniformly random, except for a planted pair of vectors with inner product at least $\\rho \\cdot d$ for some constant $\\rho > 0$. The task is to find the planted pair. The most straightforward algorithm leads to a runtime of $\\Omega(n^2)$. Algorithms based on techniques like Locality-Sensitive Hashing achieve runtimes of $n^{2 - O(\\rho)}$; as $\\rho$ gets small, these approach quadratic.\n  Building on prior work, we give a new algorithm for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06740","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-18T00:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PKlG+mISBXjo16UXEqKE9Fpam4zPflHOXMx0g9pTkhmvjdyHEokgwJSmO2BxCMwWRnq8NfrHHjy9kNr1NaieBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:51:52.919467Z"},"content_sha256":"1dd705dd5310a16c80b66842ffc12d7d4c0cb9f4a03f1b12eda3109c019349d5","schema_version":"1.0","event_id":"sha256:1dd705dd5310a16c80b66842ffc12d7d4c0cb9f4a03f1b12eda3109c019349d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/bundle.json","state_url":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/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-30T05:51:52Z","links":{"resolver":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC","bundle":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/bundle.json","state":"https://pith.science/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKUTVI3IRFFQV2Y2LGET2X3BLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LKUTVI3IRFFQV2Y2LGET2X3BLC","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":"97ec8026b161cf83cfc8cf69a5a6449c9c74b9255e316211ef3ae7fb43b5ad46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-15T22:51:50Z","title_canon_sha256":"59552ec26d177c760ae1c4dc3165605d6ba9df00ee65f54835579488b9dd05ad"},"schema_version":"1.0","source":{"id":"1810.06740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06740","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06740v1","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06740","created_at":"2026-05-18T00:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"LKUTVI3IRFFQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LKUTVI3IRFFQV2Y2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LKUTVI3I","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:1dd705dd5310a16c80b66842ffc12d7d4c0cb9f4a03f1b12eda3109c019349d5","target":"graph","created_at":"2026-05-18T00:03: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"},"paper":{"abstract_excerpt":"The Light Bulb Problem is one of the most basic problems in data analysis. One is given as input $n$ vectors in $\\{-1,1\\}^d$, which are all independently and uniformly random, except for a planted pair of vectors with inner product at least $\\rho \\cdot d$ for some constant $\\rho > 0$. The task is to find the planted pair. The most straightforward algorithm leads to a runtime of $\\Omega(n^2)$. Algorithms based on techniques like Locality-Sensitive Hashing achieve runtimes of $n^{2 - O(\\rho)}$; as $\\rho$ gets small, these approach quadratic.\n  Building on prior work, we give a new algorithm for ","authors_text":"Josh Alman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-15T22:51:50Z","title":"An Illuminating Algorithm for the Light Bulb Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06740","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:91c973e9ca3007b114469f3d673ef86dfc2247dc6adc425c6319cd409f22fc49","target":"record","created_at":"2026-05-18T00:03: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":"97ec8026b161cf83cfc8cf69a5a6449c9c74b9255e316211ef3ae7fb43b5ad46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-15T22:51:50Z","title_canon_sha256":"59552ec26d177c760ae1c4dc3165605d6ba9df00ee65f54835579488b9dd05ad"},"schema_version":"1.0","source":{"id":"1810.06740","kind":"arxiv","version":1}},"canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aa93aa368894b0aeb1a59893d5f615894c02112f9d307a9e65e08a1a114219a","first_computed_at":"2026-05-18T00:03:11.729801Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:11.729801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/g1PN0JzczfaX0XXb6VFLXCwehU25ZTOubWRMOoT6Ib7IV5sXaVb5r6veNLxfiCIl96HroiMLQ8iFQFafKKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:11.730553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91c973e9ca3007b114469f3d673ef86dfc2247dc6adc425c6319cd409f22fc49","sha256:1dd705dd5310a16c80b66842ffc12d7d4c0cb9f4a03f1b12eda3109c019349d5"],"state_sha256":"33bc7c556a728e884096ac435cc289c35501f938d93f7d94e72e834573cb6d33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmmIQE4pohXZm9Kb79FIZUN6TEgo4N5Rb1wrvgj4Yip9BHS5CNc7IhA+HnVE9dPKCysU6GfDk/cVq6iTNHAFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:51:52.921579Z","bundle_sha256":"6def45a350f6d62454a3dff4469c210a97bbc13eddea4d0b39acebf00869c717"}}