{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AAPCAQ5AWSQPEIY7ZNLB3SULBP","short_pith_number":"pith:AAPCAQ5A","schema_version":"1.0","canonical_sha256":"001e2043a0b4a0f2231fcb561dca8b0bc1d64c9f595e23a5d0b2a7056d5bc5d5","source":{"kind":"arxiv","id":"1502.06262","version":3},"attestation_state":"computed","paper":{"title":"Sliding block codes between shift spaces over infinite alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OA"],"primary_cat":"math.DS","authors_text":"Charles Starling, Daniel Gon\\c{c}alves, Marcelo Sobottka","submitted_at":"2015-02-22T19:31:25Z","abstract_excerpt":"Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding block codes between Ott-Tomforde-Willis shift spaces and then we prove Curtis-Hedlund-Lyndon type theorems for them, finding sufficient and necessary conditions under which the class of the sliding block codes coincides with the class of continuous shift-commuting maps."},"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":"1502.06262","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-02-22T19:31:25Z","cross_cats_sorted":["math.OA"],"title_canon_sha256":"054837a9f861b295ea8e1fa789b72d8224eaf0557ca0745aa7ce4e606b585851","abstract_canon_sha256":"4fa2363a0bc9122c0373e7d36e028524fdee0f2c1bac8c4d8bdf8d886cf83d59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:26.980544Z","signature_b64":"SnwJfjbWKOCpfyiwiPjFK97vfMiV1k+Qw0x+oRG2Hxm5X1E2l5y1FZYv97CTTLrxvi3JRQ4OYrPK/tPBls0mCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"001e2043a0b4a0f2231fcb561dca8b0bc1d64c9f595e23a5d0b2a7056d5bc5d5","last_reissued_at":"2026-05-18T00:23:26.979976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:26.979976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sliding block codes between shift spaces over infinite alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OA"],"primary_cat":"math.DS","authors_text":"Charles Starling, Daniel Gon\\c{c}alves, Marcelo Sobottka","submitted_at":"2015-02-22T19:31:25Z","abstract_excerpt":"Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding block codes between Ott-Tomforde-Willis shift spaces and then we prove Curtis-Hedlund-Lyndon type theorems for them, finding sufficient and necessary conditions under which the class of the sliding block codes coincides with the class of continuous shift-commuting maps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06262","kind":"arxiv","version":3},"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":"1502.06262","created_at":"2026-05-18T00:23:26.980054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06262v3","created_at":"2026-05-18T00:23:26.980054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06262","created_at":"2026-05-18T00:23:26.980054+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAPCAQ5AWSQP","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAPCAQ5AWSQPEIY7","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAPCAQ5A","created_at":"2026-05-18T12:29:10.953037+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/AAPCAQ5AWSQPEIY7ZNLB3SULBP","json":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP.json","graph_json":"https://pith.science/api/pith-number/AAPCAQ5AWSQPEIY7ZNLB3SULBP/graph.json","events_json":"https://pith.science/api/pith-number/AAPCAQ5AWSQPEIY7ZNLB3SULBP/events.json","paper":"https://pith.science/paper/AAPCAQ5A"},"agent_actions":{"view_html":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP","download_json":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP.json","view_paper":"https://pith.science/paper/AAPCAQ5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06262&json=true","fetch_graph":"https://pith.science/api/pith-number/AAPCAQ5AWSQPEIY7ZNLB3SULBP/graph.json","fetch_events":"https://pith.science/api/pith-number/AAPCAQ5AWSQPEIY7ZNLB3SULBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP/action/storage_attestation","attest_author":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP/action/author_attestation","sign_citation":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP/action/citation_signature","submit_replication":"https://pith.science/pith/AAPCAQ5AWSQPEIY7ZNLB3SULBP/action/replication_record"}},"created_at":"2026-05-18T00:23:26.980054+00:00","updated_at":"2026-05-18T00:23:26.980054+00:00"}