{"as_of":"2026-08-17T05:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f09d844e4adb3ee5fc8f9f5f900cb83b77953dcf88f3bad3c9f0d7bb0ae5060e","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:23:26.359570Z","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.433601Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1209.2408","last_updated":"2013-09-22T22:02:53Z","snapshot_observed_at":"2026-08-15T00:47:04.389680Z","submitted_at":"2012-09-11T19:52:41Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","version":2},"cited_work":{"arxiv_id":"1209.2408","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.2408","snapshot_observed_at":"2026-08-12T10:55:43.433601Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","venue":"cs.CC","work_id":"2eff9685-332b-4485-9bef-93408dc42a10","year":2012},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-12T10:55:42.574901Z"},"links":{"cited_paper":"/paper/1209.2408","citing_paper":"/paper/2411.18981"},"observation_digest":"sha256:364f8fa3b61475665d5abf0a71bef646b6a5c5fffe876600bdc80751fa97512f","observation_id":"22ed1d6c-d0ab-433c-933f-624b9889514c","resolution":{"observed_at":"2026-08-12T10:55:43.437960Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2408","last_updated":"2013-09-22T22:02:53Z","snapshot_observed_at":"2026-08-15T00:47:04.389680Z","submitted_at":"2012-09-11T19:52:41Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2408","snapshot_observed_at":"2026-08-15T19:23:26.359570Z","title":"Proof Complexity Lower Bounds from Algebraic Circuit Complexity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.17210","last_updated":"2025-06-20T17:58:35Z","snapshot_observed_at":"2026-08-15T19:07:27.681273Z","submitted_at":"2025-06-20T17:58:35Z","title":"Lower Bounds against the Ideal Proof System in Finite Fields","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T19:23:26.359570Z"},"links":{"cited_paper":"/paper/1209.2408","citing_paper":"/paper/2506.17210"},"observation_digest":"sha256:a6abe7d90917e93fc2d65a599869b93c2b8e1cf94ac7ae3578bb29ce553dff90","observation_id":"fbb1d50b-e4f0-4572-8b3f-2d9cff3fc83e","resolution":{"observed_at":"2026-08-15T19:23:26.359570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2408","last_updated":"2013-09-22T22:02:53Z","snapshot_observed_at":"2026-08-15T00:47:04.389680Z","submitted_at":"2012-09-11T19:52:41Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2408","snapshot_observed_at":"2026-08-15T16:14:05.195221Z","title":"Proof Com- plexity Lower Bounds from Algebraic Circuit Complexity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10725","last_updated":"2025-09-12T22:30:24Z","snapshot_observed_at":"2026-08-15T15:51:24.259148Z","submitted_at":"2025-09-12T22:30:24Z","title":"On Closure Properties of Read-Once Oblivious Algebraic Branching Programs","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T16:14:05.195221Z"},"links":{"cited_paper":"/paper/1209.2408","citing_paper":"/paper/2509.10725"},"observation_digest":"sha256:ad862f6da52b2d31067afbae6e459b3e3584ed668f3be0ed35eb0db3fd31a6bc","observation_id":"2e3c6e0b-b45a-4803-895a-e51435904177","resolution":{"observed_at":"2026-08-15T16:14:05.195221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1209.2408/citation-record","integrity":"/paper/1209.2408/integrity","json":"/paper/1209.2408/citation-record.json","paper":"/paper/1209.2408"},"outbound":[],"paper":{"arxiv_id":"1209.2408","last_updated":"2013-09-22T22:02:53Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T00:47:04.389680Z","submitted_at":"2012-09-11T19:52:41Z","title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic 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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1209.2408."}