{"as_of":"2026-08-05T07:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec06b9ab75f520a2fe0b2ef92eb1f83e4f5411494329c7b57a506c372711abfb","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-05T06:32:48.257954+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-07-12T11:49:07.950807Z","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-07-04T14:59:55.271048Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.02715","last_updated":"2018-07-07T20:24:54Z","snapshot_observed_at":"2026-07-06T06:48:55.792187Z","submitted_at":"2018-07-07T20:24:54Z","title":"Complexity of Scott Sentences","version":1},"cited_work":{"arxiv_id":"1807.02715","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.02715","snapshot_observed_at":"2026-07-04T14:59:55.271048Z","title":"Complexity of Scott Sentences","venue":"math.LO","work_id":"2d19cc4e-c4b7-427f-bc6e-d858149d26d7","year":2018},"citing_paper":{"arxiv_id":"2606.27151","last_updated":"2026-07-05T00:39:00Z","snapshot_observed_at":"2026-07-12T11:49:07.441910Z","submitted_at":"2026-06-25T15:21:12Z","title":"Scott complexity of trees of finite rank via degrees of categoricity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T02:06:49.816239Z"},"links":{"cited_paper":"/paper/1807.02715","citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:6fa2a7ae15eab24dd26354f4363124fb113233ef9ffa6b328a69400207a15ce8","observation_id":"bc91143a-7c74-4834-9990-49676fa36fe7","resolution":{"observed_at":"2026-07-04T14:59:55.272165Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.02715","last_updated":"2018-07-07T20:24:54Z","snapshot_observed_at":"2026-07-06T06:48:55.792187Z","submitted_at":"2018-07-07T20:24:54Z","title":"Complexity of Scott Sentences","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.02715","snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Alvir, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.27151","last_updated":"2026-07-05T00:39:00Z","snapshot_observed_at":"2026-07-12T11:49:07.441910Z","submitted_at":"2026-06-25T15:21:12Z","title":"Scott complexity of trees of finite rank via degrees of categoricity","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"cited_paper":"/paper/1807.02715","citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:2d2d40b2d356d064c15790664257d9fd8c6e6105307b6c087a9967731b0517b7","observation_id":"caad548a-b13c-43a2-9eca-0a40ee82a46e","resolution":{"observed_at":"2026-07-12T11:49:07.950807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1807.02715/citation-record","integrity":"/paper/1807.02715/integrity","json":"/paper/1807.02715/citation-record.json","paper":"/paper/1807.02715"},"outbound":[],"paper":{"arxiv_id":"1807.02715","last_updated":"2018-07-07T20:24:54Z","latest_version":1,"primary_category":"math.LO","snapshot_observed_at":"2026-07-06T06:48:55.792187Z","submitted_at":"2018-07-07T20:24:54Z","title":"Complexity of Scott Sentences"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1807.02715."}