{"as_of":"2026-08-04T20:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc71f3937fb394e45b576a00cbbc6f672b0bf0851ad0908c98208e880fc30f57","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T17:26:09.981455Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2605.04404/citation-record","integrity":"/paper/2605.04404/integrity","json":"/paper/2605.04404/citation-record.json","paper":"/paper/2605.04404"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the computability of optimal Scott sentences","venue":null,"work_id":"adaf676f-c37f-4cc3-a987-bee00b01d8e1","year":2025},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:91c8dbd77961f4f6ccc774aa24a411ca3a460d9849545d2cdd67995c32d0d19c","observation_id":"03de177f-0e2f-4021-a89b-2ca640ffa5b9","resolution":{"observed_at":"2026-05-26T07:46:55.282630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Complexity of Scott sen- tences","venue":null,"work_id":"ffa36a78-f6b2-4679-bc12-030ca648a288","year":2020},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:a1357362439d4e0ae76eb9b5d7c1e25193f79b081ef89dcf7638c6d6c611af4d","observation_id":"821c217d-c5a2-4654-b764-91e82ffcfbfb","resolution":{"observed_at":"2026-05-26T07:46:55.250739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pairs of Recursive Structures","venue":null,"work_id":"aa11d085-60a6-4118-b211-555107f6f2a8","year":1990},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:6dc364ee67417f6e5a2e43a1a1fedeabcd72e6ea875ff1a6eb5bb0b2e699cbe8","observation_id":"1f0b984e-a573-4ea4-8f8e-e2830e68dba9","resolution":{"observed_at":"2026-05-26T07:46:55.304120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8bcff7e1-2f7b-487b-9691-840261ad49ef","year":2000},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:b2aba1ebd46cfb6f9ef0111ad3c580debec192942bd748221141c14165ff1df8","observation_id":"07ae800d-03e9-4b3e-ac31-31daea835a41","resolution":{"observed_at":"2026-05-26T07:46:55.255577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Recursive labeling systems and stability of recursive structures in hyperarithmetical degrees","venue":null,"work_id":"b56b07d4-070d-4fc0-b3bb-06f3c30fbeea","year":1986},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:66f8c2394b56a83d0934736ddf08aa2b000dfd47af0f2524b720ac4d9d62a3ff","observation_id":"a303f5be-85a7-41c9-bfbd-6fd87fd54c74","resolution":{"observed_at":"2026-05-26T07:46:55.300398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Comparing classes of finite structures","venue":null,"work_id":"e1dc7c68-7b9a-483c-b45a-5b002bd22eaa","year":2004},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:749c63d99709dbb8687a8fffc0226262cd04531d70b2dd4e223ab1df3595be83","observation_id":"7798d0c9-7d1e-4104-8e79-f1894314fbf8","resolution":{"observed_at":"2026-05-26T07:46:55.291450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/tran/9695","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal Syn- tactic Definitions of Back-and-Forth Types","venue":null,"work_id":"79f8d368-e3de-4a39-abb7-d927422b2f90","year":null},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:d5e6b49d474c05c017e21c11831eca261d0b3ff42da0440d5058b03fb76b04a6","observation_id":"9c5cee98-4ac8-4cb6-9d87-c2d9aae721d0","resolution":{"observed_at":"2026-05-08T20:04:07.696265Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cohen,Set Theory and the Continuum Hypothesis, Dover, Garden City","venue":null,"work_id":"4647ddd9-2c95-41fb-abb0-1987426d78c6","year":1966},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:6e9c2dfb49da6fd58e5e10fe60c2aa3cd249e5405f6eea188d77094b1c578c3d","observation_id":"910ff7c8-a75a-496d-8771-3ca4ae479bca","resolution":{"observed_at":"2026-05-26T07:46:55.260632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Borel reducibility theory for classes of countable structures","venue":null,"work_id":"b4c5b0e5-9878-43a0-8040-ddf14a01e4d0","year":1989},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:dd7006adae37d3855cf57820605500c85f56cd73c2f03a6daf6fe8c407f8bb3f","observation_id":"d64eddcf-03b1-4e4a-8fc4-75a54225b820","resolution":{"observed_at":"2026-05-26T07:46:55.269380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Some dichotomy theorems for isomorphism relations of countable models","venue":null,"work_id":"820a75f4-8b6c-4abd-a1e8-61cdc72fc8d5","year":2001},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:99753a974b931c20381a1de6993ea45d731a8931cd1dc08c146ae31d1f83288d","observation_id":"055576da-b6fb-479a-9c0f-2cdb89fab380","resolution":{"observed_at":"2026-05-26T07:46:55.314146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enumerations in computable structure theory","venue":null,"work_id":"fdc6981a-7e2a-4020-a2b5-f6457df0a9fc","year":2005},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:85ad4f709cb1d2c3005b41275eabf250f17077bc51c9b58b55e10d0f9239fd91","observation_id":"1741def2-d52e-4584-9d95-ff6ef9ea40bc","resolution":{"observed_at":"2026-05-26T07:46:55.273840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12084","last_updated":"2025-05-01T16:00:33Z","snapshot_observed_at":"2026-08-04T16:45:41.423316Z","submitted_at":"2024-11-18T21:49:46Z","title":"Scott Spectral Gaps are Bounded for Linear Orderings","version":2},"cited_work":{"arxiv_id":"2411.12084","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.12084","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scott Spectral Gaps are Bounded for Linear Orderings","venue":null,"work_id":"65d4167d-e8eb-43b0-8e8f-c07634b9ebee","year":null},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"cited_paper":"/paper/2411.12084","citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:12fa512afccd3a8a71c6f4cfbe2fc59af585e3705831a57fc906beb534c56a93","observation_id":"9c4b7fcb-2fff-4da5-bd2f-9f2207a7429c","resolution":{"observed_at":"2026-05-11T17:36:05.311509Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Scott sentence complexities of linear or- derings","venue":null,"work_id":"81795b79-8067-40d0-90bb-426b5a9e3445","year":2024},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:934fe19c39dfd618e03b526d3fd3f13dec4e0f5d4a63973d9ba2c418fc3977bb","observation_id":"a88113a8-4493-45f4-8f8c-1d06119b2a22","resolution":{"observed_at":"2026-05-26T07:46:55.278494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Complexity of well-ordered sets in an Abelian group","venue":null,"work_id":"5dbbf337-546f-45e7-ab2b-504d3b364634","year":2025},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:8782806b57429a0ab71e44dd8ca17053212ab6a71d8d83ef0f0314d52c852f46","observation_id":"af31ee04-6974-4012-bd17-78708f1c1a06","resolution":{"observed_at":"2026-05-26T07:46:55.287445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2505.23613","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Relative to any non-arithmetic set","venue":null,"work_id":"398650dd-9c1e-4d15-995d-e09bc4ff508c","year":null},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:53e544df20fe82e524b70c30e26236d4cc804bc8604c3a6069136c2d173a7db8","observation_id":"4a2cf58d-69fc-4eed-b3ec-77fd199ec47f","resolution":{"observed_at":"2026-05-11T17:36:05.303800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The tree of tuples of a struc- ture","venue":null,"work_id":"cbc1262f-5ce1-4e54-98c4-1ff03b00c9fb","year":2022},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:531d1bad6f3e7c76a60f0c33eba0394ab2567d4a14a3e0d367458eb13e13a41f","observation_id":"0e1b09c5-2888-4cb0-a0fa-33d247e7ff28","resolution":{"observed_at":"2026-05-26T07:46:55.295740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Around non-classifiability for countable torsion-free Abelian groups","venue":null,"work_id":"193fc1b7-b4fb-43ee-b629-588872cc331f","year":1998},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:15050485682d93a6e011237522d577fb55ae1b7f5c6854d764eb6551fba4a06b","observation_id":"dc239e72-79db-4892-b214-8d90c2d528f5","resolution":{"observed_at":"2026-05-26T07:46:55.308746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finite-quantifier equivalence","venue":null,"work_id":"5e195b87-7b26-4adb-b68b-a80170cde1c9","year":1963},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:e1dc9220a63304572ee3c344dac8f3983edfbef3f251c7f97ed934cb6a29854e","observation_id":"0c05bb16-bb80-4f1f-8dcb-1687ffa97628","resolution":{"observed_at":"2026-05-26T07:46:55.264805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Turing computable em- beddings","venue":null,"work_id":"25b35a2f-75ff-4be4-84bd-a1d5ce3145c5","year":2007},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:9d5ff39abf0e1a61acc5bf139c2b5cd73d6b3eb0fdc730d3950ab53f28913f74","observation_id":"9f1428e8-9b0d-4738-b2d4-36345db071c2","resolution":{"observed_at":"2026-05-26T07:46:55.228128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coding in graphs and linear orderings","venue":null,"work_id":"d028f5e1-0053-4071-b3d1-52570c9d25fb","year":2020},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:f26539324ab15dc03bb451f35af67a6d6db778f046803283565b5e801e36dc31","observation_id":"f2d26aeb-b215-45a4-ba5a-b86a1be854fd","resolution":{"observed_at":"2026-05-26T07:46:55.210710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maher,On Embeddings of Computable Structures, Classes of Struc- tures, and Computable Isomorphism, PhD Dissertation, University of Notre Dame","venue":null,"work_id":"dd4b2929-216b-4806-87b0-d95992bace90","year":2009},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:3166c83fdd13cdbb8defb423a81fdb5e1cabdefec8eb3bb9bedf63b58f5e6008","observation_id":"1f5bce4e-61fb-4b61-b979-7d74beeec287","resolution":{"observed_at":"2026-05-26T07:46:55.215382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A robuster Scott rank","venue":null,"work_id":"87161e17-3adf-4b6a-9260-a9c1ca8c9f2e","year":1965},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:2d9edb00be4add33ff591c7f02e8bb66a9393ddff7a9c5cfb1f3067f090fff7a","observation_id":"5a8b116b-5ad9-4979-876c-75946658d8e7","resolution":{"observed_at":"2026-05-26T07:46:55.219258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computable Structure Theory: Within the Arithmetic","venue":null,"work_id":"887d646f-6e10-49d0-a2af-4a0ef5be41f1","year":2021},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:6cbf0f4c3d74b4ab294de8e8e38a852b3cd0bbf1a63a9173bfbf7be22d0a7cb8","observation_id":"da1584d1-7f33-4b02-86a5-7c4f53e33b8a","resolution":{"observed_at":"2026-05-26T07:46:55.246827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computable Structure Theory: Beyond the Arithmetic","venue":null,"work_id":"57a6bdee-cf54-466b-8748-f349d50b9465","year":2026},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:df7d5afd6bd118428e1e1fd316613fed2ea1c9479a7b943cbf45804db3af3b03","observation_id":"c3c6d2e9-bef2-4eb4-bf9f-9ddc630b13a7","resolution":{"observed_at":"2026-05-26T07:46:55.236974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Torsion-free abelian groups are Borel com- plete","venue":null,"work_id":"d9209e9b-f859-4299-961d-e92400ebe3ec","year":2024},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:3cd7101ce2438e925fd10c28ff0d1dc5d90866d1077dbb4d0adfed197e90a03e","observation_id":"7272257e-41db-4b3c-96c4-ac5a01d9ecd3","resolution":{"observed_at":"2026-05-26T07:46:55.241641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Logic with denumerably long formulas and finite strings of quantifiers","venue":null,"work_id":"673e1e84-edae-46e1-9380-9e485b764085","year":1963},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:2614c51c55bd123cad2805d016f5893b0d791af3eae81e03c7e49e3a61dde450","observation_id":"70725609-9558-40ea-a28d-86cc2dc7bc92","resolution":{"observed_at":"2026-05-26T07:46:55.232625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The classification problem for torsion-free Abelian groups of finite rank","venue":null,"work_id":"4490201c-1b43-4d13-8eb5-de9087341ecd","year":2002},"citing_paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-08T17:26:09.981455Z"},"links":{"citing_paper":"/paper/2605.04404"},"observation_digest":"sha256:9e0786a3d09fc0b80bcfffe11aac4ce650bc22af89ea3abdc5742bbff61cc336","observation_id":"99e95fec-6b75-4ae9-896f-a448855a4fca","resolution":{"observed_at":"2026-05-26T07:46:55.223730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.04404","last_updated":"2026-05-06T01:54:21Z","latest_version":1,"primary_category":"math.LO","snapshot_observed_at":"2026-07-06T23:17:09.246351Z","submitted_at":"2026-05-06T01:54:21Z","title":"Computable Scott Sentences and the Friedman-Stanley embedding"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":3,"verified_fuzzy":23},"total_outbound_references":27},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2605.04404."}