{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ARUFA32O5VOXAT6ZMOTIWER5MR","short_pith_number":"pith:ARUFA32O","schema_version":"1.0","canonical_sha256":"0468506f4eed5d704fd963a68b123d64773fa70bca2700e3ed63fdf231c3db86","source":{"kind":"arxiv","id":"2607.13875","version":1},"attestation_state":"computed","paper":{"title":"Lexicographic Direct Access with Functional Dependencies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Florent Capelli, Nofar Carmeli, Stefan Mengel","submitted_at":"2026-07-15T14:24:27Z","abstract_excerpt":"We study the complexity of lexicographic direct access to join query answers over databases that satisfy functional dependencies (FDs). More precisely, we give fine-grained lower and upper bounds on the preprocessing time required to achieve polylogarithmic access time. We start by considering the simple approach of a reordered extension, which first incorporates the FDs in the query and order, and then ignores the FDs during evaluation. We show that this simple approach gives tight bounds for unary FDs but fails for general FDs. We then consider a second approach, inspired by size bounds for "},"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":"2607.13875","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-07-15T14:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"611793809f1bad3e499603deac062cca592e0e016042f162a0a08295406ea0eb","abstract_canon_sha256":"30b21f1116fc96dc8635298b132468995ed1ec84eb9db522ea43d469fe713774"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:23:11.113530Z","signature_b64":"I1dJJTH6dwoBzA2nG4JP3tHs2vwStt2MRi7Y3fLoobR9dxIj+RJE/E+FacAhXpoPyPCPsj4OPZJ8xOOWs5Z2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0468506f4eed5d704fd963a68b123d64773fa70bca2700e3ed63fdf231c3db86","last_reissued_at":"2026-07-16T01:23:11.112691Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:23:11.112691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexicographic Direct Access with Functional Dependencies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Florent Capelli, Nofar Carmeli, Stefan Mengel","submitted_at":"2026-07-15T14:24:27Z","abstract_excerpt":"We study the complexity of lexicographic direct access to join query answers over databases that satisfy functional dependencies (FDs). More precisely, we give fine-grained lower and upper bounds on the preprocessing time required to achieve polylogarithmic access time. We start by considering the simple approach of a reordered extension, which first incorporates the FDs in the query and order, and then ignores the FDs during evaluation. We show that this simple approach gives tight bounds for unary FDs but fails for general FDs. We then consider a second approach, inspired by size bounds for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13875","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.13875/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.13875","created_at":"2026-07-16T01:23:11.113123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.13875v1","created_at":"2026-07-16T01:23:11.113123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13875","created_at":"2026-07-16T01:23:11.113123+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARUFA32O5VOX","created_at":"2026-07-16T01:23:11.113123+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARUFA32O5VOXAT6Z","created_at":"2026-07-16T01:23:11.113123+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARUFA32O","created_at":"2026-07-16T01:23:11.113123+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/ARUFA32O5VOXAT6ZMOTIWER5MR","json":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR.json","graph_json":"https://pith.science/api/pith-number/ARUFA32O5VOXAT6ZMOTIWER5MR/graph.json","events_json":"https://pith.science/api/pith-number/ARUFA32O5VOXAT6ZMOTIWER5MR/events.json","paper":"https://pith.science/paper/ARUFA32O"},"agent_actions":{"view_html":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR","download_json":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR.json","view_paper":"https://pith.science/paper/ARUFA32O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.13875&json=true","fetch_graph":"https://pith.science/api/pith-number/ARUFA32O5VOXAT6ZMOTIWER5MR/graph.json","fetch_events":"https://pith.science/api/pith-number/ARUFA32O5VOXAT6ZMOTIWER5MR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR/action/storage_attestation","attest_author":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR/action/author_attestation","sign_citation":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR/action/citation_signature","submit_replication":"https://pith.science/pith/ARUFA32O5VOXAT6ZMOTIWER5MR/action/replication_record"}},"created_at":"2026-07-16T01:23:11.113123+00:00","updated_at":"2026-07-16T01:23:11.113123+00:00"}