{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:22EI4VG6VYIH4KQ75L7YNXAX2G","short_pith_number":"pith:22EI4VG6","canonical_record":{"source":{"id":"1107.4654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-23T04:05:16Z","cross_cats_sorted":[],"title_canon_sha256":"0326547b4d27057bd0718277fe4007925768147ddacc0f3a07d33b1148a3f3c5","abstract_canon_sha256":"a9ecffc19cd0a650f9c4c5f7140b9a966b2f716ce9538022a006f1962660aa30"},"schema_version":"1.0"},"canonical_sha256":"d6888e54deae107e2a1feaff86dc17d196bbd793c80175b0fe98aeca5c4dfe2f","source":{"kind":"arxiv","id":"1107.4654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4654","created_at":"2026-05-18T04:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4654v1","created_at":"2026-05-18T04:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4654","created_at":"2026-05-18T04:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"22EI4VG6VYIH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"22EI4VG6VYIH4KQ7","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"22EI4VG6","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:22EI4VG6VYIH4KQ75L7YNXAX2G","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-23T04:05:16Z","cross_cats_sorted":[],"title_canon_sha256":"0326547b4d27057bd0718277fe4007925768147ddacc0f3a07d33b1148a3f3c5","abstract_canon_sha256":"a9ecffc19cd0a650f9c4c5f7140b9a966b2f716ce9538022a006f1962660aa30"},"schema_version":"1.0"},"canonical_sha256":"d6888e54deae107e2a1feaff86dc17d196bbd793c80175b0fe98aeca5c4dfe2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:02.112062Z","signature_b64":"HnFjBdVqnODxExvKslEbNjcnyhUb/JtuYziBSH3LjuquknYiRq9Rw3zCL4ZZ/R46/81SekiqGax8D45LLHbTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6888e54deae107e2a1feaff86dc17d196bbd793c80175b0fe98aeca5c4dfe2f","last_reissued_at":"2026-05-18T04:17:02.111506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:02.111506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4654","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-18T04:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXF9hDp/HOYSNvF2ZYubipGNLtrOnkD0x1k0o0KotzCY1Y4tt+/CMEMmUcSgaazX+HO5rqGIKBoxoLUYFQtPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:56:14.991980Z"},"content_sha256":"3b82a49d484a7d5df2d117f729330f343de27cf3b7aba223f468293ca93b5f9d","schema_version":"1.0","event_id":"sha256:3b82a49d484a7d5df2d117f729330f343de27cf3b7aba223f468293ca93b5f9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:22EI4VG6VYIH4KQ75L7YNXAX2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On abelian and additive complexity in infinite words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hayri Ardal, Julian Sahasrabudhe, Tom Brown, Veselin Jungi\\'c","submitted_at":"2011-07-23T04:05:16Z","abstract_excerpt":"The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We provide an alternative proof of one of the results of Richomme, Saari, and Zamboni."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4654","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-18T04:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xAlgpVN5Nlxa+s+xoQmUQpSg2/lqd3WYau8OtkgMJLy7FgafvVXhlyOHWwOsr8+VdTTVUhbnUqfgoFy9bRA8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:56:14.992307Z"},"content_sha256":"38b8b74ebe2fdc5514c05c5741794e25f6c97aa2e79433c3c1bd6d4180416dbf","schema_version":"1.0","event_id":"sha256:38b8b74ebe2fdc5514c05c5741794e25f6c97aa2e79433c3c1bd6d4180416dbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22EI4VG6VYIH4KQ75L7YNXAX2G/bundle.json","state_url":"https://pith.science/pith/22EI4VG6VYIH4KQ75L7YNXAX2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22EI4VG6VYIH4KQ75L7YNXAX2G/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-29T15:56:14Z","links":{"resolver":"https://pith.science/pith/22EI4VG6VYIH4KQ75L7YNXAX2G","bundle":"https://pith.science/pith/22EI4VG6VYIH4KQ75L7YNXAX2G/bundle.json","state":"https://pith.science/pith/22EI4VG6VYIH4KQ75L7YNXAX2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22EI4VG6VYIH4KQ75L7YNXAX2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:22EI4VG6VYIH4KQ75L7YNXAX2G","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":"a9ecffc19cd0a650f9c4c5f7140b9a966b2f716ce9538022a006f1962660aa30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-23T04:05:16Z","title_canon_sha256":"0326547b4d27057bd0718277fe4007925768147ddacc0f3a07d33b1148a3f3c5"},"schema_version":"1.0","source":{"id":"1107.4654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4654","created_at":"2026-05-18T04:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4654v1","created_at":"2026-05-18T04:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4654","created_at":"2026-05-18T04:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"22EI4VG6VYIH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"22EI4VG6VYIH4KQ7","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"22EI4VG6","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:38b8b74ebe2fdc5514c05c5741794e25f6c97aa2e79433c3c1bd6d4180416dbf","target":"graph","created_at":"2026-05-18T04:17:02Z","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":"The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We provide an alternative proof of one of the results of Richomme, Saari, and Zamboni.","authors_text":"Hayri Ardal, Julian Sahasrabudhe, Tom Brown, Veselin Jungi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-23T04:05:16Z","title":"On abelian and additive complexity in infinite words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4654","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:3b82a49d484a7d5df2d117f729330f343de27cf3b7aba223f468293ca93b5f9d","target":"record","created_at":"2026-05-18T04:17:02Z","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":"a9ecffc19cd0a650f9c4c5f7140b9a966b2f716ce9538022a006f1962660aa30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-23T04:05:16Z","title_canon_sha256":"0326547b4d27057bd0718277fe4007925768147ddacc0f3a07d33b1148a3f3c5"},"schema_version":"1.0","source":{"id":"1107.4654","kind":"arxiv","version":1}},"canonical_sha256":"d6888e54deae107e2a1feaff86dc17d196bbd793c80175b0fe98aeca5c4dfe2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6888e54deae107e2a1feaff86dc17d196bbd793c80175b0fe98aeca5c4dfe2f","first_computed_at":"2026-05-18T04:17:02.111506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:02.111506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HnFjBdVqnODxExvKslEbNjcnyhUb/JtuYziBSH3LjuquknYiRq9Rw3zCL4ZZ/R46/81SekiqGax8D45LLHbTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:02.112062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b82a49d484a7d5df2d117f729330f343de27cf3b7aba223f468293ca93b5f9d","sha256:38b8b74ebe2fdc5514c05c5741794e25f6c97aa2e79433c3c1bd6d4180416dbf"],"state_sha256":"376a937f54210e3b1808aae622a16558df72cd49dea4d2c1c746ddbf32dff3d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBqjT3xNBPQg6RctXMOS9p9G8oJWDyUcAJ81aucHQFEUDLHflStgaeaCXoWEP0TWuawayinqkdSXYMyvSN2NBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:56:14.994127Z","bundle_sha256":"2c676eacf43d4639b3ad3009c79c101b82d48cfc5b0266c790e7a8454bf95ac9"}}