{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AIOOR7X4XIOAPBPBZ755P7DBRN","short_pith_number":"pith:AIOOR7X4","canonical_record":{"source":{"id":"1507.02180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-07-08T14:46:31Z","cross_cats_sorted":["cs.IT","math.HO","math.IT"],"title_canon_sha256":"5cb21a9f95d7eede388ae41069f7a0d75ad640e56c59a729464aba4ec1a89dbc","abstract_canon_sha256":"9929617a9cb1d18646928cc0c9a1ba8106b7db1d597277315afdb9a15f833fc8"},"schema_version":"1.0"},"canonical_sha256":"021ce8fefcba1c0785e1cffbd7fc618b7e2454e29c358a7a16016ca493e5fac6","source":{"kind":"arxiv","id":"1507.02180","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02180","created_at":"2026-05-18T00:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02180v2","created_at":"2026-05-18T00:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02180","created_at":"2026-05-18T00:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"AIOOR7X4XIOA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AIOOR7X4XIOAPBPB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AIOOR7X4","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AIOOR7X4XIOAPBPBZ755P7DBRN","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02180","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-07-08T14:46:31Z","cross_cats_sorted":["cs.IT","math.HO","math.IT"],"title_canon_sha256":"5cb21a9f95d7eede388ae41069f7a0d75ad640e56c59a729464aba4ec1a89dbc","abstract_canon_sha256":"9929617a9cb1d18646928cc0c9a1ba8106b7db1d597277315afdb9a15f833fc8"},"schema_version":"1.0"},"canonical_sha256":"021ce8fefcba1c0785e1cffbd7fc618b7e2454e29c358a7a16016ca493e5fac6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:26.919955Z","signature_b64":"SP5zYB2EHJERMrfBvRTBJBp+VD7giDjzweS3wmiGogU8fFmZdqyEaL1Bd+b/S4zocDIu0tFB6WjZoktTUdBvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"021ce8fefcba1c0785e1cffbd7fc618b7e2454e29c358a7a16016ca493e5fac6","last_reissued_at":"2026-05-18T00:23:26.919271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:26.919271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02180","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMAcxFjGYjkdZxM3jTFdC0MZrnKjlw/t/TlG+LQm0BONcDaHUteOukl/70GCDJRp00YQkl/ONK0onDqgEGmgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:02:34.794398Z"},"content_sha256":"642e67916079551cbb0810e00d978d96501e060e5e81b836722d060ab4adb282","schema_version":"1.0","event_id":"sha256:642e67916079551cbb0810e00d978d96501e060e5e81b836722d060ab4adb282"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AIOOR7X4XIOAPBPBZ755P7DBRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.HO","math.IT"],"primary_cat":"math.DS","authors_text":"Daniel Gon\\c{c}alves, Marcelo Sobottka","submitted_at":"2015-07-08T14:46:31Z","abstract_excerpt":"In this note we propose an alternative definition for sliding block codes between shift spaces. This definition coincides with the usual definition in the case that the shift space is defined on a finite alphabet, but it encompass a larger class of maps when the alphabet is infinite. In any case, the proposed definition keeps the idea that a sliding block code is a map with a local rule. Using this new definition we prove that the Curtis-Hedlund-Lyndon Theorem always holds for shift spaces over countable alphabets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02180","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eh8I/g10hjOc4GruSoH0e+QCG9PZa6e7FVtez3oUrbNpYm+YzFDgBGdRXtam55nKISa245sjwmF6b4Y6RJt8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:02:34.794748Z"},"content_sha256":"316817f9cde3d1f446924d55539d5491c71962d347d29950a8bd00b91cd564db","schema_version":"1.0","event_id":"sha256:316817f9cde3d1f446924d55539d5491c71962d347d29950a8bd00b91cd564db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIOOR7X4XIOAPBPBZ755P7DBRN/bundle.json","state_url":"https://pith.science/pith/AIOOR7X4XIOAPBPBZ755P7DBRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIOOR7X4XIOAPBPBZ755P7DBRN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:02:34Z","links":{"resolver":"https://pith.science/pith/AIOOR7X4XIOAPBPBZ755P7DBRN","bundle":"https://pith.science/pith/AIOOR7X4XIOAPBPBZ755P7DBRN/bundle.json","state":"https://pith.science/pith/AIOOR7X4XIOAPBPBZ755P7DBRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIOOR7X4XIOAPBPBZ755P7DBRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AIOOR7X4XIOAPBPBZ755P7DBRN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9929617a9cb1d18646928cc0c9a1ba8106b7db1d597277315afdb9a15f833fc8","cross_cats_sorted":["cs.IT","math.HO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-07-08T14:46:31Z","title_canon_sha256":"5cb21a9f95d7eede388ae41069f7a0d75ad640e56c59a729464aba4ec1a89dbc"},"schema_version":"1.0","source":{"id":"1507.02180","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02180","created_at":"2026-05-18T00:23:26Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02180v2","created_at":"2026-05-18T00:23:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02180","created_at":"2026-05-18T00:23:26Z"},{"alias_kind":"pith_short_12","alias_value":"AIOOR7X4XIOA","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AIOOR7X4XIOAPBPB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AIOOR7X4","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:316817f9cde3d1f446924d55539d5491c71962d347d29950a8bd00b91cd564db","target":"graph","created_at":"2026-05-18T00:23:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this note we propose an alternative definition for sliding block codes between shift spaces. This definition coincides with the usual definition in the case that the shift space is defined on a finite alphabet, but it encompass a larger class of maps when the alphabet is infinite. In any case, the proposed definition keeps the idea that a sliding block code is a map with a local rule. Using this new definition we prove that the Curtis-Hedlund-Lyndon Theorem always holds for shift spaces over countable alphabets.","authors_text":"Daniel Gon\\c{c}alves, Marcelo Sobottka","cross_cats":["cs.IT","math.HO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-07-08T14:46:31Z","title":"A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02180","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:642e67916079551cbb0810e00d978d96501e060e5e81b836722d060ab4adb282","target":"record","created_at":"2026-05-18T00:23:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9929617a9cb1d18646928cc0c9a1ba8106b7db1d597277315afdb9a15f833fc8","cross_cats_sorted":["cs.IT","math.HO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-07-08T14:46:31Z","title_canon_sha256":"5cb21a9f95d7eede388ae41069f7a0d75ad640e56c59a729464aba4ec1a89dbc"},"schema_version":"1.0","source":{"id":"1507.02180","kind":"arxiv","version":2}},"canonical_sha256":"021ce8fefcba1c0785e1cffbd7fc618b7e2454e29c358a7a16016ca493e5fac6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"021ce8fefcba1c0785e1cffbd7fc618b7e2454e29c358a7a16016ca493e5fac6","first_computed_at":"2026-05-18T00:23:26.919271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:26.919271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SP5zYB2EHJERMrfBvRTBJBp+VD7giDjzweS3wmiGogU8fFmZdqyEaL1Bd+b/S4zocDIu0tFB6WjZoktTUdBvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:26.919955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02180","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:642e67916079551cbb0810e00d978d96501e060e5e81b836722d060ab4adb282","sha256:316817f9cde3d1f446924d55539d5491c71962d347d29950a8bd00b91cd564db"],"state_sha256":"3597e80eb07c4caf2088c84542c6e4c42f1b91896ded61878bbb2015dd489b30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASSjpaRN5Ha+EkDd7nbREh0bAv3nwc3+sghnCrQvGmZnCWquV87KCV0Kr+coPWGET3vKsB9fzcjfiSGua+KyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:02:34.796708Z","bundle_sha256":"7d58c7ff7fb8c7570dd98409ae5ea357dfcc11ef94f3636f62430e9e58b09de7"}}