{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6HDTCKIPKP3XUANL2LNTVCZ37X","short_pith_number":"pith:6HDTCKIP","schema_version":"1.0","canonical_sha256":"f1c731290f53f77a01abd2db3a8b3bfdddb55764462343caa2a3532591561808","source":{"kind":"arxiv","id":"1804.11086","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.11086","created_at":"2026-05-18T00:17:14.652980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11086v1","created_at":"2026-05-18T00:17:14.652980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11086","created_at":"2026-05-18T00:17:14.652980+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HDTCKIPKP3X","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HDTCKIPKP3XUANL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HDTCKIP","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X","json":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X.json","graph_json":"https://pith.science/api/pith-number/6HDTCKIPKP3XUANL2LNTVCZ37X/graph.json","events_json":"https://pith.science/api/pith-number/6HDTCKIPKP3XUANL2LNTVCZ37X/events.json","paper":"https://pith.science/paper/6HDTCKIP"},"agent_actions":{"view_html":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X","download_json":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X.json","view_paper":"https://pith.science/paper/6HDTCKIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11086&json=true","fetch_graph":"https://pith.science/api/pith-number/6HDTCKIPKP3XUANL2LNTVCZ37X/graph.json","fetch_events":"https://pith.science/api/pith-number/6HDTCKIPKP3XUANL2LNTVCZ37X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/action/storage_attestation","attest_author":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/action/author_attestation","sign_citation":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/action/citation_signature","submit_replication":"https://pith.science/pith/6HDTCKIPKP3XUANL2LNTVCZ37X/action/replication_record"}},"created_at":"2026-05-18T00:17:14.652980+00:00","updated_at":"2026-05-18T00:17:14.652980+00:00"}