{"as_of":"2026-08-13T06:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39730ce1410ffae09b050334cd2e7fe9af89d454d52fb396fbb5487355a28df1","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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-09T16:37:55.294159Z","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:b82fa0cd714389e8de0fdf7572079f11a48af7861c51266fdb21c37e55156fa2","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":[],"paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-09T16:37:55.294159Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2506.17702."}