{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PWLMN62KRVYI7F25NPZPZWF6FC","short_pith_number":"pith:PWLMN62K","canonical_record":{"source":{"id":"1212.3064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-12-13T06:25:29Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"9ea3b40eb8a8a5fb3120054492e70674e310a05fd29f1de04c1ea684db33fc13","abstract_canon_sha256":"dd8e075009b62294a8b44872b3fb4cd2c9acb23bb22c719aec75cdd95edda334"},"schema_version":"1.0"},"canonical_sha256":"7d96c6fb4a8d708f975d6bf2fcd8be289915f4dcbb291dd9fa098dff66d7817e","source":{"kind":"arxiv","id":"1212.3064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3064","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3064v1","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3064","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"PWLMN62KRVYI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PWLMN62KRVYI7F25","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PWLMN62K","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PWLMN62KRVYI7F25NPZPZWF6FC","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-12-13T06:25:29Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"9ea3b40eb8a8a5fb3120054492e70674e310a05fd29f1de04c1ea684db33fc13","abstract_canon_sha256":"dd8e075009b62294a8b44872b3fb4cd2c9acb23bb22c719aec75cdd95edda334"},"schema_version":"1.0"},"canonical_sha256":"7d96c6fb4a8d708f975d6bf2fcd8be289915f4dcbb291dd9fa098dff66d7817e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:18.189901Z","signature_b64":"KD/+NvZhoNensas6Wyd1YjA09xYrsDhABwS6A182bd0XKE5RTZbtlWi+2pRM+JVF2qHcG+4hzdHa/b0GlFfqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d96c6fb4a8d708f975d6bf2fcd8be289915f4dcbb291dd9fa098dff66d7817e","last_reissued_at":"2026-05-17T23:53:18.189144Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:18.189144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3064","source_version":1,"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-17T23:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDW/N/2yjG2k2MwLtKcwiGyY0p+G4QFxuRj5UmroF84534R+Gsf/cViCV9fYAPAvcZbN/xk7V1PYjUYowRXBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:09:32.490006Z"},"content_sha256":"cda45524426cc8064a61eb8a90f300b593a7a458a0a8ecfaa22df1897be564d0","schema_version":"1.0","event_id":"sha256:cda45524426cc8064a61eb8a90f300b593a7a458a0a8ecfaa22df1897be564d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PWLMN62KRVYI7F25NPZPZWF6FC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subword complexity and Sturmian colorings of regular trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"math.DS","authors_text":"Dong Han Kim, Seonhee Lim","submitted_at":"2012-12-13T06:25:29Z","abstract_excerpt":"In this article, we study subword complexity of colorings of regular trees. We characterize colorings of bounded subword complexity and study Sturmian colorings, which are colorings of minimal unbounded subword complexity.\n  We classify Sturmian colorings using their type sets. We show that any Sturmian coloring is a lifting of a coloring on a quotient graph of the tree which is a geodesic or a ray with loops possibly attached, thus a lifting of an \"infinte word\". We further give a complete characterization of the quotient graph for eventually periodic ones."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3064","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"},"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-17T23:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D8DDSlSjgheiWPO8r/wPFqAws/+ic1YVnp9PUA5ZI3Kdku3pz8k6HAjEdm1P/YNHuFmzcnJ7vv2K98PnUY4TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:09:32.490360Z"},"content_sha256":"0dfa1bb40455a04bfa69626a97c1b58fc8d3b12b4795b4029b7e1b402a0bfe65","schema_version":"1.0","event_id":"sha256:0dfa1bb40455a04bfa69626a97c1b58fc8d3b12b4795b4029b7e1b402a0bfe65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWLMN62KRVYI7F25NPZPZWF6FC/bundle.json","state_url":"https://pith.science/pith/PWLMN62KRVYI7F25NPZPZWF6FC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWLMN62KRVYI7F25NPZPZWF6FC/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-01T21:09:32Z","links":{"resolver":"https://pith.science/pith/PWLMN62KRVYI7F25NPZPZWF6FC","bundle":"https://pith.science/pith/PWLMN62KRVYI7F25NPZPZWF6FC/bundle.json","state":"https://pith.science/pith/PWLMN62KRVYI7F25NPZPZWF6FC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWLMN62KRVYI7F25NPZPZWF6FC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PWLMN62KRVYI7F25NPZPZWF6FC","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":"dd8e075009b62294a8b44872b3fb4cd2c9acb23bb22c719aec75cdd95edda334","cross_cats_sorted":["math.CO","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-12-13T06:25:29Z","title_canon_sha256":"9ea3b40eb8a8a5fb3120054492e70674e310a05fd29f1de04c1ea684db33fc13"},"schema_version":"1.0","source":{"id":"1212.3064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3064","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3064v1","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3064","created_at":"2026-05-17T23:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"PWLMN62KRVYI","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PWLMN62KRVYI7F25","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PWLMN62K","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:0dfa1bb40455a04bfa69626a97c1b58fc8d3b12b4795b4029b7e1b402a0bfe65","target":"graph","created_at":"2026-05-17T23:53:18Z","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 article, we study subword complexity of colorings of regular trees. We characterize colorings of bounded subword complexity and study Sturmian colorings, which are colorings of minimal unbounded subword complexity.\n  We classify Sturmian colorings using their type sets. We show that any Sturmian coloring is a lifting of a coloring on a quotient graph of the tree which is a geodesic or a ray with loops possibly attached, thus a lifting of an \"infinte word\". We further give a complete characterization of the quotient graph for eventually periodic ones.","authors_text":"Dong Han Kim, Seonhee Lim","cross_cats":["math.CO","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-12-13T06:25:29Z","title":"Subword complexity and Sturmian colorings of regular trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3064","kind":"arxiv","version":1},"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:cda45524426cc8064a61eb8a90f300b593a7a458a0a8ecfaa22df1897be564d0","target":"record","created_at":"2026-05-17T23:53:18Z","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":"dd8e075009b62294a8b44872b3fb4cd2c9acb23bb22c719aec75cdd95edda334","cross_cats_sorted":["math.CO","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-12-13T06:25:29Z","title_canon_sha256":"9ea3b40eb8a8a5fb3120054492e70674e310a05fd29f1de04c1ea684db33fc13"},"schema_version":"1.0","source":{"id":"1212.3064","kind":"arxiv","version":1}},"canonical_sha256":"7d96c6fb4a8d708f975d6bf2fcd8be289915f4dcbb291dd9fa098dff66d7817e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d96c6fb4a8d708f975d6bf2fcd8be289915f4dcbb291dd9fa098dff66d7817e","first_computed_at":"2026-05-17T23:53:18.189144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:18.189144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KD/+NvZhoNensas6Wyd1YjA09xYrsDhABwS6A182bd0XKE5RTZbtlWi+2pRM+JVF2qHcG+4hzdHa/b0GlFfqBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:18.189901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda45524426cc8064a61eb8a90f300b593a7a458a0a8ecfaa22df1897be564d0","sha256:0dfa1bb40455a04bfa69626a97c1b58fc8d3b12b4795b4029b7e1b402a0bfe65"],"state_sha256":"978e71b2f49691f1b1214c0d99274fd8c1133de49f9caa0a545a6bcefe1eaca5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwpwCHlwZCkjm9Fztl2YjMYZ/T/KJeQd0p3wrflPXqXsKH2DNDOHUQqrynQMbU979p5y88sQzyr/Q+G8TlbZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:09:32.492241Z","bundle_sha256":"d1d7d44ff7c4e5c6afa7c69d1b09323c0ea2c06f4d2bd0ee9e2a33bdc1cf59cf"}}