{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q5GG2E5LOVTK35OZJFS37TWSTI","short_pith_number":"pith:Q5GG2E5L","canonical_record":{"source":{"id":"1709.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-15T16:26:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"73b4404647a52e76123ac9fa22c106fb100adc5b695ff6958a77fa394f35af3b","abstract_canon_sha256":"5678e1e460c6f011c78ccf5cf81a20c367328c47954fda04c5f4e9c1fd33d4da"},"schema_version":"1.0"},"canonical_sha256":"874c6d13ab7566adf5d94965bfced29a255be52b302735684d0441fb3de81939","source":{"kind":"arxiv","id":"1709.05294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05294","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05294v1","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05294","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"Q5GG2E5LOVTK","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5GG2E5LOVTK35OZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5GG2E5L","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q5GG2E5LOVTK35OZJFS37TWSTI","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-15T16:26:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"73b4404647a52e76123ac9fa22c106fb100adc5b695ff6958a77fa394f35af3b","abstract_canon_sha256":"5678e1e460c6f011c78ccf5cf81a20c367328c47954fda04c5f4e9c1fd33d4da"},"schema_version":"1.0"},"canonical_sha256":"874c6d13ab7566adf5d94965bfced29a255be52b302735684d0441fb3de81939","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.086950Z","signature_b64":"BtDH7aNPoVszJgn1DOJ85U9+j9EWgGZddNqyoh/vYmDZ4ef9E/oBHNnWpN4URJPFfDqjIyhsVDFtq15gFtCHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874c6d13ab7566adf5d94965bfced29a255be52b302735684d0441fb3de81939","last_reissued_at":"2026-05-18T00:35:06.086284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.086284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05294","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:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XT5X7wAvaypDKRNkzsaKrOiDq2czL9hjRzcKCwmj8IEED5r/cDPBlm4SKTD89cxq1Mw0pv5oTAmKVqpqiYdbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:26:21.625697Z"},"content_sha256":"37f4416f4c6cf51a3d98078548ae3605a4c8ece591e3fbd8419c3eb06b02fa84","schema_version":"1.0","event_id":"sha256:37f4416f4c6cf51a3d98078548ae3605a4c8ece591e3fbd8419c3eb06b02fa84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q5GG2E5LOVTK35OZJFS37TWSTI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Orthogonal Vectors Conjecture for Branching Programs and Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Daniel Kane, Ryan Williams","submitted_at":"2017-09-15T16:26:34Z","abstract_excerpt":"In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors in $d$ dimensions. The OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all $d=\\omega(\\log n)$. Assuming the OVC, optimal time lower bounds have been proved for many prominent problems in $P$.\n  We prove that OVC is true in several computational models of interest:\n  * For all sufficiently large $n$ and $d$, OV for $n$ vectors in $\\{0,1\\}^d$ has branching program complexity $\\tilde{\\Theta}(n\\cdot \\min(n,2^d))$. In particular, the lower boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05294","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:35:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2CtgB2d3ZbnAHYgpLet4dlvngypA3yojPkyt0mb6Mu2Vk/VaCe7Q/Hh+h7QMtjBlCV4oKFSuoMQKcoyTCnNUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:26:21.626106Z"},"content_sha256":"c81c7aaf66eb71889aaa67c7b5db9fb1b069145c77dbc0086eece7acb81f255b","schema_version":"1.0","event_id":"sha256:c81c7aaf66eb71889aaa67c7b5db9fb1b069145c77dbc0086eece7acb81f255b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5GG2E5LOVTK35OZJFS37TWSTI/bundle.json","state_url":"https://pith.science/pith/Q5GG2E5LOVTK35OZJFS37TWSTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5GG2E5LOVTK35OZJFS37TWSTI/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-27T00:26:21Z","links":{"resolver":"https://pith.science/pith/Q5GG2E5LOVTK35OZJFS37TWSTI","bundle":"https://pith.science/pith/Q5GG2E5LOVTK35OZJFS37TWSTI/bundle.json","state":"https://pith.science/pith/Q5GG2E5LOVTK35OZJFS37TWSTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5GG2E5LOVTK35OZJFS37TWSTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q5GG2E5LOVTK35OZJFS37TWSTI","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":"5678e1e460c6f011c78ccf5cf81a20c367328c47954fda04c5f4e9c1fd33d4da","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-15T16:26:34Z","title_canon_sha256":"73b4404647a52e76123ac9fa22c106fb100adc5b695ff6958a77fa394f35af3b"},"schema_version":"1.0","source":{"id":"1709.05294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05294","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05294v1","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05294","created_at":"2026-05-18T00:35:06Z"},{"alias_kind":"pith_short_12","alias_value":"Q5GG2E5LOVTK","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q5GG2E5LOVTK35OZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q5GG2E5L","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:c81c7aaf66eb71889aaa67c7b5db9fb1b069145c77dbc0086eece7acb81f255b","target":"graph","created_at":"2026-05-18T00:35:06Z","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":"In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors in $d$ dimensions. The OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all $d=\\omega(\\log n)$. Assuming the OVC, optimal time lower bounds have been proved for many prominent problems in $P$.\n  We prove that OVC is true in several computational models of interest:\n  * For all sufficiently large $n$ and $d$, OV for $n$ vectors in $\\{0,1\\}^d$ has branching program complexity $\\tilde{\\Theta}(n\\cdot \\min(n,2^d))$. In particular, the lower boun","authors_text":"Daniel Kane, Ryan Williams","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-15T16:26:34Z","title":"The Orthogonal Vectors Conjecture for Branching Programs and Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05294","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:37f4416f4c6cf51a3d98078548ae3605a4c8ece591e3fbd8419c3eb06b02fa84","target":"record","created_at":"2026-05-18T00:35:06Z","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":"5678e1e460c6f011c78ccf5cf81a20c367328c47954fda04c5f4e9c1fd33d4da","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-15T16:26:34Z","title_canon_sha256":"73b4404647a52e76123ac9fa22c106fb100adc5b695ff6958a77fa394f35af3b"},"schema_version":"1.0","source":{"id":"1709.05294","kind":"arxiv","version":1}},"canonical_sha256":"874c6d13ab7566adf5d94965bfced29a255be52b302735684d0441fb3de81939","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"874c6d13ab7566adf5d94965bfced29a255be52b302735684d0441fb3de81939","first_computed_at":"2026-05-18T00:35:06.086284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:06.086284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtDH7aNPoVszJgn1DOJ85U9+j9EWgGZddNqyoh/vYmDZ4ef9E/oBHNnWpN4URJPFfDqjIyhsVDFtq15gFtCHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:06.086950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37f4416f4c6cf51a3d98078548ae3605a4c8ece591e3fbd8419c3eb06b02fa84","sha256:c81c7aaf66eb71889aaa67c7b5db9fb1b069145c77dbc0086eece7acb81f255b"],"state_sha256":"2c87e05dc95975b6113c7f0006f8377a67e8f9173693bc1db0971d85e84eac70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIcJfoXnOHdF8/C+L/JTvQOYbip4NkcA0X5OyGeaxxyo8VFlaucbKK1VDe5vSM/i5Ahtc1N9gLyr/ZBz2WTOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:26:21.629206Z","bundle_sha256":"f279f68e8fbed921520fd5b73c19e40ec2ee3d903b60106aabc63914e1e8aecd"}}