Paper Citation Record · LEDGER

Lexicographic Direct Access with Functional Dependencies

As of 10 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2607.13875.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.13875 v1

Coverage vector

measured 26 of 26 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T03:36:54.259313Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

26 of 26 outbound references displayed

verified exact6
verified fuzzy0
unresolved20
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 11c4cded-7bf2-48d5-ad3c-253040e54618 · outbound

This paper cites Foundations of Databases.

Lexicographic Direct Access with Functional Dependencies Foundations of Databases

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.280440Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 615bfd66-67f4-4c70-8954-c24d76062072 · outbound

This paper cites Fast matrix multiplication meets the submodular width.

Lexicographic Direct Access with Functional Dependencies Fast matrix multiplication meets the submodular width

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.420790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97b9cbf2-2f26-47cc-9cb3-4cfb0d57b72a · outbound

This paper cites Computing join queries with functional dependencies.

Lexicographic Direct Access with Functional Dependencies Computing join queries with functional dependencies

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.540748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d91ce124-4958-42d3-9f56-2d772efa45a5 · outbound

This paper cites What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?.

Lexicographic Direct Access with Functional Dependencies What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.651099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31c3bad6-9fe7-4f28-a4b3-8fa66bdde3a0 · outbound

This paper cites Ngo, and Dan Suciu.

Lexicographic Direct Access with Functional Dependencies Ngo, and Dan Suciu

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.763659Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64872b2e-d364-4b55-b077-81fb56e19648 · outbound

This paper cites PANDAExpress: a Simpler and Faster PANDA Algorithm.

Lexicographic Direct Access with Functional Dependencies PANDAExpress: a Simpler and Faster PANDA Algorithm

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.861264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c00619cd-43ea-4f20-a058-09d7e9d3ab1c · outbound

This paper cites Width functions for hypertree decompositions (Weitefunktionen f \" u r Hyperbaumzerlegungen).

Lexicographic Direct Access with Functional Dependencies Width functions for hypertree decompositions (Weitefunktionen f \" u r Hyperbaumzerlegungen)

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:52.963670Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 824083cb-7f59-4233-8b41-fb6ada3beebd · outbound

This paper cites Computing the jth solution of a first-order query.

Lexicographic Direct Access with Functional Dependencies Computing the jth solution of a first-order query

Reference 8

Resolution: verified exact; doi, observed 2026-08-02T03:38:22.070529Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7f660b0f-0c3f-4561-bb9b-2dcef070e8ef · outbound

This paper cites Constant delay enumeration for conjunctive queries: a tutorial.

Lexicographic Direct Access with Functional Dependencies Constant delay enumeration for conjunctive queries: a tutorial

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.175818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e168a88d-765c-43eb-b95e-ef9057dd19b7 · outbound

This paper cites De la pertinence de l’ \'e num \'e ration: complexit \'e en logiques propositionnelle et du premier ordre.

Lexicographic Direct Access with Functional Dependencies De la pertinence de l’ \'e num \'e ration: complexit \'e en logiques propositionnelle et du premier ordre

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.273456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c0f253c1-d941-4a13-9807-bc6402b180fb · outbound

This paper cites Tight fine-grained bounds for direct access on join queries.

Lexicographic Direct Access with Functional Dependencies Tight fine-grained bounds for direct access on join queries

Reference 11

Resolution: verified exact; doi, observed 2026-08-02T03:38:22.001533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d36a3331-1333-47c1-a3f9-31f19707334e · outbound

This paper cites A simple algorithm for worst case optimal join and sampling.

Lexicographic Direct Access with Functional Dependencies A simple algorithm for worst case optimal join and sampling

Reference 12

Resolution: verified exact; doi, observed 2026-08-02T03:38:21.913981Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 8fabe5ba-a559-4111-92a9-6fdbed15039e · outbound

This paper cites Enumeration complexity of conjunctive queries with functional dependencies.

Lexicographic Direct Access with Functional Dependencies Enumeration complexity of conjunctive queries with functional dependencies

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.436800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b591badf-2ca2-4877-aa8b-4448b7f8e3ab · outbound

This paper cites Tractable orders for direct access to ranked answers of conjunctive queries.

Lexicographic Direct Access with Functional Dependencies Tractable orders for direct access to ranked answers of conjunctive queries

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.490092Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 291ef533-9232-4cdb-87b9-cbe65045dcca · outbound

This paper cites Answering (unions of) conjunctive queries using random access and random-order enumeration.

Lexicographic Direct Access with Functional Dependencies Answering (unions of) conjunctive queries using random access and random-order enumeration

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.537575Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04fd8981-0c67-4036-b78e-00f1d8d721d4 · outbound

This paper cites Partition constraints for conjunctive queries: Bounds and worst-case optimal joins.

Lexicographic Direct Access with Functional Dependencies Partition constraints for conjunctive queries: Bounds and worst-case optimal joins

Reference 16

Resolution: verified exact; doi, observed 2026-08-02T03:38:21.776940Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 3e4c3b48-2c62-4e71-9e0a-6d87365ea0ef · outbound

This paper cites Fast join project query evaluation using matrix multiplication.

Lexicographic Direct Access with Functional Dependencies Fast join project query evaluation using matrix multiplication

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.702910Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ac92a357-18c9-4c26-98ed-52a0a962a083 · outbound

This paper cites Entropy bounds for conjunctive queries with functional dependencies.

Lexicographic Direct Access with Functional Dependencies Entropy bounds for conjunctive queries with functional dependencies

Reference 18

Resolution: verified exact; doi, observed 2026-08-02T03:38:21.611457Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 016f32d2-a3f9-49a1-aaa9-42d607b04b44 · outbound

This paper cites Size and treewidth bounds for conjunctive queries.

Lexicographic Direct Access with Functional Dependencies Size and treewidth bounds for conjunctive queries

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.862426Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e166d62-1c68-4460-8d80-fdc59a35ff3a · outbound

This paper cites Output-optimal algorithms for join-aggregate queries.

Lexicographic Direct Access with Functional Dependencies Output-optimal algorithms for join-aggregate queries

Reference 20

Resolution: verified exact; doi, observed 2026-08-02T03:38:21.467993Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 799aa7c4-6a22-4514-bef1-a29ffdd7b2fa · outbound

This paper cites A simple guide to five normal forms in relational database theory.

Lexicographic Direct Access with Functional Dependencies A simple guide to five normal forms in relational database theory

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:53.963489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 925ec833-b042-4420-acae-e70d35206e1a · outbound

This paper cites Lower bounds based on the exponential time hypothesis.

Lexicographic Direct Access with Functional Dependencies Lower bounds based on the exponential time hypothesis

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:54.019591Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f663057-ae51-4e12-9f03-61e84837a93a · outbound

This paper cites Lower bounds for conjunctive query evaluation.

Lexicographic Direct Access with Functional Dependencies Lower bounds for conjunctive query evaluation

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:54.071825Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29a173cb-d596-405c-a808-474bcdbf81d2 · outbound

This paper cites an unresolved cited work.

Lexicographic Direct Access with Functional Dependencies Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:54.124237Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f56a863-3f54-4a07-96c1-6cc3caedff37 · outbound

This paper cites Ngo, Ely Porat, Christopher R \' e , and Atri Rudra.

Lexicographic Direct Access with Functional Dependencies Ngo, Ely Porat, Christopher R \' e , and Atri Rudra

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:54.196273Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2335f970-63bd-4458-9c93-adc1b5a9e2a9 · outbound

This paper cites Veldhuizen.

Lexicographic Direct Access with Functional Dependencies Veldhuizen

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-02T03:36:54.259313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.