{"as_of":"2026-08-12T15:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d643bb8c622bbd2665694d103541ec0acde7103294431319019f737de82ba720","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:08:15.702792Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T11:16:02.984610Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.08870","last_updated":"2024-06-11T20:13:07Z","snapshot_observed_at":"2026-07-06T17:59:38.202928Z","submitted_at":"2024-04-13T01:45:44Z","title":"Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08870","snapshot_observed_at":"2026-08-06T21:08:15.702792Z","title":"Almost optimal time lower bound for approximating parameterized clique, CSP , and more, under ETH","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01192","last_updated":"2025-07-01T21:15:22Z","snapshot_observed_at":"2026-08-07T23:55:35.204549Z","submitted_at":"2025-07-01T21:15:22Z","title":"PCPP-Based Reconfiguration Inapproximability: Query Complexity vs. Soundness Gap Trade-offs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T21:08:15.702792Z"},"links":{"cited_paper":"/paper/2404.08870","citing_paper":"/paper/2507.01192"},"observation_digest":"sha256:6fdb6c9ceafba8263d1e01c306841b6930b9138347bdf679c24e35b825ea4498","observation_id":"39e6c22f-b1e2-4566-9eea-93d44d8d010e","resolution":{"observed_at":"2026-08-06T21:08:15.702792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08870","last_updated":"2024-06-11T20:13:07Z","snapshot_observed_at":"2026-07-06T17:59:38.202928Z","submitted_at":"2024-04-13T01:45:44Z","title":"Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH","version":2},"cited_work":{"arxiv_id":"2404.08870","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.08870","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Almost optimal time lower bound for approximating parameterized clique, CSP, and more, under ETH.arXiv preprint arXiv:2404.08870","venue":null,"work_id":"5a8ce554-b8c1-4acc-b516-a1bfd84d6017","year":null},"citing_paper":{"arxiv_id":"2604.10369","last_updated":"2026-04-11T22:45:56Z","snapshot_observed_at":"2026-07-06T22:59:01.129724Z","submitted_at":"2026-04-11T22:45:56Z","title":"Optimal FPT-Approximability for Modular Linear Equations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T15:04:35.728420Z"},"links":{"cited_paper":"/paper/2404.08870","citing_paper":"/paper/2604.10369"},"observation_digest":"sha256:40d21d64ecff6c0c9ee500fbf2a43d2049716e3c1f7b73ffb9d1067ee85807bc","observation_id":"48e0eccd-8eb9-4eb6-899a-27a51c130a02","resolution":{"observed_at":"2026-05-11T11:16:02.988408Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.08870/citation-record","integrity":"/paper/2404.08870/integrity","json":"/paper/2404.08870/citation-record.json","paper":"/paper/2404.08870"},"outbound":[],"paper":{"arxiv_id":"2404.08870","last_updated":"2024-06-11T20:13:07Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T17:59:38.202928Z","submitted_at":"2024-04-13T01:45:44Z","title":"Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.08870."}