{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KL5HLVCUAVXQZ3ZI36ISJRIVDR","short_pith_number":"pith:KL5HLVCU","canonical_record":{"source":{"id":"1301.5104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T08:27:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"66c5aaacc601a00777b6fb0f986b162c4307d37e0f8981022e77c309cd1c1e6b","abstract_canon_sha256":"07c436c8eb3063077d265f40bd620dd16539a74481173fd7be4c8414bee606e5"},"schema_version":"1.0"},"canonical_sha256":"52fa75d454056f0cef28df9124c5151c4dcf98c4f7197816647bcfebb100512a","source":{"kind":"arxiv","id":"1301.5104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5104","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5104v1","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5104","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"KL5HLVCUAVXQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KL5HLVCUAVXQZ3ZI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KL5HLVCU","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KL5HLVCUAVXQZ3ZI36ISJRIVDR","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T08:27:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"66c5aaacc601a00777b6fb0f986b162c4307d37e0f8981022e77c309cd1c1e6b","abstract_canon_sha256":"07c436c8eb3063077d265f40bd620dd16539a74481173fd7be4c8414bee606e5"},"schema_version":"1.0"},"canonical_sha256":"52fa75d454056f0cef28df9124c5151c4dcf98c4f7197816647bcfebb100512a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:53.037311Z","signature_b64":"FcOLdJYkkDd1XhRdIrkLRY6o/ONExC+d+cNDe+4CmJIlQAE6l7LE9AQciQsQs6WZFpGjMo3ZwGOYy9B+tQ31Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52fa75d454056f0cef28df9124c5151c4dcf98c4f7197816647bcfebb100512a","last_reissued_at":"2026-05-18T03:35:53.036578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:53.036578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5104","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-18T03:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTJ78Xd4hlN+kiAUkgKsT+yD3tOyIlYxXPKcSmYKJ3SuHWqWtYTuLCnccyZp+Vb2AEXTqH4sYpYF9vwO9A8DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:08:58.655159Z"},"content_sha256":"c4d5b36939dc695c82696471cbc34363a04a655f78e6bf1d133debdba5acf8d6","schema_version":"1.0","event_id":"sha256:c4d5b36939dc695c82696471cbc34363a04a655f78e6bf1d133debdba5acf8d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KL5HLVCUAVXQZ3ZI36ISJRIVDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a generalization of Abelian equivalence and complexity of infinite words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Aleksi Saarela, Juhani Karhumaki, Luca Q. Zamboni","submitted_at":"2013-01-22T08:27:59Z","abstract_excerpt":"In this paper we introduce and study a family of complexity functions of infinite words indexed by $k \\in \\ints ^+ \\cup {+\\infty}.$ Let $k \\in \\ints ^+ \\cup {+\\infty}$ and $A$ be a finite non-empty set. Two finite words $u$ and $v$ in $A^*$ are said to be $k$-Abelian equivalent if for all $x\\in A^*$ of length less than or equal to $k,$ the number of occurrences of $x$ in $u$ is equal to the number of occurrences of $x$ in $v.$ This defines a family of equivalence relations $\\thicksim_k$ on $A^*,$ bridging the gap between the usual notion of Abelian equivalence (when $k=1$) and equality (when $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5104","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-18T03:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOuHs4xdPTvT+XS1etO4+GetF1Q1FRdIZZ36N+zzB17k0oWxVc++4W6TJzU0JnCzfr6nkm50h/Q0J6rf66QhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:08:58.655802Z"},"content_sha256":"eaab8d5b3347fd034b90cdcb38bef7a7119ade71c42fbe12fe30b6798cac60c9","schema_version":"1.0","event_id":"sha256:eaab8d5b3347fd034b90cdcb38bef7a7119ade71c42fbe12fe30b6798cac60c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR/bundle.json","state_url":"https://pith.science/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR/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-09T17:08:58Z","links":{"resolver":"https://pith.science/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR","bundle":"https://pith.science/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR/bundle.json","state":"https://pith.science/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL5HLVCUAVXQZ3ZI36ISJRIVDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KL5HLVCUAVXQZ3ZI36ISJRIVDR","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":"07c436c8eb3063077d265f40bd620dd16539a74481173fd7be4c8414bee606e5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T08:27:59Z","title_canon_sha256":"66c5aaacc601a00777b6fb0f986b162c4307d37e0f8981022e77c309cd1c1e6b"},"schema_version":"1.0","source":{"id":"1301.5104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5104","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5104v1","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5104","created_at":"2026-05-18T03:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"KL5HLVCUAVXQ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KL5HLVCUAVXQZ3ZI","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KL5HLVCU","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:eaab8d5b3347fd034b90cdcb38bef7a7119ade71c42fbe12fe30b6798cac60c9","target":"graph","created_at":"2026-05-18T03:35:53Z","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 paper we introduce and study a family of complexity functions of infinite words indexed by $k \\in \\ints ^+ \\cup {+\\infty}.$ Let $k \\in \\ints ^+ \\cup {+\\infty}$ and $A$ be a finite non-empty set. Two finite words $u$ and $v$ in $A^*$ are said to be $k$-Abelian equivalent if for all $x\\in A^*$ of length less than or equal to $k,$ the number of occurrences of $x$ in $u$ is equal to the number of occurrences of $x$ in $v.$ This defines a family of equivalence relations $\\thicksim_k$ on $A^*,$ bridging the gap between the usual notion of Abelian equivalence (when $k=1$) and equality (when $","authors_text":"Aleksi Saarela, Juhani Karhumaki, Luca Q. Zamboni","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T08:27:59Z","title":"On a generalization of Abelian equivalence and complexity of infinite words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5104","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:c4d5b36939dc695c82696471cbc34363a04a655f78e6bf1d133debdba5acf8d6","target":"record","created_at":"2026-05-18T03:35:53Z","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":"07c436c8eb3063077d265f40bd620dd16539a74481173fd7be4c8414bee606e5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-22T08:27:59Z","title_canon_sha256":"66c5aaacc601a00777b6fb0f986b162c4307d37e0f8981022e77c309cd1c1e6b"},"schema_version":"1.0","source":{"id":"1301.5104","kind":"arxiv","version":1}},"canonical_sha256":"52fa75d454056f0cef28df9124c5151c4dcf98c4f7197816647bcfebb100512a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52fa75d454056f0cef28df9124c5151c4dcf98c4f7197816647bcfebb100512a","first_computed_at":"2026-05-18T03:35:53.036578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:53.036578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FcOLdJYkkDd1XhRdIrkLRY6o/ONExC+d+cNDe+4CmJIlQAE6l7LE9AQciQsQs6WZFpGjMo3ZwGOYy9B+tQ31Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:53.037311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4d5b36939dc695c82696471cbc34363a04a655f78e6bf1d133debdba5acf8d6","sha256:eaab8d5b3347fd034b90cdcb38bef7a7119ade71c42fbe12fe30b6798cac60c9"],"state_sha256":"130442173b6ffb93f4ee3593c900224e31854721ece0f8a8d9649ec249887d94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCcmedZjph1L/zfeBV7qJ5324Lo6CO6cKVu/a/pjrLELekL90f/GBYJrevUpgouLxCudHBWUw/tr565l0bb/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:08:58.659830Z","bundle_sha256":"e5f57ac7993e257f6f45148c0ee9cd9c7d8803abe026319b5de24950d0d9ead6"}}