{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6HDTCKIPKP3XUANL2LNTVCZ37X","short_pith_number":"pith:6HDTCKIP","canonical_record":{"source":{"id":"1804.11086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T09:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"15b80ee08feb29c2a772b6a78059aba5e0a3eb3e7d0c683a412d0dfeecbebec2","abstract_canon_sha256":"8290a42a477c547e0177ef19f182af752e92e5f041dbf1a7d3758fd30d89e7a5"},"schema_version":"1.0"},"canonical_sha256":"f1c731290f53f77a01abd2db3a8b3bfdddb55764462343caa2a3532591561808","source":{"kind":"arxiv","id":"1804.11086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11086","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11086v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11086","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"6HDTCKIPKP3X","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HDTCKIPKP3XUANL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HDTCKIP","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6HDTCKIPKP3XUANL2LNTVCZ37X","target":"record","payload":{"canonical_record":{"source":{"id":"1804.11086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T09:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"15b80ee08feb29c2a772b6a78059aba5e0a3eb3e7d0c683a412d0dfeecbebec2","abstract_canon_sha256":"8290a42a477c547e0177ef19f182af752e92e5f041dbf1a7d3758fd30d89e7a5"},"schema_version":"1.0"},"canonical_sha256":"f1c731290f53f77a01abd2db3a8b3bfdddb55764462343caa2a3532591561808","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.653563Z","signature_b64":"9+m8Pb5ui3vPDsEwTFAXOzby1a2tN9Oxx7/DBlBQA7IDHQ4El/ZjvYD3Hb1nDzDelxcFzqdaq6STdo32MRtSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1c731290f53f77a01abd2db3a8b3bfdddb55764462343caa2a3532591561808","last_reissued_at":"2026-05-18T00:17:14.652904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.652904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.11086","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:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oERfzBQ8Jw5rWMdYcDY5b78LNSUGmbgD9m7Qe3mC6TzViEjkRKINzi62x6HPaVsCVWsc+AtgweWAjX8ldDK9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:59:38.192794Z"},"content_sha256":"20cc07359c72100d731bb5a9a3a79c794831ea1dfb8d38112bfc6a1e301f70a3","schema_version":"1.0","event_id":"sha256:20cc07359c72100d731bb5a9a3a79c794831ea1dfb8d38112bfc6a1e301f70a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6HDTCKIPKP3XUANL2LNTVCZ37X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Subquadratic Algorithm for 3XOR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer","submitted_at":"2018-04-30T09:04:20Z","abstract_excerpt":"Given a set $X$ of $n$ binary words of equal length $w$, the 3XOR problem asks for three elements $a, b, c \\in X$ such that $a \\oplus b=c$, where $ \\oplus$ denotes the bitwise XOR operation. The problem can be easily solved on a word RAM with word length $w$ in time $O(n^2 \\log{n})$. Using Han's fast integer sorting algorithm (2002/2004) this can be reduced to $O(n^2 \\log{\\log{n}})$. With randomization or a sophisticated deterministic dictionary construction, creating a hash table for $X$ with constant lookup time leads to an algorithm with (expected) running time $O(n^2)$. At present, seeming"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11086","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:17:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aW6f+cgIFINctOTIorOs2chtOyMcHNdUQE7siulsmsZntZKtZebbiersmrYuF9c+r8xUWnrB0z/Oy5kuQ+woCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:59:38.193297Z"},"content_sha256":"271046b8c12b92f5324a1e3e1f7a8397af4238e801173739cad97b7018c1b6ee","schema_version":"1.0","event_id":"sha256:271046b8c12b92f5324a1e3e1f7a8397af4238e801173739cad97b7018c1b6ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/bundle.json","state_url":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/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-26T03:59:38Z","links":{"resolver":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X","bundle":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/bundle.json","state":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6HDTCKIPKP3XUANL2LNTVCZ37X","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":"8290a42a477c547e0177ef19f182af752e92e5f041dbf1a7d3758fd30d89e7a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T09:04:20Z","title_canon_sha256":"15b80ee08feb29c2a772b6a78059aba5e0a3eb3e7d0c683a412d0dfeecbebec2"},"schema_version":"1.0","source":{"id":"1804.11086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11086","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11086v1","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11086","created_at":"2026-05-18T00:17:14Z"},{"alias_kind":"pith_short_12","alias_value":"6HDTCKIPKP3X","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6HDTCKIPKP3XUANL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6HDTCKIP","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:271046b8c12b92f5324a1e3e1f7a8397af4238e801173739cad97b7018c1b6ee","target":"graph","created_at":"2026-05-18T00:17:14Z","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":"Given a set $X$ of $n$ binary words of equal length $w$, the 3XOR problem asks for three elements $a, b, c \\in X$ such that $a \\oplus b=c$, where $ \\oplus$ denotes the bitwise XOR operation. The problem can be easily solved on a word RAM with word length $w$ in time $O(n^2 \\log{n})$. Using Han's fast integer sorting algorithm (2002/2004) this can be reduced to $O(n^2 \\log{\\log{n}})$. With randomization or a sophisticated deterministic dictionary construction, creating a hash table for $X$ with constant lookup time leads to an algorithm with (expected) running time $O(n^2)$. At present, seeming","authors_text":"Martin Dietzfelbinger, Philipp Schlag, Stefan Walzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T09:04:20Z","title":"A Subquadratic Algorithm for 3XOR"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11086","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:20cc07359c72100d731bb5a9a3a79c794831ea1dfb8d38112bfc6a1e301f70a3","target":"record","created_at":"2026-05-18T00:17:14Z","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":"8290a42a477c547e0177ef19f182af752e92e5f041dbf1a7d3758fd30d89e7a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T09:04:20Z","title_canon_sha256":"15b80ee08feb29c2a772b6a78059aba5e0a3eb3e7d0c683a412d0dfeecbebec2"},"schema_version":"1.0","source":{"id":"1804.11086","kind":"arxiv","version":1}},"canonical_sha256":"f1c731290f53f77a01abd2db3a8b3bfdddb55764462343caa2a3532591561808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1c731290f53f77a01abd2db3a8b3bfdddb55764462343caa2a3532591561808","first_computed_at":"2026-05-18T00:17:14.652904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:14.652904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9+m8Pb5ui3vPDsEwTFAXOzby1a2tN9Oxx7/DBlBQA7IDHQ4El/ZjvYD3Hb1nDzDelxcFzqdaq6STdo32MRtSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:14.653563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20cc07359c72100d731bb5a9a3a79c794831ea1dfb8d38112bfc6a1e301f70a3","sha256:271046b8c12b92f5324a1e3e1f7a8397af4238e801173739cad97b7018c1b6ee"],"state_sha256":"06a656718e4b1752d54a55465f2425dadfe52e92ed9e712f4dc185fdd3c419ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LUx2R/UfFaqBshI6tnRo63dz0Sf/ycZHJ6kLLp9yDOe6yYWwbvu+1WmU5Lko7vMiQU40np/HyLJAejpm32f/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:59:38.196023Z","bundle_sha256":"f4254adc42561adb56ae0f87ece1666b8020497ff1e0c3c6f2b40486e542aea4"}}