{"as_of":"2026-08-10T16:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8cf13775628d8197deac8e0fbcdfc23c496e642265fe60269976a64c1edb91e","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T03:36:54.259313Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.13875/citation-record","integrity":"/paper/2607.13875/integrity","json":"/paper/2607.13875/citation-record.json","paper":"/paper/2607.13875"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:52.280440Z","title":"Foundations of Databases","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.280440Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:30ddbfe2838b0d665aa76c83e31d22cd283d54c13a0f8bab2c58bc43967087a5","observation_id":"11c4cded-7bf2-48d5-ad3c-253040e54618","resolution":{"observed_at":"2026-08-02T03:36:52.280440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:52.420790Z","title":"Fast matrix multiplication meets the submodular width","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.420790Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:d9a72c24c0d316290167b75eef589d9cd3b5f66d844971656d0d69a1e5d2c986","observation_id":"615bfd66-67f4-4c70-8954-c24d76062072","resolution":{"observed_at":"2026-08-02T03:36:52.420790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:52.540748Z","title":"Computing join queries with functional dependencies","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.540748Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:7b956f57cccd5882f78b5ced10764d74ac1b3110893a64739a0135c16fd06b6a","observation_id":"97b9cbf2-2f26-47cc-9cb3-4cfb0d57b72a","resolution":{"observed_at":"2026-08-02T03:36:52.540748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1612.02503","last_updated":"2023-12-23T20:48:44Z","snapshot_observed_at":"2026-08-05T13:53:23.451645Z","submitted_at":"2016-12-08T01:06:40Z","title":"What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.02503","snapshot_observed_at":"2026-08-02T03:36:52.651099Z","title":"Ngo, and Dan Suciu","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.651099Z"},"links":{"cited_paper":"/paper/1612.02503","citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:4dc2301b5d5a56156641b5fc8dfeb3ccd66ad74968d172f0378be211f758e659","observation_id":"d91ce124-4958-42d3-9f56-2d772efa45a5","resolution":{"observed_at":"2026-08-02T03:36:52.651099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:52.763659Z","title":"Ngo, and Dan Suciu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.763659Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:0061a7a9d04341fc3dd4e226025ae18812f006edf98a0aa86027b2588ac11bd8","observation_id":"31c3bad6-9fe7-4f28-a4b3-8fa66bdde3a0","resolution":{"observed_at":"2026-08-02T03:36:52.763659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.10217","snapshot_observed_at":"2026-08-02T03:36:52.861264Z","title":"Ngo, and Dan Suciu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.861264Z"},"links":{"cited_paper":"/paper/2512.10217","citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:038c319e119639ad924855ecf65e030e7dc2256eea81ef6c54bbdd52dd21b356","observation_id":"64872b2e-d364-4b55-b077-81fb56e19648","resolution":{"observed_at":"2026-08-02T03:36:52.861264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:52.963670Z","title":"Width functions for hypertree decompositions (Weitefunktionen f \\\" u r Hyperbaumzerlegungen)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.963670Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:2cc4845a1e0e31548550e0889f559edd88e7ac3f147da398df7d64de6f94b800","observation_id":"c00619cd-43ea-4f20-a058-09d7e9d3ab1c","resolution":{"observed_at":"2026-08-02T03:36:52.963670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1051/ita:2007046","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computing the jth solution of a first-order query","venue":"RAIRO - Theoretical Informatics and Applications","work_id":"37887352-7326-4299-89e8-5f67617f2eda","year":2008},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.069119Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:4a30dc0940addbd75f5a4f9ff819516666de490cb1b3a93bdb2299712eb14962","observation_id":"824083cb-7f59-4233-8b41-fb6ada3beebd","resolution":{"observed_at":"2026-08-02T03:38:22.070529Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.175818Z","title":"Constant delay enumeration for conjunctive queries: a tutorial","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.175818Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:8edaddd205f4620a44d7db8b2962e1045347f7d68e0b13909c4cc8f0758d9454","observation_id":"7f660b0f-0c3f-4561-bb9b-2dcef070e8ef","resolution":{"observed_at":"2026-08-02T03:36:53.175818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.273456Z","title":"De la pertinence de l’ \\'e num \\'e ration: complexit \\'e en logiques propositionnelle et du premier ordre","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.273456Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:889a25afeea324238616018bc42a3b94c009fcf2b55bc48e50fc986fb62c38c3","observation_id":"e168a88d-765c-43eb-b95e-ef9057dd19b7","resolution":{"observed_at":"2026-08-02T03:36:53.273456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3707448","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:38:21.938039Z","title":"Tight fine-grained bounds for direct access on join queries","venue":null,"work_id":"bf0cf18d-2515-4e9f-a743-5f096b450196","year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.314011Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:1e6c2ac784d1ba236d840442debd79f7775f8dff54614af5147ffb812731c6a6","observation_id":"c0f253c1-d941-4a13-9807-bc6402b180fb","resolution":{"observed_at":"2026-08-02T03:38:22.001533Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icdt.2025.23","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A simple algorithm for worst case optimal join and sampling","venue":"arXiv (Cornell University)","work_id":"4e8bff5f-c3d0-43ab-bcc0-9b5db039b3a5","year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.390227Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:bacbd682fe040ac1013f12c224ccaf3273369c329cc5c133bee78078b57fa007","observation_id":"d36a3331-1333-47c1-a3f9-31f19707334e","resolution":{"observed_at":"2026-08-02T03:38:21.913981Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.436800Z","title":"Enumeration complexity of conjunctive queries with functional dependencies","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.436800Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:eeb8e1a1a34ef371fbdd3f878b77f78c0720992996c7deb9e9542c27937fcbd1","observation_id":"8fabe5ba-a559-4111-92a9-6fdbed15039e","resolution":{"observed_at":"2026-08-02T03:36:53.436800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.490092Z","title":"Tractable orders for direct access to ranked answers of conjunctive queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.490092Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:eb99ea252f31afc6b0d30d1fbda8d0a0fc9aad7720580fb6a6c13f78ad6e2d1f","observation_id":"b591badf-2ca2-4877-aa8b-4448b7f8e3ab","resolution":{"observed_at":"2026-08-02T03:36:53.490092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.537575Z","title":"Answering (unions of) conjunctive queries using random access and random-order enumeration","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.537575Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:80b440b91abb57ded2631aab56009f82668209b4e06a19ad483f51d3f5a02808","observation_id":"291ef533-9232-4cdb-87b9-cbe65045dcca","resolution":{"observed_at":"2026-08-02T03:36:53.537575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icdt.2025.17","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Partition constraints for conjunctive queries: Bounds and worst-case optimal joins","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"9d454515-fce2-4842-a8ef-ca4e7c85b74b","year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.604567Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:66d7db3079fa3488b97099299f93faf2636ce8b3c1435085ce97e6263e8f321f","observation_id":"04fd8981-0c67-4036-b78e-00f1d8d721d4","resolution":{"observed_at":"2026-08-02T03:38:21.776940Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.702910Z","title":"Fast join project query evaluation using matrix multiplication","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.702910Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:2cb7e1105e20a1a087b51e8c47c3d79f93fb73e18d31ee8f0ac97603de6915a9","observation_id":"3e4c3b48-2c62-4e71-9e0a-6d87365ea0ef","resolution":{"observed_at":"2026-08-02T03:36:53.702910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icdt.2017.15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Entropy bounds for conjunctive queries with functional dependencies","venue":"ArXiv.org","work_id":"f6b09ec4-0897-4ca0-8770-9232bbff82ef","year":2017},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.786071Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:ed013d7f7f0cc80104bdf188fdc32d4740aa0fe42d14ea542e11e07f194eb625","observation_id":"ac92a357-18c9-4c26-98ed-52a0a962a083","resolution":{"observed_at":"2026-08-02T03:38:21.611457Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.862426Z","title":"Size and treewidth bounds for conjunctive queries","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.862426Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:cb97d55463c110e4f1bb77c928d8004bb6b9bb60a5ec2bbc7c2ab12cb0d33bba","observation_id":"016f32d2-a3f9-49a1-aaa9-42d607b04b44","resolution":{"observed_at":"2026-08-02T03:36:53.862426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3725241","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Output-optimal algorithms for join-aggregate queries","venue":"Proceedings of the ACM on Management of Data","work_id":"f51b2f21-9052-4947-9985-66248e312e65","year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.912701Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:e46d6f76613beb951b146fd839f0bfcc661445dfa7c0f1c94cd2ce3f49e085cc","observation_id":"9e166d62-1c68-4460-8d80-fdc59a35ff3a","resolution":{"observed_at":"2026-08-02T03:38:21.467993Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:53.963489Z","title":"A simple guide to five normal forms in relational database theory","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:53.963489Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:264e6b682e5e10427c8bcec25d2d3560fe9847f10693f03a696968b31c3cf2ce","observation_id":"799aa7c4-6a22-4514-bef1-a29ffdd7b2fa","resolution":{"observed_at":"2026-08-02T03:36:53.963489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:54.019591Z","title":"Lower bounds based on the exponential time hypothesis","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:54.019591Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:c4aecf554bc47ed62cc019a5856426fdb991c335d7b07f5cb36b9006d1e8a96d","observation_id":"925ec833-b042-4420-acae-e70d35206e1a","resolution":{"observed_at":"2026-08-02T03:36:54.019591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:54.071825Z","title":"Lower bounds for conjunctive query evaluation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:54.071825Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:275f88af6ada54fc210f23d2b98c556cc78c997e8f056733530189ebc9f3c3e6","observation_id":"6f663057-ae51-4e12-9f03-61e84837a93a","resolution":{"observed_at":"2026-08-02T03:36:54.071825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:54.124237Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:54.124237Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:795617fe3d5a280b60b8f5751909e04cc3d669d00e546eb572d6185b91c6e58c","observation_id":"29a173cb-d596-405c-a808-474bcdbf81d2","resolution":{"observed_at":"2026-08-02T03:36:54.124237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:54.196273Z","title":"Ngo, Ely Porat, Christopher R \\' e , and Atri Rudra","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:54.196273Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:3ab6f0bad957fbf0aaf58c99a8ed79719e2230f877366f55fa9238269e61502f","observation_id":"5f56a863-3f54-4a07-96c1-6cc3caedff37","resolution":{"observed_at":"2026-08-02T03:36:54.196273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T03:36:54.259313Z","title":"Veldhuizen","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:54.259313Z"},"links":{"citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:178f6e5d4d6023e4566fe8409a2dd8828434598c1f63f254e1499bb39fb139a6","observation_id":"2335f970-63bd-4458-9c93-adc1b5a9e2a9","resolution":{"observed_at":"2026-08-02T03:36:54.259313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T19:40:25.903280Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":26},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"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."}