{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5D6C7K263D5YYLIJFBYM4ZVDUU","short_pith_number":"pith:5D6C7K26","schema_version":"1.0","canonical_sha256":"e8fc2fab5ed8fb8c2d092870ce66a3a516566246addb54b944892f5a6640361b","source":{"kind":"arxiv","id":"1903.04325","version":1},"attestation_state":"computed","paper":{"title":"The relationship between word complexity and computational complexity in subshifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.DS"],"primary_cat":"cs.DM","authors_text":"Pascal Vanier (LACL), Ronnie Pavlov","submitted_at":"2019-03-11T14:34:13Z","abstract_excerpt":"We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing spectrum can be realized via a subshift of linear complexity if and only if it consists of the union of a finite set and a finite number of cones, that a Turing spectrum can be realized via a subshift of exponential complexity (i.e. positive entropy) if and only if it contains a cone, and that every Turing spectrum which either contains degree 0 or is a union of c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1903.04325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-03-11T14:34:13Z","cross_cats_sorted":["cs.CC","cs.FL","math.DS"],"title_canon_sha256":"e1c1972734e23195b279f7f8f3cf81a0e1676bf8d824bf47a1eebaf3ed14e98f","abstract_canon_sha256":"ab9ac44db6b451b119bb092a4455d260af4a5e347e64afb37da7352c855cc2dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:35.758352Z","signature_b64":"E9UubGgRxieraGWx1RaeWkOYdiLN+u15jSg05i27Wg9ULVkjrVWzfNoJ18zyWotmKwAtB+/Z6OQnGrzdim31Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8fc2fab5ed8fb8c2d092870ce66a3a516566246addb54b944892f5a6640361b","last_reissued_at":"2026-05-17T23:51:35.757665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:35.757665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The relationship between word complexity and computational complexity in subshifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.DS"],"primary_cat":"cs.DM","authors_text":"Pascal Vanier (LACL), Ronnie Pavlov","submitted_at":"2019-03-11T14:34:13Z","abstract_excerpt":"We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing spectrum can be realized via a subshift of linear complexity if and only if it consists of the union of a finite set and a finite number of cones, that a Turing spectrum can be realized via a subshift of exponential complexity (i.e. positive entropy) if and only if it contains a cone, and that every Turing spectrum which either contains degree 0 or is a union of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04325","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.04325","created_at":"2026-05-17T23:51:35.757760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04325v1","created_at":"2026-05-17T23:51:35.757760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04325","created_at":"2026-05-17T23:51:35.757760+00:00"},{"alias_kind":"pith_short_12","alias_value":"5D6C7K263D5Y","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5D6C7K263D5YYLIJ","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5D6C7K26","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU","json":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU.json","graph_json":"https://pith.science/api/pith-number/5D6C7K263D5YYLIJFBYM4ZVDUU/graph.json","events_json":"https://pith.science/api/pith-number/5D6C7K263D5YYLIJFBYM4ZVDUU/events.json","paper":"https://pith.science/paper/5D6C7K26"},"agent_actions":{"view_html":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU","download_json":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU.json","view_paper":"https://pith.science/paper/5D6C7K26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04325&json=true","fetch_graph":"https://pith.science/api/pith-number/5D6C7K263D5YYLIJFBYM4ZVDUU/graph.json","fetch_events":"https://pith.science/api/pith-number/5D6C7K263D5YYLIJFBYM4ZVDUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU/action/storage_attestation","attest_author":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU/action/author_attestation","sign_citation":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU/action/citation_signature","submit_replication":"https://pith.science/pith/5D6C7K263D5YYLIJFBYM4ZVDUU/action/replication_record"}},"created_at":"2026-05-17T23:51:35.757760+00:00","updated_at":"2026-05-17T23:51:35.757760+00:00"}