{"as_of":"2026-08-17T03:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bbaa68e31ac35041a9ce1cbece22d3245e6d34593f8a5dc661a0fc0a2db5573b","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-16T06:30:59.297886+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-14T12:36:06.866337Z","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-14T12:36:07.080476Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1307.5321","last_updated":"2016-02-14T15:50:37Z","snapshot_observed_at":"2026-08-15T00:10:14.281160Z","submitted_at":"2013-07-16T09:55:15Z","title":"The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops","version":5},"cited_work":{"arxiv_id":"1307.5321","doi":null,"metadata_source":"pith","pith_arxiv_id":"1307.5321","snapshot_observed_at":"2026-08-14T12:36:07.080476Z","title":"The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops","venue":"cs.CC","work_id":"48a43d74-ad6d-4a3e-aeef-a5a10633aa4d","year":2013},"citing_paper":{"arxiv_id":"1908.07282","last_updated":"2020-10-12T13:04:52Z","snapshot_observed_at":"2026-08-16T13:44:00.611016Z","submitted_at":"2019-08-20T11:44:36Z","title":"Verification of Flat FIFO Systems","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:36:06.866337Z"},"links":{"cited_paper":"/paper/1307.5321","citing_paper":"/paper/1908.07282"},"observation_digest":"sha256:a1cdc7e25605444695aa0ffb5358ddb3fde8bd14e4968c2515d05b703e048a52","observation_id":"86601fc9-16ee-4db6-9084-d2535167f8da","resolution":{"observed_at":"2026-08-14T12:36:07.085902Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1307.5321/citation-record","integrity":"/paper/1307.5321/integrity","json":"/paper/1307.5321/citation-record.json","paper":"/paper/1307.5321"},"outbound":[],"paper":{"arxiv_id":"1307.5321","last_updated":"2016-02-14T15:50:37Z","latest_version":5,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-15T00:10:14.281160Z","submitted_at":"2013-07-16T09:55:15Z","title":"The Complexity of Reachability Problems for Flat Counter Machines with Periodic Loops"},"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 1 inbound Pith citation observation for arXiv:1307.5321."}