{"as_of":"2026-08-16T07:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7035764bdcb9ec71df7124b086226d105adafef0ecd86f1d5a4f2506bd6c2f7","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T11:49:07.950807Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.27151/citation-record","integrity":"/paper/2606.27151/integrity","json":"/paper/2606.27151/citation-record.json","paper":"/paper/2606.27151"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Alvir, N","venue":null,"work_id":null,"year":2021},"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":1,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:68a01fc175dd8b5e828bdb096b6b34c077983dd861d623d94e6c554ca1515c5c","observation_id":"4ddad82a-9d06-47b9-bf43-f8c7831e3d34","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Alvir, B","venue":null,"work_id":null,"year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:fb5e0e7793e303955aefbc7a81a387971b713fcbd68c76d4f4fbf01edf3681ca","observation_id":"087121e7-2af7-4118-80d7-86633d57baf6","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"}},{"citation":{"cited_paper":{"arxiv_id":"1807.02715","last_updated":"2018-07-07T20:24:54Z","snapshot_observed_at":"2026-08-14T18:54:40.714754Z","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:56a8731c65d138a92feea809928b4a3469dccde5c14ed757c8867268801624bb","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":null,"venue":null,"work_id":null,"year":2000},"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":4,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:a0e4485b9b16d2fa582d46a1004974864fb8f5ef0cf26aeccb44c0209fe0b04b","observation_id":"d1ecbe34-0cfe-43c7-9534-934a0245b8ae","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":null,"venue":null,"work_id":null,"year":1989},"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":5,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:15c790c51793261ba3aa469dccc598851d0d847286fd5418abe61a56fd8ba5f4","observation_id":"4d7ec8ee-9adb-4e68-a65c-fd201711da75","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Chisholm,Effective model theory vs","venue":null,"work_id":null,"year":1990},"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":6,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:a1f1cdb8faa0f4b2411ddd799c0ab6461b352d2e4d8a42c0404346829ec66de0","observation_id":"f640611b-431d-4a3d-9313-b5c77c269b59","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":null,"venue":null,"work_id":null,"year":2013},"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":7,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:f2775e36f58528c03cc7cce6774e9e574cc65f522c0401f90d8ac8a5e0407bfd","observation_id":"74d44008-e2bc-4624-90ae-c1e5e5cae4c9","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":null,"venue":null,"work_id":null,"year":2010},"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":8,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:c2508fed097b89055b7b5e0867b673ddb24d49b3413f314e08d736667348d8b0","observation_id":"9388bdc0-dd7d-44a0-9cc7-3c1ac1772448","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Gonzalez and D","venue":null,"work_id":null,"year":2025},"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":9,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:849a90ae2f2b8dc63c6750df3e86a3a7899a518b58fff5ad41b5321bde0d29da","observation_id":"a9173c6c-62f9-419e-813d-f0d7bc47d93d","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Harrison-Trainor and J","venue":null,"work_id":null,"year":null},"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":10,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:19cd31526dc7bb7be462555605cd71474a2fc1604374c8d4bcee01637eea054f","observation_id":"2c8e8b21-19c5-4b58-a6b8-35c86a31c7d8","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":null,"venue":null,"work_id":null,"year":2002},"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":11,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:d1ae4271b1866e2c6bba82da3d81070a596e7b126eba57299a0c5ef417d60fc2","observation_id":"774c05d2-4ea9-455a-9189-28e8d88cd665","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Lempp, C","venue":null,"work_id":null,"year":2005},"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":12,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:8169621caa63aa0ce4e0e0dec4af970465ae43daf7c03e34fd8075da05a2d8a2","observation_id":"5d9590fe-fc09-43c7-b416-461f1f430917","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Assem Mahmoud,Degrees of categoricity of trees and the isomorphism problem, Math","venue":null,"work_id":null,"year":2019},"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":13,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:b6eee25c23ea967d8a21a7d0d36f8bba036158321a092dc80d51ce29b2fcf09d","observation_id":"197f3b51-8194-434f-b2c8-8339e2dc1284","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":null,"venue":null,"work_id":null,"year":1983},"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":14,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:bf7ed5e7ab871c3c5887987b7d67fe9d7499aed8562b9515846ab14f9f45639a","observation_id":"0ec3912f-cd5a-4b50-bdf4-53f2d574e8f2","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Montalb´ an,A robuster Scott rank, Proc","venue":null,"work_id":null,"year":2015},"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":15,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:911e6afcf5029526118b396a5a52a4e6419984487bda6d8028a107f58bc3ba64","observation_id":"8df2b71f-f20b-46c5-ae63-a09890d0ef25","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-12T11:49:07.950807Z","title":"Vaught,Invariant sets in topology and logic, Fund","venue":null,"work_id":null,"year":1974},"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":16,"source":"pdf_text","source_observed_at":"2026-07-12T11:49:07.950807Z"},"links":{"citing_paper":"/paper/2606.27151"},"observation_digest":"sha256:8403152f5d53bcee2ccc2e2eaef70c3bb0a914cdc25a58d1ad40237ec85405ce","observation_id":"ece790a2-af61-4b13-92b5-d4aac3bf3eea","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"}}],"paper":{"arxiv_id":"2606.27151","last_updated":"2026-07-05T00:39:00Z","latest_version":2,"primary_category":"math.LO","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"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":16},"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 16 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2606.27151."}