{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B2MSCHHENPNQJMCZF2HSRYBBMO","short_pith_number":"pith:B2MSCHHE","canonical_record":{"source":{"id":"1811.12017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-29T08:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"52b122582f96e66b3206517abe1ffd67134437bbbb4e0cdd28c94721aa4a3ad0","abstract_canon_sha256":"aba70edd244f9e3b6c5e347aa4618e1fe3089caf14888e3fc03cf2cb3504ec1b"},"schema_version":"1.0"},"canonical_sha256":"0e99211ce46bdb04b0592e8f28e021638239cc2bd6a18fc8d30ac29e033e4668","source":{"kind":"arxiv","id":"1811.12017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12017","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12017v1","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12017","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"B2MSCHHENPNQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2MSCHHENPNQJMCZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2MSCHHE","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B2MSCHHENPNQJMCZF2HSRYBBMO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-29T08:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"52b122582f96e66b3206517abe1ffd67134437bbbb4e0cdd28c94721aa4a3ad0","abstract_canon_sha256":"aba70edd244f9e3b6c5e347aa4618e1fe3089caf14888e3fc03cf2cb3504ec1b"},"schema_version":"1.0"},"canonical_sha256":"0e99211ce46bdb04b0592e8f28e021638239cc2bd6a18fc8d30ac29e033e4668","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:34.693620Z","signature_b64":"5e2zaEbsPtvmUDhlYiogQenmTEtvEAfFwt2rF65cFRoTEmI/9RlHQxLGeVA7te2nL5aFbhNKcH7kx+e9DBOqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e99211ce46bdb04b0592e8f28e021638239cc2bd6a18fc8d30ac29e033e4668","last_reissued_at":"2026-05-17T23:59:34.692932Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:34.692932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12017","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-17T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2930RVnPZYb9enYvY2bMH27F8SnFypF/KDaAVjthj5w91RXMKQfw7VyeF0qpvbTZQk5hQDM3nxqmbb6SEQUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:10:15.692790Z"},"content_sha256":"07fc578f49fe45c0b2cd9110ec61a7b40e8f4821b0878f74fb981650b55b1213","schema_version":"1.0","event_id":"sha256:07fc578f49fe45c0b2cd9110ec61a7b40e8f4821b0878f74fb981650b55b1213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B2MSCHHENPNQJMCZF2HSRYBBMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Equivalence Class for Orthogonal Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lijie Chen, Ryan Williams","submitted_at":"2018-11-29T08:48:06Z","abstract_excerpt":"The Orthogonal Vectors problem ($\\textsf{OV}$) asks: given $n$ vectors in $\\{0,1\\}^{O(\\log n)}$, are two of them orthogonal? $\\textsf{OV}$ is easily solved in $O(n^2 \\log n)$ time, and it is a central problem in fine-grained complexity: dozens of conditional lower bounds are based on the popular hypothesis that $\\textsf{OV}$ cannot be solved in (say) $n^{1.99}$ time. However, unlike the APSP problem, few other problems are known to be non-trivially equivalent to $\\textsf{OV}$.\n  We show $\\textsf{OV}$ is truly-subquadratic equivalent to several fundamental problems, all of which (a priori) look"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12017","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-17T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0OonBa7KozuKeuDd99lu4FNji3EyN5RbjdERzIXVSsUT/HqbrPGQtXlWF23iCJgcXXWhHaH5wi721JfWoAQIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:10:15.693144Z"},"content_sha256":"9bbacb5238e0c8750760a1f5f23df2b46c9b64f98b94871dcae849903bc124e3","schema_version":"1.0","event_id":"sha256:9bbacb5238e0c8750760a1f5f23df2b46c9b64f98b94871dcae849903bc124e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2MSCHHENPNQJMCZF2HSRYBBMO/bundle.json","state_url":"https://pith.science/pith/B2MSCHHENPNQJMCZF2HSRYBBMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2MSCHHENPNQJMCZF2HSRYBBMO/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-20T14:10:15Z","links":{"resolver":"https://pith.science/pith/B2MSCHHENPNQJMCZF2HSRYBBMO","bundle":"https://pith.science/pith/B2MSCHHENPNQJMCZF2HSRYBBMO/bundle.json","state":"https://pith.science/pith/B2MSCHHENPNQJMCZF2HSRYBBMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2MSCHHENPNQJMCZF2HSRYBBMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B2MSCHHENPNQJMCZF2HSRYBBMO","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":"aba70edd244f9e3b6c5e347aa4618e1fe3089caf14888e3fc03cf2cb3504ec1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-29T08:48:06Z","title_canon_sha256":"52b122582f96e66b3206517abe1ffd67134437bbbb4e0cdd28c94721aa4a3ad0"},"schema_version":"1.0","source":{"id":"1811.12017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12017","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12017v1","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12017","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"B2MSCHHENPNQ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2MSCHHENPNQJMCZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2MSCHHE","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:9bbacb5238e0c8750760a1f5f23df2b46c9b64f98b94871dcae849903bc124e3","target":"graph","created_at":"2026-05-17T23:59:34Z","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 Orthogonal Vectors problem ($\\textsf{OV}$) asks: given $n$ vectors in $\\{0,1\\}^{O(\\log n)}$, are two of them orthogonal? $\\textsf{OV}$ is easily solved in $O(n^2 \\log n)$ time, and it is a central problem in fine-grained complexity: dozens of conditional lower bounds are based on the popular hypothesis that $\\textsf{OV}$ cannot be solved in (say) $n^{1.99}$ time. However, unlike the APSP problem, few other problems are known to be non-trivially equivalent to $\\textsf{OV}$.\n  We show $\\textsf{OV}$ is truly-subquadratic equivalent to several fundamental problems, all of which (a priori) look","authors_text":"Lijie Chen, Ryan Williams","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-29T08:48:06Z","title":"An Equivalence Class for Orthogonal Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12017","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:07fc578f49fe45c0b2cd9110ec61a7b40e8f4821b0878f74fb981650b55b1213","target":"record","created_at":"2026-05-17T23:59:34Z","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":"aba70edd244f9e3b6c5e347aa4618e1fe3089caf14888e3fc03cf2cb3504ec1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-29T08:48:06Z","title_canon_sha256":"52b122582f96e66b3206517abe1ffd67134437bbbb4e0cdd28c94721aa4a3ad0"},"schema_version":"1.0","source":{"id":"1811.12017","kind":"arxiv","version":1}},"canonical_sha256":"0e99211ce46bdb04b0592e8f28e021638239cc2bd6a18fc8d30ac29e033e4668","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e99211ce46bdb04b0592e8f28e021638239cc2bd6a18fc8d30ac29e033e4668","first_computed_at":"2026-05-17T23:59:34.692932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:34.692932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5e2zaEbsPtvmUDhlYiogQenmTEtvEAfFwt2rF65cFRoTEmI/9RlHQxLGeVA7te2nL5aFbhNKcH7kx+e9DBOqBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:34.693620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07fc578f49fe45c0b2cd9110ec61a7b40e8f4821b0878f74fb981650b55b1213","sha256:9bbacb5238e0c8750760a1f5f23df2b46c9b64f98b94871dcae849903bc124e3"],"state_sha256":"1f4eac1afa1cc7272fe5dcfc72a116b68f439bfc7b485f33fecc31ca9d65e14b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YPlYqZbRsn2Lq+uTkzfmEh4yXQFf4jRwgf9LeAsLoL7mIbdbitnS1mLwMNJdaC7TNyRYY5L2mjsG69BbgoGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:10:15.695265Z","bundle_sha256":"8154a28279916b4cfe9be935ee6f96578b3227eb509355fb367f03ce15162bd5"}}