{"as_of":"2026-08-22T21:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ff260bd52f760a89fe17e02d1b1523bb9f1ca38cc5a11fdc59cdb0bad12b618","coverage":[{"denominator":85,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":85,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:17:20.592574Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T09:42:28.508680Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.17702","snapshot_observed_at":"2026-07-11T09:42:28.508680Z","title":"Lower bounds for conjunctive query evaluation.CoRR, abs/2506.17702, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"cited_paper":"/paper/2506.17702","citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:0799e9360aecab77ae1a1c6a4b293eb4b03a009df4c337c0e5dc459db323a1cf","observation_id":"fc8ff1ed-9a65-49fe-baeb-a854949b449d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.17702/citation-record","integrity":"/paper/2506.17702/integrity","json":"/paper/2506.17702/citation-record.json","paper":"/paper/2506.17702"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.249633Z","title":"If the Current Clique Algorithms Are Optimal, so Is Valiant’s Parser","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.249633Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:71b5abe9dd91d51fd6a1250ed1cd4f76d94049b704815e105bc0195b659bcc6d","observation_id":"e98fcda3-c3e0-484f-a4d0-2486854d0e12","resolution":{"observed_at":"2026-08-15T19:17:20.249633Z","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.1137/1.9781611977912.167","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.136123Z","title":"The time complexity of fully sparse matrix multiplication","venue":null,"work_id":"d5058e41-ca62-4ebc-96b6-a74e2624c922","year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.254303Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:f86161d137934ff9cba86275f6e539d27794a0516b7aa24d4ba9bf5a54216170","observation_id":"4f032cc6-8ff1-4fdc-ae29-4e3e38504d48","resolution":{"observed_at":"2026-08-15T19:17:21.141483Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.259231Z","title":"Faster combinatorial k-clique algorithms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.259231Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:070d9b94f7899397a9f57d2f9fa652d54fe40f8a54d119d5bb5e15a201beca1c","observation_id":"8a3b943f-985e-40e4-931e-c448a9a4c502","resolution":{"observed_at":"2026-08-15T19:17:20.259231Z","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-15T19:17:20.263982Z","title":"Popular conjectures imply strong lower bounds for dynamic problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.263982Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:413bef81ce43a7731a81480bdd0b25d40e7469b7fae9db5204c08192a93390b6","observation_id":"762e6ad6-b80a-4287-9bdd-0f3500f73f1e","resolution":{"observed_at":"2026-08-15T19:17:20.263982Z","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-15T19:17:20.268056Z","title":"More asymmetry yields faster matrix multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.268056Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:c5d8f795de1744738b3e5e593e39518fb7cb29b83119caebc98f6cb51e4c7929","observation_id":"dcbb7deb-ebe7-415c-a70f-74fd68e0afbc","resolution":{"observed_at":"2026-08-15T19:17:20.268056Z","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-15T19:17:20.272626Z","title":"Finding and counting given length cycles","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.272626Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:c91b79551381b0358aa6feaa3d14bd3b3cde1b08fedcf0db19ad9e210a66a77c","observation_id":"aa70a284-3d97-4161-87e1-17ea40de9911","resolution":{"observed_at":"2026-08-15T19:17:20.272626Z","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-15T19:17:20.280659Z","title":"Ranked enumeration for MSO on trees via knowledge compilation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.280659Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:7a65664628d5be6d694d76a81161671be4e4ac867e1820f89ac6b5a810b96254","observation_id":"b8c94a56-688d-4f1a-8dd2-c1a841d14263","resolution":{"observed_at":"2026-08-15T19:17:20.280659Z","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/1514894","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.084157Z","title":"Faster join-projects and sparse matrix multiplications","venue":null,"work_id":"3e760cf6-d990-46f4-9d7c-ba4cdea1f62f","year":2009},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.284836Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:92017add94fdba8d34a6fcfaa740d92c00fbc1179d19c0efbfb95f5d0587e2a5","observation_id":"fa435db5-746b-4976-a97c-565cef25ce21","resolution":{"observed_at":"2026-08-15T19:17:21.088981Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.288763Z","title":"Open access at https: //github.com/pdm-book/community, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.288763Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:3680907f12c06c6c5def29c1de0e75a168be705107dad647188165dca621f4ba","observation_id":"c449ed77-c34f-461f-960f-81472c58daa0","resolution":{"observed_at":"2026-08-15T19:17:20.288763Z","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-15T19:17:20.293092Z","title":"Size bounds and query plans for relational joins","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.293092Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:dce60d2baf01b1b3d1cc57ae583dda5664ad0aeadd43a7d348e1c04acad295f3","observation_id":"2df55484-bd9b-41ca-9ce7-21255b33af98","resolution":{"observed_at":"2026-08-15T19:17:20.293092Z","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-15T19:17:20.296966Z","title":"Algorithmes et complexité des problèmes d’énumération pour l’évaluation de requêtes logiques","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.296966Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:c600adc06fc6761a244857965932bf778502916a8418af3047cc587c1d4a7f07","observation_id":"eea03fc1-73b1-4fcc-820f-31de9fb5c39f","resolution":{"observed_at":"2026-08-15T19:17:20.296966Z","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-15T19:17:20.300750Z","title":"On acyclic conjunctive queries and constant delay enumeration","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.300750Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:403e4cd296f4428c17ea4055bf805b6a24db6a84aecb11a34fae465689e83c51","observation_id":"b6447426-e25f-4077-bc74-fc6cf353ce19","resolution":{"observed_at":"2026-08-15T19:17:20.300750Z","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-15T19:17:20.304966Z","title":"On the desirability of acyclic database schemes","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.304966Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:7c0fa30c00067d9b0e25f667101f9a2a411be97aadc675ecf24628151a5418d3","observation_id":"afa753aa-c078-4b31-8119-777d1d0f9039","resolution":{"observed_at":"2026-08-15T19:17:20.304966Z","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-15T19:17:20.309214Z","title":"Constant delay enumeration for conjunctive queries: a tutorial","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.309214Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:3bb0bf5959b3823ae7de5e9e4eae2e15f65ce2a21bf09234512d2872d25f2344","observation_id":"e9a1a037-fce1-4811-b479-1ee5bdba303a","resolution":{"observed_at":"2026-08-15T19:17:20.309214Z","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-15T19:17:20.312932Z","title":"Answering conjunctive queries under updates","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.312932Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:d6a49bf74cf050b5d7ba9d5c22fca9143211c86e455169d3e5f92a3658d4795d","observation_id":"4f5e8c3d-39e0-4fc2-aaa8-40012f7225fd","resolution":{"observed_at":"2026-08-15T19:17:20.312932Z","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-15T19:17:20.316836Z","title":"Answering ucqs under updates and in the presence of integrity constraints","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.316836Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:5879d6a0e1da45d3fe3a3e190113779989e9954a557b0fddda7c9420309879a1","observation_id":"1961590b-b50f-4f99-b55c-cfa3b6443e2b","resolution":{"observed_at":"2026-08-15T19:17:20.316836Z","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.1016/s0885-064x(02)00007-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.046122Z","title":"On the complexity of the multiplication of matrices of small formats","venue":null,"work_id":"2fffe9c6-9105-48f6-88f0-dd3d86d510e3","year":2003},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.320180Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:80bb3bf5d363aabd1f7d4acc6588b16e165790bf321ca039ca1afe43635a7d0d","observation_id":"e163ffa8-94cd-4b7e-8708-3fc47cd71045","resolution":{"observed_at":"2026-08-15T19:17:21.050446Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.csl.2012.137","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.032817Z","title":"A negative conjunctive query is easy if and only if it is beta-acyclic","venue":null,"work_id":"7e2e103f-8689-43cc-9a1b-e4b458394df5","year":2012},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.325228Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:de577648d6b94cf1820ff850981d2ec44f6845bd30c0d1b7e024f535664de440","observation_id":"a8a1acec-159a-4bb2-9fb1-f403c0ecbfab","resolution":{"observed_at":"2026-08-15T19:17:21.037147Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.329894Z","title":"De la pertinence de l’énumération : complexité en logiques propositionnelle et du premier ordre","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.329894Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:4075fd74c2e605df524e4affe3d6bdc7cbe9fce0bb7eeb67a983ca43f29368f0","observation_id":"9ef4651f-1059-4cc7-b67a-9770ee95e3a8","resolution":{"observed_at":"2026-08-15T19:17:20.329894Z","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-15T19:17:20.333905Z","title":"Hypergraph acyclicity revisited","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.333905Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:bfa364de746c1df21a8c4eca416bf0ba7413cb89f7a194aa4d00b26c0e8b0695","observation_id":"dec7f184-569a-4d73-84a9-f623a6c18368","resolution":{"observed_at":"2026-08-15T19:17:20.333905Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/lmcs-21(1:29)2025","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.020603Z","title":"Unbalanced triangle detection and enumeration hardness for unions of conjunctive queries","venue":null,"work_id":"564927ec-b5c5-42fb-98e5-6c23af81a6ad","year":2025},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.337862Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:b5726fc9ea68539792011ee6b0f4d571d85471fa65983f47f0cfb2c2f2d2c421","observation_id":"0926174c-2e0e-471a-8e2c-6e99efbb1c4d","resolution":{"observed_at":"2026-08-15T19:17:21.024674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.341799Z","title":"Tight fine-grained bounds for direct access on join queries","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.341799Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:5887ce5bf6cfb75f98e37e6c215df9e19f3f8827b32d500ce08c99a92bda83b5","observation_id":"c28fcbb1-d93a-4675-913c-a5bb5a0f6e99","resolution":{"observed_at":"2026-08-15T19:17:20.341799Z","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.1137/1.9781611977912.10","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.008620Z","title":"Dynamic dynamic time warping","venue":null,"work_id":"3c8f12a7-2483-47a6-8f35-cbb489f71d5a","year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.345660Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:aa1518ada09ef01124bd9a52092354d56531879569a8ef9bfc1c160fde13bf77","observation_id":"6619e549-3dd8-4b45-beae-cf825a4fcb9a","resolution":{"observed_at":"2026-08-15T19:17:21.013009Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2310.15800","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.992298Z","title":"Direct access for conjunctive queries with negation","venue":null,"work_id":"9f63a486-7b78-46b4-9e48-ed9dda528099","year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.349661Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:fb9d81e6049823be6af39086741ac70cd7a5a680db2d37ba8628ff03ece213d6","observation_id":"e53b917e-2e96-4f8a-979c-6f1daab2b665","resolution":{"observed_at":"2026-08-15T19:17:20.998606Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.353529Z","title":"On the enumeration complexity of unions of conjunctive queries","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.353529Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:13f198b547efd00b67e28a8704e6d1c0316757612730ecbd35155f26207ddce3","observation_id":"31491fe9-aaa3-428d-84c3-0629e2774960","resolution":{"observed_at":"2026-08-15T19:17:20.353529Z","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-15T19:17:20.361924Z","title":"Tractable orders for direct access to ranked answers of conjunctive queries","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.361924Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:819f843c48b3c0802bdc807bcfd57cc450fc489e0e2dda73b9daef9222029b7a","observation_id":"79baef83-7315-4067-be5c-669ec575ff04","resolution":{"observed_at":"2026-08-15T19:17:20.361924Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.874802Z","title":null,"venue":null,"work_id":"9aebd2e1-543e-4566-a709-f34791c0726a","year":null},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.366071Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:dcf9dfeb852842790ad9e1ee5a7da11fd09b047c22353d1919d1e9ca314f819c","observation_id":"df263c48-65f9-46e6-882b-2c1cdf10e568","resolution":{"observed_at":"2026-08-15T19:17:22.879903Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.374312Z","title":"Chandra and Philip M","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.374312Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:7680e648479d770f2761b313ed6005b5be0a6675b074bc959ea2f9481f1a3096","observation_id":"787143f7-3883-49ff-a961-f13d2db3b5be","resolution":{"observed_at":"2026-08-15T19:17:20.374312Z","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.2015.110","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.884762Z","title":"A trichotomy in the complexity of counting answers to conjunctive queries","venue":null,"work_id":"96927509-9ef1-4f50-8874-7878926e96e7","year":2015},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.378525Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:ecbc383945a7c99c45076f11da19991c17337b9f3c069812fef831a5966a18ac","observation_id":"b8aeedf0-d95b-43c2-b957-2919107c420d","resolution":{"observed_at":"2026-08-15T19:17:20.889982Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.381878Z","title":"On the asymptotic complexity of matrix multiplication","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.381878Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:55f155b325dc2ba4724eca031f8ca5ad868438eba9c632a6a4e49d93ebd97fd9","observation_id":"1c4c4c15-0d3d-44f8-8bbd-ce64ae832303","resolution":{"observed_at":"2026-08-15T19:17:20.381878Z","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-15T19:17:20.385961Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.385961Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:9175680fbfaaf11a3f7b562cacffb6203983a1ab5d3723dbabf983b67e4f5ae0","observation_id":"8b14c97f-7fce-4256-bae3-5dc79f057313","resolution":{"observed_at":"2026-08-15T19:17:20.385961Z","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-15T19:17:20.390566Z","title":"Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.390566Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:b08c2951881036931c0403d12808ec97e7b1776d6885e9f1178f80a63d8f8316","observation_id":"87e002af-5973-49e5-b215-8c0343d8f4c6","resolution":{"observed_at":"2026-08-15T19:17:20.390566Z","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.1137/20m1335054","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.849078Z","title":"Graph pattern detection: Hardness for all induced patterns and faster noninduced cycles","venue":null,"work_id":"3d6b538c-87c9-4da1-858d-9d7bd7cf208b","year":2021},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.394747Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:2af1416dfb278506f6d74cd73413ff4d4e31ed68eafc65416ec77271a4a0cf45","observation_id":"0a8ee7a5-6f3e-4c62-b03a-3499749f235e","resolution":{"observed_at":"2026-08-15T19:17:20.853649Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.398929Z","title":"The complexity of counting homomorphisms seen from the other side.Theor","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.398929Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:1ea13b7be8ea74f32e45d5ceb35adf19a7f241499ebe96b7366fc217501168c8","observation_id":"0e0abecf-924a-4c4d-9ec3-e4e375ce9f85","resolution":{"observed_at":"2026-08-15T19:17:20.398929Z","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-15T19:17:20.404242Z","title":"Ranked enumeration of join queries with projections.Proc","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.404242Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:c7642c4c97705dccd2635b5f48d04dff7a6d2b0f0c51736f446fbdb494158654","observation_id":"f518b353-9f80-4976-8089-a92a0c615dfb","resolution":{"observed_at":"2026-08-15T19:17:20.404242Z","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-15T19:17:20.408214Z","title":"Counting answers to existential questions","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.408214Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:a7d1c503db714322d95350a0364528d476c2d42698b47f23383d5479187940a1","observation_id":"a96f34af-38d3-4b04-9e61-52ab07b35125","resolution":{"observed_at":"2026-08-15T19:17:20.408214Z","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":"8496.24485","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.227347Z","title":"Structural tractability of counting of solutions to conjunctive queries","venue":null,"work_id":"ac6d640c-a11d-4ba6-a687-d0ee016e9b57","year":2013},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.412332Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:5570226d8b829fe75d8aee1c444506d9fcb69b3aa12b0075687c1abb9f0f1c6b","observation_id":"163db625-9045-4882-83ab-211af6077f16","resolution":{"observed_at":"2026-08-15T19:17:22.233503Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2013.08.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.820219Z","title":"The complexity of weighted counting for acyclic conjunctive queries","venue":null,"work_id":"89fa88df-b26a-4c87-bfbe-7c60278e9b5b","year":2014},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.417604Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:03734ed5c5320e6b02172568b6b478edc3354ac3041b27b10c1c98bd81c8edd3","observation_id":"691d5b57-a45d-4216-9047-3672c35a2bdc","resolution":{"observed_at":"2026-08-15T19:17:20.824800Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.422367Z","title":"On the complexity of fixed parameter clique and dominating set","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.422367Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:dcca8d6150cd1cb08f63209530b5e25a70f51ccda137906c6e4b647e0d13b88d","observation_id":"ff105773-31b6-4dee-9a7c-ed2c5979a5b6","resolution":{"observed_at":"2026-08-15T19:17:20.422367Z","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-15T19:17:20.427240Z","title":"Fan, Paraschos Koutris, and Hangdong Zhao","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.427240Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:cf93ea8ed9a65c5925e8df3045fd8ff379b434ca3abbf0c379c2107c996dd578","observation_id":"99db5108-5192-4bbb-b7b8-d6f19cb68e22","resolution":{"observed_at":"2026-08-15T19:17:20.427240Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.858408Z","title":"Logic and algorithms in database theory and ai boot camp","venue":null,"work_id":"75326e38-c669-4d52-a439-945cf8a502c6","year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.432104Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:4af03d979b98321c71935439aa60f86fe7f4bc848c9bf7c51656b99704a23766","observation_id":"e66cda58-4629-4d81-953c-06be4e7ff33b","resolution":{"observed_at":"2026-08-15T19:17:22.866354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.436085Z","title":"Overmars","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.436085Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:0ceac5c0169a04585eb364dde0145aa2b02c6b7a0e5b796b4fcaf5702d211ead","observation_id":"b5fd43a2-7e73-499d-8f49-5c26a1bf8a82","resolution":{"observed_at":"2026-08-15T19:17:20.436085Z","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-15T19:17:20.440696Z","title":"Faster algorithms for rectangular matrix multiplication","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.440696Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:7cafe6c83ad4bd76ff4ae05c49654f06e87f78d4029ba26596f5d452d2b2325a","observation_id":"76a71a60-3cbc-4ea0-b1c5-58f9273875ae","resolution":{"observed_at":"2026-08-15T19:17:20.440696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.13851","last_updated":"2023-02-21T08:37:26Z","snapshot_observed_at":"2026-08-20T04:32:03.736729Z","submitted_at":"2022-06-28T09:30:08Z","title":"Which arithmetic operations can be performed in constant time in the RAM model with addition?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.13851","snapshot_observed_at":"2026-08-15T19:17:20.445106Z","title":"Which arithmetic operations can be performed in constant time in the RAM model with addition? CoRR, abs/2206.13851, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.445106Z"},"links":{"cited_paper":"/paper/2206.13851","citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:b0a710f9772bcf36933ef12733a9fa5aaef4a7ddd5e504995e5a166c3d9cbb76","observation_id":"5cec9e46-69e9-4325-aad6-700d5becfb22","resolution":{"observed_at":"2026-08-15T19:17:20.445106Z","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-15T19:17:20.449371Z","title":"Counting solutions to conjunctive queries: structural and hybrid tractability","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.449371Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:8ebee9f92fcc7e9be6acbd674e168f72fed65b50f39f1f7808b664077ff709ed","observation_id":"f5687b4c-6dc9-4079-8662-5506d82d00a4","resolution":{"observed_at":"2026-08-15T19:17:20.449371Z","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":"7411.63742","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.081192Z","title":"Parameterized complexity for the database theorist","venue":null,"work_id":"1b9e783f-f0fc-4bff-a4fb-10a2a66d64dd","year":2002},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.452902Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:fd33028ff0cfd8ead09ac9d55a63ab3bc108e5cd02c3d76935f7464eb159af0c","observation_id":"f9726fca-5c13-456c-9e9c-9429f2aceaf8","resolution":{"observed_at":"2026-08-15T19:17:22.087662Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.455928Z","title":"The complexity of homomorphism and constraint satisfaction problems seen from the other side","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.455928Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:ab4d60aac62440e913826013ebf1ca7168fe641cab07e768bd22c59f35e41842","observation_id":"05c86b8c-1059-45ab-8eb8-a08627e98b97","resolution":{"observed_at":"2026-08-15T19:17:20.455928Z","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-15T19:17:20.459510Z","title":"When is the evaluation of conjunctive queries tractable? In Jeffrey Scott Vitter, Paul G","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.459510Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:f6519c61cdc12c2b55f542c4ff9d618e9f40d31b31263af19783d062f0ce8589","observation_id":"58d6483a-8b43-4f4b-a762-6ef475da8d2a","resolution":{"observed_at":"2026-08-15T19:17:20.459510Z","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-15T19:17:20.462743Z","title":"Fast matrix multiplication for query processing.Proc","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.462743Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:1e76f48515e4b0e7f77e25d9f627b92de3ac685a06fdc23a941d3df52d6e12c7","observation_id":"54745be9-4fe1-4dce-85dc-c5514c0b068b","resolution":{"observed_at":"2026-08-15T19:17:20.462743Z","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-15T19:17:20.466001Z","title":"On the complexity of k-sat","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.466001Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:e66a9c2527678da71d226ed61155e7e43e7188d3e56fa34fc553935415b8a6ca","observation_id":"61585989-dce6-41b5-834b-90fc2919932a","resolution":{"observed_at":"2026-08-15T19:17:20.466001Z","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-15T19:17:20.469966Z","title":"Which problems have strongly exponential complexity? J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.469966Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:bea2fd48a934e67b5c72b9ad9fed2139319d3ead129367007f010867d8042f61","observation_id":"f0914f92-2392-412e-977d-87b4c83dcba6","resolution":{"observed_at":"2026-08-15T19:17:20.469966Z","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-15T19:17:20.473648Z","title":"Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.473648Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:102b274d5fb4a2f295ed4e8eb0ab856640e30ac85e406e8163b66f24ff5608b5","observation_id":"8428ba4a-5037-4a93-a67d-58ec8a0a22a7","resolution":{"observed_at":"2026-08-15T19:17:20.473648Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.845760Z","title":"Trade-offs in static and dynamic evaluation of hierarchical queries","venue":null,"work_id":"899b561a-09c8-4418-a8cc-7551f20ba902","year":2020},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.477231Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:9d711b1e6b7b02d2641ea98ebe42a4b5326e5add53775cff27df2ba189c2f128","observation_id":"6f916dcb-cdfd-43d5-bd81-58b61b596628","resolution":{"observed_at":"2026-08-15T19:17:22.850331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.icdt.2023.17","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.753020Z","title":"Conjunctive queries with free access patterns under updates","venue":null,"work_id":"cc2d0786-adb2-4dc5-8681-e68f87875108","year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.485020Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:f20f502aabd008ced445cf6f4eef06c25b6c59096c8ed67ab894b83e3f997e6b","observation_id":"7d3c282b-5e28-442a-b4fe-4a99a7aecc72","resolution":{"observed_at":"2026-08-15T19:17:20.757447Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.489133Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.489133Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:c8758feb84c1202435de4242101bd9942c0cdb8bda22bf91999b657dd063ec0b","observation_id":"8611869a-713a-4c2f-9132-56d315870944","resolution":{"observed_at":"2026-08-15T19:17:20.489133Z","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-15T19:17:20.492977Z","title":"Curtin, Benjamin Moseley, Hung Q","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.492977Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:bf39d903b40adba420a9d20b5f5e36e5bf32e25172d93348e53373c1392b6c47","observation_id":"8ae9fdd1-2630-493b-a504-d19c205656d3","resolution":{"observed_at":"2026-08-15T19:17:20.492977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06189","last_updated":"2026-07-03T02:55:25Z","snapshot_observed_at":"2026-08-17T21:38:46.990547Z","submitted_at":"2024-12-09T03:57:03Z","title":"Fast Matrix Multiplication meets the Submodular Width","version":5},"cited_work":{"arxiv_id":"2412.06189","doi":"10.48550/arxiv.2412.06189","metadata_source":"pith","pith_arxiv_id":"2412.06189","snapshot_observed_at":"2026-08-16T12:16:17.039197Z","title":"Fast Matrix Multiplication meets the Submodular Width","venue":"cs.DB","work_id":"5bd5d46c-0021-4fc6-a048-949fec61458f","year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.496742Z"},"links":{"cited_paper":"/paper/2412.06189","citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:060115ad0a7adf7b033f411354fd1e7a088d8663400bac7c6158397098781b17","observation_id":"838fae22-7d05-4de7-bf91-ae453d006935","resolution":{"observed_at":"2026-08-15T19:17:20.730611Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.500807Z","title":"Ngo, and Atri Rudra","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.500807Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:bdccc0d5b9784979e582d3f29bc040b0b25f27b7159d65731ac3f393c8f90678","observation_id":"5f1dea20-2373-4ecf-88d9-c424a858f8d8","resolution":{"observed_at":"2026-08-15T19:17:20.500807Z","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-15T19:17:20.504522Z","title":"Ngo, and Dan Suciu","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.504522Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:e6d66ac0ce594cc2500ec7f56bc4b4c3502a3238fd00774a503e570e6036e0f9","observation_id":"653b6b8f-66ac-46b0-b42b-a816eff81312","resolution":{"observed_at":"2026-08-15T19:17:20.504522Z","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-15T19:17:20.508387Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.508387Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:8b49bf5f2af0a7407a1f8d9956a6d771911676a0ed2af92a2b122c655f98d378","observation_id":"56a00c59-7db2-4606-ade8-76bdbb063660","resolution":{"observed_at":"2026-08-15T19:17:20.508387Z","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-15T19:17:20.511802Z","title":"Tractable hypergraph properties for constraint satisfaction and conjunctive queries","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.511802Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:3507ebb90f978aef561a754c95c5a5f3fe59a0169354191b5b50c92f4be33727","observation_id":"c1fbb0e9-500f-4bf3-aa04-7dcca370752b","resolution":{"observed_at":"2026-08-15T19:17:20.511802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.01108","last_updated":"2021-12-02T10:33:18Z","snapshot_observed_at":"2026-08-16T17:37:36.304637Z","submitted_at":"2021-12-02T10:33:18Z","title":"A short note on the counting complexity of conjunctive queries","version":1},"cited_work":{"arxiv_id":"2112.01108","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.01108","snapshot_observed_at":"2026-08-15T19:17:21.511561Z","title":"A short note on the counting complexity of conjunctive queries","venue":"cs.LO","work_id":"ccc74618-4877-4725-b351-8a19c923bfbf","year":2021},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.515507Z"},"links":{"cited_paper":"/paper/2112.01108","citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:85920bf87e87d80fd7d38722e71861573f3538db6e3214574d8f81edb310c08d","observation_id":"17841352-78cd-4c0d-b113-a9ad56c03350","resolution":{"observed_at":"2026-08-15T19:17:21.516254Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.832925Z","title":"On the complexity of the subgraph problem","venue":null,"work_id":"df490332-05b2-4241-b7a3-f703174966c4","year":1985},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.519953Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:0cac0d591b8f8ca2ef38173e922bc4fdef1056d2eecad540c57f630ea71ae81a","observation_id":"80d1be0e-843f-4b8e-ba5f-a124393aa2fa","resolution":{"observed_at":"2026-08-15T19:17:22.837063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.523844Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.523844Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:061a288c08d5f21452098606cd91f9b60d22bba57599eb87dd6c77aa37f37b3a","observation_id":"b41d5581-4323-49ec-bd46-4db5b74ee5ce","resolution":{"observed_at":"2026-08-15T19:17:20.523844Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.818274Z","title":"Ngo, Ely Porat, Christopher Ré, and Atri Rudra","venue":null,"work_id":"72a85f07-6ad9-4a96-85ad-630d523e200d","year":null},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.527275Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:a65d16c469c6daa560eb7c938a1528b855bc52baaee11135f2bd6ac45b3fdeb7","observation_id":"d663721f-9c5a-4be7-84be-0583d6b510be","resolution":{"observed_at":"2026-08-15T19:17:22.823102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.530712Z","title":"Size bounds for factorised representations of query results","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.530712Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:a48cd7f66d473d14fa6c1a9e3a36cb25b3ca72282dc157eedf51ac040b486de1","observation_id":"47d4183e-87dc-4391-9064-3b253f3b0c2c","resolution":{"observed_at":"2026-08-15T19:17:20.530712Z","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-15T19:17:20.533980Z","title":"On the possibility of faster SAT algorithms","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.533980Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:d9f7f4b0b39c785c108dd1e9010be17e2d758bfc29107591fe397e1512ec39aa","observation_id":"cb5666d0-56fa-4c9a-95ef-11ecf8b75272","resolution":{"observed_at":"2026-08-15T19:17:20.533980Z","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-15T19:17:20.537695Z","title":"Tractable counting of the answers to conjunctive queries","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.537695Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:891900fdf46c875c151e5dc5a28ef6dd4e5c36783cae0fb8ce935d30491e5a1d","observation_id":"c5ebcd1c-db7c-45ba-828d-354211ad7d7d","resolution":{"observed_at":"2026-08-15T19:17:20.537695Z","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.stacs.2014.13","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.667602Z","title":"A glimpse on constant delay enumeration (invited talk)","venue":null,"work_id":"a5c45d3b-e02d-40d4-9629-fa13c1e56697","year":2014},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.541125Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:6f4256488d126eacfacd2b6ac04987fc5c2de16e3b0b034afa1914974a6dfe4c","observation_id":"d6288dfc-0be4-46d8-8074-c238bdfd8dd2","resolution":{"observed_at":"2026-08-15T19:17:20.672320Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3888.27838","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.411575Z","title":"Constant delay enumeration for conjunctive queries","venue":null,"work_id":"2a6fe13d-c622-4c15-816a-4788c90153db","year":2015},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.545000Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:4db4756c6a45ee827251f726b2b147c10cad7c12522733fc774c504975359b29","observation_id":"a5e1825e-0e22-4ec2-bf53-ebebaeecd4d7","resolution":{"observed_at":"2026-08-15T19:17:21.418732Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.806732Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":"6ecc8da2-aff8-4df7-aa09-0a49c05c9efc","year":1969},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.548876Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:4b905f409c1e8dcb6a027305c44d13c3d8e00185dd58beca2f2ab4d82480e8a7","observation_id":"cc7132ff-4c4d-4dd1-9381-4959fca275b9","resolution":{"observed_at":"2026-08-15T19:17:22.810535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.552379Z","title":"Optimal algorithms for ranked enumeration of answers to full conjunctive queries","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.552379Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:4b29caca919f60d0f4f1d88066ccc3e9fa7c566a4e0f1dfb497703ee2c7e3303","observation_id":"5f8e9a34-1bdd-44a2-98b6-b99c0602c4b6","resolution":{"observed_at":"2026-08-15T19:17:20.552379Z","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.1016/s0022-0000(75)80046-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.654545Z","title":null,"venue":null,"work_id":"807f3878-4bff-40df-98ad-90c4bf30e384","year":1975},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.556168Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:238ca80b4703ac04f5dd3ca94b5df8693adec0094b48d653b19085338fc625b0","observation_id":"a61f317b-c5f8-4de8-b18f-ad0b0f66ed04","resolution":{"observed_at":"2026-08-15T19:17:20.659527Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.560180Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.560180Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:e64fc2f43e4b5dd1aa5db054434a6b88588fbce16c2f3658053969b7c739c90a","observation_id":"1bf5bc73-fb1d-41b2-814b-653d4e6bb4f2","resolution":{"observed_at":"2026-08-15T19:17:20.560180Z","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-15T19:17:20.563902Z","title":"Ryan Williams","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.563902Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:98c928e394433ffd38347b887b9ad3362dd17fcf43c7bddac7ff6c9bb03c9202","observation_id":"a9f4515d-7558-4b5b-940e-9e7346beb2e0","resolution":{"observed_at":"2026-08-15T19:17:20.563902Z","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-15T19:17:20.567519Z","title":"Finding, minimizing, and counting weighted subgraphs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.567519Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:27e3ca992d27076d081eb20d0ca0b15879e8e931cb69a3d3575b3472c6f8af07","observation_id":"70545372-a9e6-4a1c-b839-53e272e1c614","resolution":{"observed_at":"2026-08-15T19:17:20.567519Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.793493Z","title":"On some fine-grained questions in algorithms and complexity","venue":null,"work_id":"3ecf834d-6c3b-405d-a2f4-1c7d7bb815ab","year":2018},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.571612Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:99eefb0f2db2f3920770ac2b0eb87149aa4e64b0b6e734a9d3056445721953a8","observation_id":"8364e769-c3be-4601-bbec-bf4626e55dc9","resolution":{"observed_at":"2026-08-15T19:17:22.798387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.780671Z","title":"Algorithms for acyclic database schemes","venue":null,"work_id":"3ff7a126-8ece-4ce8-8926-4f30f7301e55","year":1981},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.575115Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:d375e300b34e265df57ae6c1b24f5d4c23502cc32910a641f2ef4aa5b627dd74","observation_id":"a6a2f4fc-198f-4320-8532-4b6d4dac4f4a","resolution":{"observed_at":"2026-08-15T19:17:22.784581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2792.98282","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:21.212031Z","title":"Detecting short directed cycles using rectangular matrix multiplication and dynamic programming","venue":null,"work_id":"d7965ac2-1ecf-4627-a818-19d6ea61a34d","year":2004},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.579414Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:44a5466fbd96272fbd1201c6860f5bc1aa0be102ade04988a7840cf55d03a0ca","observation_id":"4cd5019c-ce73-4920-abc8-d4afaeae9a62","resolution":{"observed_at":"2026-08-15T19:17:21.219265Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:22.768845Z","title":"Space-time tradeoffs for conjunctive queries with access patterns","venue":null,"work_id":"2089abf0-237c-460a-b435-a05f78607132","year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.584062Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:17501d23eacf2cbd15c4b5c6a91b6b79df7344106166e71bb0d2872437da26ef","observation_id":"f96cbda0-489a-4735-b392-cbbd6dfd46e0","resolution":{"observed_at":"2026-08-15T19:17:22.772845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3651138","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:17:20.623803Z","title":"Fan, Xiating Ouyang, and Paraschos Koutris","venue":null,"work_id":"916139ce-ed7a-431e-9931-7696f44c1764","year":2024},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.592574Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:d303284733311372ed0279c7878c8bf8cf4fb149ee5f833a013216d7bca2b89d","observation_id":"9d09ee33-a339-45c9-989c-1f12e88c7af3","resolution":{"observed_at":"2026-08-15T19:17:20.629132Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T19:17:20.588300Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.588300Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:792bf0b7bb3bccfddab70b8f9fc01eb7e5832b9337943b9225963c5c6be2dcfd","observation_id":"1b45003f-ab62-495f-a870-72c2983f01f1","resolution":{"observed_at":"2026-08-15T19:17:20.588300Z","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-15T19:17:20.276811Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.276811Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:d4d0d1a1e66f4805b88dd028ef813556644fe2487951243de0edaf808643d070","observation_id":"de4e2978-a71c-4d41-9223-c6469217c79a","resolution":{"observed_at":"2026-08-15T19:17:20.276811Z","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-15T19:17:20.481208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.481208Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:3f1c4e1162c3bee66d828a192fa994c0cf3fd86cbcbbd7f8efc3f1ab299312c4","observation_id":"e94b1f75-cd4b-46bf-a389-f459a4c53bfd","resolution":{"observed_at":"2026-08-15T19:17:20.481208Z","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-15T19:17:20.370302Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T19:17:20.370302Z"},"links":{"citing_paper":"/paper/2506.17702"},"observation_digest":"sha256:56e04823fae8daed472e554272ba43c6d5a1927a1335570f5b2cd53e70d1d407","observation_id":"7f461ac6-f892-473a-b509-31602e54e9a8","resolution":{"observed_at":"2026-08-15T19:17:20.370302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-15T19:00:41.789760Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation"},"reference_resolution":{"displayed":85,"state_counts":{"malformed_identifier":4,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":55,"verified_exact":16,"verified_fuzzy":8},"total_outbound_references":85},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 85 of 85 outbound references and 1 inbound Pith citation observation for arXiv:2506.17702."}