{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AQHMI25F7Z6XMK5ANIXRG5S6YR","short_pith_number":"pith:AQHMI25F","canonical_record":{"source":{"id":"2507.11098","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T08:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"fb0c90543e7020ba118043862df0733d2afb857963862819b4ce9b764e062157","abstract_canon_sha256":"21db542a7b9f8f3abf1ecd6be4548aa8f9dabec332833aa69e25c8cdd87ae562"},"schema_version":"1.0"},"canonical_sha256":"040ec46ba5fe7d762ba06a2f13765ec47a8372ed0b85455085c9f5f437d85ffc","source":{"kind":"arxiv","id":"2507.11098","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11098","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11098v2","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11098","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"AQHMI25F7Z6X","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"pith_short_16","alias_value":"AQHMI25F7Z6XMK5A","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"pith_short_8","alias_value":"AQHMI25F","created_at":"2026-06-04T01:08:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AQHMI25F7Z6XMK5ANIXRG5S6YR","target":"record","payload":{"canonical_record":{"source":{"id":"2507.11098","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T08:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"fb0c90543e7020ba118043862df0733d2afb857963862819b4ce9b764e062157","abstract_canon_sha256":"21db542a7b9f8f3abf1ecd6be4548aa8f9dabec332833aa69e25c8cdd87ae562"},"schema_version":"1.0"},"canonical_sha256":"040ec46ba5fe7d762ba06a2f13765ec47a8372ed0b85455085c9f5f437d85ffc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:30.437346Z","signature_b64":"3uuFZVnMNXIB2ZptGWrId64GGs+ffTKUzprDcdHNkO35QZj0TOEQPWD4bwvId9PoVAR4NRNJQvjGKEFrwdNCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"040ec46ba5fe7d762ba06a2f13765ec47a8372ed0b85455085c9f5f437d85ffc","last_reissued_at":"2026-06-04T01:08:30.436726Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:30.436726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.11098","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-06-04T01:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiQ9bwy15O3dGJFPc9H8HeleT3kG5SwyGm7E0F00NdPq6XWzHp+EdEI5P9J05qp1xMQtdKml5Rwv8Yza7hbNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:02:14.960663Z"},"content_sha256":"8e2756a8e8c62f0b9cdf8282c5f44cd34a85fe488e71a560c17707bc0c170670","schema_version":"1.0","event_id":"sha256:8e2756a8e8c62f0b9cdf8282c5f44cd34a85fe488e71a560c17707bc0c170670"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AQHMI25F7Z6XMK5ANIXRG5S6YR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster algorithms for k-Orthogonal Vectors in low dimension","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anita D\\\"urr, Evangelos Kipouridis, Karol W\\k{e}grzycki, Michael Lampis","submitted_at":"2025-07-15T08:45:24Z","abstract_excerpt":"In the Orthogonal Vectors problem (OV), we are given two families $A, B$ of subsets of $\\{1,\\ldots,d\\}$, each of size $n$, and the task is to decide whether there exists a pair $a \\in A$ and $b \\in B$ such that $a \\cap b = \\emptyset$. Straightforward algorithms for this problem run in $\\mathcal{O}(n^2 \\cdot d)$ or $\\mathcal{O}(2^d \\cdot n)$ time, and assuming SETH, there is no $2^{o(d)}\\cdot n^{2-\\varepsilon}$ time algorithm that solves this problem for any constant $\\varepsilon > 0$.\n  Williams (FOCS 2024) presented a $\\tilde{\\mathcal{O}}(1.35^d \\cdot n)$-time algorithm for the problem, based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11098","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11098/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-06-04T01:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anpejEJl+Gsl/6/B5U+wybsjStoxidJRj0Wg1beQMw2z2kBQKsm5cmte70Xaw0XF2a3/FqgxfVesWxQowHNMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:02:14.961048Z"},"content_sha256":"55a7b1057f612684232a51e644f09032cb146c15413169dbd6a6482bcda0fb9a","schema_version":"1.0","event_id":"sha256:55a7b1057f612684232a51e644f09032cb146c15413169dbd6a6482bcda0fb9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR/bundle.json","state_url":"https://pith.science/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR/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-05T16:02:14Z","links":{"resolver":"https://pith.science/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR","bundle":"https://pith.science/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR/bundle.json","state":"https://pith.science/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQHMI25F7Z6XMK5ANIXRG5S6YR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AQHMI25F7Z6XMK5ANIXRG5S6YR","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":"21db542a7b9f8f3abf1ecd6be4548aa8f9dabec332833aa69e25c8cdd87ae562","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T08:45:24Z","title_canon_sha256":"fb0c90543e7020ba118043862df0733d2afb857963862819b4ce9b764e062157"},"schema_version":"1.0","source":{"id":"2507.11098","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11098","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11098v2","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11098","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"AQHMI25F7Z6X","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"pith_short_16","alias_value":"AQHMI25F7Z6XMK5A","created_at":"2026-06-04T01:08:30Z"},{"alias_kind":"pith_short_8","alias_value":"AQHMI25F","created_at":"2026-06-04T01:08:30Z"}],"graph_snapshots":[{"event_id":"sha256:55a7b1057f612684232a51e644f09032cb146c15413169dbd6a6482bcda0fb9a","target":"graph","created_at":"2026-06-04T01:08:30Z","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/2507.11098/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the Orthogonal Vectors problem (OV), we are given two families $A, B$ of subsets of $\\{1,\\ldots,d\\}$, each of size $n$, and the task is to decide whether there exists a pair $a \\in A$ and $b \\in B$ such that $a \\cap b = \\emptyset$. Straightforward algorithms for this problem run in $\\mathcal{O}(n^2 \\cdot d)$ or $\\mathcal{O}(2^d \\cdot n)$ time, and assuming SETH, there is no $2^{o(d)}\\cdot n^{2-\\varepsilon}$ time algorithm that solves this problem for any constant $\\varepsilon > 0$.\n  Williams (FOCS 2024) presented a $\\tilde{\\mathcal{O}}(1.35^d \\cdot n)$-time algorithm for the problem, based","authors_text":"Anita D\\\"urr, Evangelos Kipouridis, Karol W\\k{e}grzycki, Michael Lampis","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T08:45:24Z","title":"Faster algorithms for k-Orthogonal Vectors in low dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11098","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:8e2756a8e8c62f0b9cdf8282c5f44cd34a85fe488e71a560c17707bc0c170670","target":"record","created_at":"2026-06-04T01:08:30Z","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":"21db542a7b9f8f3abf1ecd6be4548aa8f9dabec332833aa69e25c8cdd87ae562","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-15T08:45:24Z","title_canon_sha256":"fb0c90543e7020ba118043862df0733d2afb857963862819b4ce9b764e062157"},"schema_version":"1.0","source":{"id":"2507.11098","kind":"arxiv","version":2}},"canonical_sha256":"040ec46ba5fe7d762ba06a2f13765ec47a8372ed0b85455085c9f5f437d85ffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"040ec46ba5fe7d762ba06a2f13765ec47a8372ed0b85455085c9f5f437d85ffc","first_computed_at":"2026-06-04T01:08:30.436726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:30.436726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3uuFZVnMNXIB2ZptGWrId64GGs+ffTKUzprDcdHNkO35QZj0TOEQPWD4bwvId9PoVAR4NRNJQvjGKEFrwdNCBw==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:30.437346Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11098","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e2756a8e8c62f0b9cdf8282c5f44cd34a85fe488e71a560c17707bc0c170670","sha256:55a7b1057f612684232a51e644f09032cb146c15413169dbd6a6482bcda0fb9a"],"state_sha256":"bfbc757d3bfb5a81019dd2ab336badacdef07b2d26fcab1e9c1b3f30a3d039e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pf/P8GRzMd4PKx9gYgCvZKVS2Agc9pSEUzTBjlHbephDe+Sh0ijVpNGB1iHYS62W+tSyiDtEpC3R7Kbk2SQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:02:14.963118Z","bundle_sha256":"03297d18a85e27872f8e0ae66674d81b22e5b034be4fe53ed438494d391fab80"}}