{"as_of":"2026-08-17T18:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69f42080999b40a187283d6ca11b989253cc569d221f36601e0c238e5e71b7c2","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-17T06:30:58.91139+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-12T10:55:42.586673Z","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-12T10:55:43.344057Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1601.08031","last_updated":"2018-07-10T14:47:34Z","snapshot_observed_at":"2026-08-14T22:12:36.311874Z","submitted_at":"2016-01-29T10:22:51Z","title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs","version":2},"cited_work":{"arxiv_id":"1601.08031","doi":null,"metadata_source":"pith","pith_arxiv_id":"1601.08031","snapshot_observed_at":"2026-08-12T10:55:43.344057Z","title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs","venue":"cs.CC","work_id":"cdce9481-b55a-48f3-8908-ca9c3ef568aa","year":2016},"citing_paper":{"arxiv_id":"2411.18981","last_updated":"2024-11-28T08:02:53Z","snapshot_observed_at":"2026-08-12T10:37:42.904893Z","submitted_at":"2024-11-28T08:02:53Z","title":"The Complexity of Order-Finding for ROABPs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.586673Z"},"links":{"cited_paper":"/paper/1601.08031","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:36aac413b7be27e02b1655b4591b8270bab7aae75c37fd9f078d8912419e2660","observation_id":"637ce018-e38b-4163-88c6-46d793185cba","resolution":{"observed_at":"2026-08-12T10:55:43.348272Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1601.08031/citation-record","integrity":"/paper/1601.08031/integrity","json":"/paper/1601.08031/citation-record.json","paper":"/paper/1601.08031"},"outbound":[],"paper":{"arxiv_id":"1601.08031","last_updated":"2018-07-10T14:47:34Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-14T22:12:36.311874Z","submitted_at":"2016-01-29T10:22:51Z","title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1601.08031."}