{"as_of":"2026-08-22T21:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5a33523c46e8bfc4e949803c7fb63633e44160528fc51206b0605491c733cf78","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-22T06:32:14.747728+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-16T10:55:23.518334Z","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-07-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1311.0293","last_updated":"2013-11-01T20:13:47Z","snapshot_observed_at":"2026-08-20T23:04:47.803786Z","submitted_at":"2013-11-01T20:13:47Z","title":"Pebbling Arguments for Tree Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.0293","snapshot_observed_at":"2026-08-16T10:55:23.518334Z","title":"Pebbling arguments for tree evaluation","venue":null,"work_id":null,"year":2013},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-16T10:55:23.518334Z"},"links":{"cited_paper":"/paper/1311.0293","citing_paper":"/paper/2504.17412"},"observation_digest":"sha256:227f842351859b960ebd03ecc2aeebe9f6310d525ebd442b64096d09d9b1000e","observation_id":"dd174826-4268-4761-9b18-5909ae264bce","resolution":{"observed_at":"2026-08-16T10:55:23.518334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.0293","last_updated":"2013-11-01T20:13:47Z","snapshot_observed_at":"2026-08-20T23:04:47.803786Z","submitted_at":"2013-11-01T20:13:47Z","title":"Pebbling Arguments for Tree Evaluation","version":1},"cited_work":{"arxiv_id":"1311.0293","doi":"10.48550/arxiv.1311.0293","metadata_source":"arxiv_reference","pith_arxiv_id":"1311.0293","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"doi:10.48550/arXiv.1311.0293 , year =","venue":null,"work_id":"d0c68328-b19a-4f90-81f1-6e1c24208a1d","year":null},"citing_paper":{"arxiv_id":"2605.09648","last_updated":"2026-05-10T16:47:15Z","snapshot_observed_at":"2026-08-12T13:10:55.759475Z","submitted_at":"2026-05-10T16:47:15Z","title":"Understanding Robust Catalytic Computing","version":1},"reference_index":156,"source":"arxiv_source","source_observed_at":"2026-05-12T02:23:24.561905Z"},"links":{"cited_paper":"/paper/1311.0293","citing_paper":"/paper/2605.09648"},"observation_digest":"sha256:f90dd426e80c4f22bb445489d68194193ae0ee6fdc25a7fab26f4d3df4825624","observation_id":"efadd5a5-e0da-4504-b2b5-ac6a4f209984","resolution":{"observed_at":"2026-07-04T18:43:01.156335Z","resolver_source":"arxiv_id","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/1311.0293/citation-record","integrity":"/paper/1311.0293/integrity","json":"/paper/1311.0293/citation-record.json","paper":"/paper/1311.0293"},"outbound":[],"paper":{"arxiv_id":"1311.0293","last_updated":"2013-11-01T20:13:47Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-20T23:04:47.803786Z","submitted_at":"2013-11-01T20:13:47Z","title":"Pebbling Arguments for Tree Evaluation"},"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 2 inbound Pith citation observations for arXiv:1311.0293."}