{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2AKJIT5SZXQU3PVYGZUUMVT4XH","short_pith_number":"pith:2AKJIT5S","schema_version":"1.0","canonical_sha256":"d014944fb2cde14dbeb8366946567cb9c659032ca44e6b78a1f91170f7868784","source":{"kind":"arxiv","id":"1210.0481","version":5},"attestation_state":"computed","paper":{"title":"Leapfrog Triejoin: a worst-case optimal join algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Todd L. Veldhuizen","submitted_at":"2012-10-01T17:54:13Z","abstract_excerpt":"Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full conjunctive query, given constraints on the input relation sizes. In 2012, Ngo, Porat, R{\\'e} and Rudra (henceforth NPRR) devised a join algorithm with worst-case running time proportional to the AGM bound. Our commercial Datalog system LogicBlox employs a novel join algorithm, \\emph{leapfrog triejoin}, which compared conspicuously well to the NPRR algorithm in preliminary benchmarks. This spurred us to analyze the complex"},"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":"1210.0481","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-10-01T17:54:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b3b9a03ada4a31cb38c4f476c5260e16b161986e1ca6e99f2c2d5aaa2f5bfaba","abstract_canon_sha256":"30e426af11d611607b7619050b327342a07204842d23012a35a7ef2aab7198e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:13.985863Z","signature_b64":"RdDvxLZxmtkUMB2l2ycJb/BjG97XN0cQWpSanHO1fT3jWkHLMNxlmV6SZvaMFMtJghXRbahjCUeqY9h24EesAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d014944fb2cde14dbeb8366946567cb9c659032ca44e6b78a1f91170f7868784","last_reissued_at":"2026-05-18T03:04:13.985457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:13.985457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leapfrog Triejoin: a worst-case optimal join algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Todd L. Veldhuizen","submitted_at":"2012-10-01T17:54:13Z","abstract_excerpt":"Recent years have seen exciting developments in join algorithms. In 2008, Atserias, Grohe and Marx (henceforth AGM) proved a tight bound on the maximum result size of a full conjunctive query, given constraints on the input relation sizes. In 2012, Ngo, Porat, R{\\'e} and Rudra (henceforth NPRR) devised a join algorithm with worst-case running time proportional to the AGM bound. Our commercial Datalog system LogicBlox employs a novel join algorithm, \\emph{leapfrog triejoin}, which compared conspicuously well to the NPRR algorithm in preliminary benchmarks. This spurred us to analyze the complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0481","kind":"arxiv","version":5},"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":"1210.0481","created_at":"2026-05-18T03:04:13.985517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0481v5","created_at":"2026-05-18T03:04:13.985517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0481","created_at":"2026-05-18T03:04:13.985517+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AKJIT5SZXQU","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AKJIT5SZXQU3PVY","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AKJIT5S","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05832","citing_title":"BaCon: Efficient Batch Processing of Counting Queries [Full Version]","ref_index":71,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH","json":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH.json","graph_json":"https://pith.science/api/pith-number/2AKJIT5SZXQU3PVYGZUUMVT4XH/graph.json","events_json":"https://pith.science/api/pith-number/2AKJIT5SZXQU3PVYGZUUMVT4XH/events.json","paper":"https://pith.science/paper/2AKJIT5S"},"agent_actions":{"view_html":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH","download_json":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH.json","view_paper":"https://pith.science/paper/2AKJIT5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0481&json=true","fetch_graph":"https://pith.science/api/pith-number/2AKJIT5SZXQU3PVYGZUUMVT4XH/graph.json","fetch_events":"https://pith.science/api/pith-number/2AKJIT5SZXQU3PVYGZUUMVT4XH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH/action/storage_attestation","attest_author":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH/action/author_attestation","sign_citation":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH/action/citation_signature","submit_replication":"https://pith.science/pith/2AKJIT5SZXQU3PVYGZUUMVT4XH/action/replication_record"}},"created_at":"2026-05-18T03:04:13.985517+00:00","updated_at":"2026-05-18T03:04:13.985517+00:00"}