{"as_of":"2026-08-22T07:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21939e38b4b9ed2e3ef4114f523f88cfcaafea64c7bff08fd0b442f0345d124d","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-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-08-16T10:55:23.537457Z","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-08-16T10:55:23.599763Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1611.06632","last_updated":"2017-02-22T01:36:14Z","snapshot_observed_at":"2026-08-20T23:04:50.161311Z","submitted_at":"2016-11-21T01:58:12Z","title":"A Note on Amortized Branching Program Complexity","version":2},"cited_work":{"arxiv_id":"1611.06632","doi":null,"metadata_source":"pith","pith_arxiv_id":"1611.06632","snapshot_observed_at":"2026-08-16T10:55:23.599763Z","title":"A Note on Amortized Branching Program Complexity","venue":"cs.CC","work_id":"60ec5ac1-a1ac-4393-8ae4-7e45d126c813","year":2016},"citing_paper":{"arxiv_id":"2504.17412","last_updated":"2025-04-24T10:09:33Z","snapshot_observed_at":"2026-08-21T20:01:00.238163Z","submitted_at":"2025-04-24T10:09:33Z","title":"Catalytic Computing and Register Programs Beyond Log-Depth","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.537457Z"},"links":{"cited_paper":"/paper/1611.06632","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:97831876a29024439e4be42ddeb46af8984a2ac2db00b37f04d34eda64906afa","observation_id":"e2bd8014-ebe3-49c7-ab29-e1d5be008b39","resolution":{"observed_at":"2026-08-16T10:55:23.605587Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1611.06632/citation-record","integrity":"/paper/1611.06632/integrity","json":"/paper/1611.06632/citation-record.json","paper":"/paper/1611.06632"},"outbound":[],"paper":{"arxiv_id":"1611.06632","last_updated":"2017-02-22T01:36:14Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-20T23:04:50.161311Z","submitted_at":"2016-11-21T01:58:12Z","title":"A Note on Amortized Branching Program Complexity"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1611.06632."}