{"as_of":"2026-08-21T07:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:76d75ac2f950ffab6881ede1018e888c9448691cd3df7805cff5e3e9451482d0","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-21T06:32:19.484+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-08T07:41:35.559453Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T07:44:42.588850Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.01706","last_updated":"2016-11-05T22:55:45Z","snapshot_observed_at":"2026-08-14T21:31:48.704123Z","submitted_at":"2016-11-05T22:55:45Z","title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds","version":1},"cited_work":{"arxiv_id":"1611.01706","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.01706","snapshot_observed_at":"2026-07-08T07:44:42.588850Z","title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds","venue":"cs.CC","work_id":"090272da-8423-443a-9539-5686973264fe","year":2016},"citing_paper":{"arxiv_id":"2607.06393","last_updated":"2026-07-07T15:25:53Z","snapshot_observed_at":"2026-08-17T03:49:36.370932Z","submitted_at":"2026-07-07T15:25:53Z","title":"Faster Exponential-Time Approximate Counting via Bounded Self-Reductions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T07:41:35.559453Z"},"links":{"cited_paper":"/paper/1611.01706","citing_paper":"/paper/2607.06393"},"observation_digest":"sha256:a768e456416eec156e4a200ea7b86a468b8e7caf4ed5eeb83f6522f12b4f9ce4","observation_id":"c9cb9e97-f157-48e4-87b8-f7b4887f5d89","resolution":{"observed_at":"2026-07-08T07:44:42.591867Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1611.01706/citation-record","integrity":"/paper/1611.01706/integrity","json":"/paper/1611.01706/citation-record.json","paper":"/paper/1611.01706"},"outbound":[],"paper":{"arxiv_id":"1611.01706","last_updated":"2016-11-05T22:55:45Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-14T21:31:48.704123Z","submitted_at":"2016-11-05T22:55:45Z","title":"Self-reducible with easy decision version counting problems admit additive error approximation. Connections to counting complexity, exponential time complexity, and circuit lower bounds"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1611.01706."}