{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T3KPWFIOXDEJN7POVREGOXFH2D","short_pith_number":"pith:T3KPWFIO","canonical_record":{"source":{"id":"1107.0471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-03T16:25:10Z","cross_cats_sorted":[],"title_canon_sha256":"ef53906a46f7f7e520a29a8e5ad9245b59b7587e1676182591e07e897656ace4","abstract_canon_sha256":"da0fb6fdcf53e403f000cdb15b6e1defaf9f3fc0ef5b9eb96b573a773c166d66"},"schema_version":"1.0"},"canonical_sha256":"9ed4fb150eb8c896fdeeac48675ca7d0c71b4dbdb6c9ef158523be7451628218","source":{"kind":"arxiv","id":"1107.0471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0471","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0471v1","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0471","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"T3KPWFIOXDEJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T3KPWFIOXDEJN7PO","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T3KPWFIO","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T3KPWFIOXDEJN7POVREGOXFH2D","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-03T16:25:10Z","cross_cats_sorted":[],"title_canon_sha256":"ef53906a46f7f7e520a29a8e5ad9245b59b7587e1676182591e07e897656ace4","abstract_canon_sha256":"da0fb6fdcf53e403f000cdb15b6e1defaf9f3fc0ef5b9eb96b573a773c166d66"},"schema_version":"1.0"},"canonical_sha256":"9ed4fb150eb8c896fdeeac48675ca7d0c71b4dbdb6c9ef158523be7451628218","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:46.389928Z","signature_b64":"95yN4gZENj1tBDH+E1k4Dy3m9nI78PTKt5on+yH0BTBl/dUTKoYFmCMGCDQUY3VKrWEh7KvP1dSC5rRJdWDhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ed4fb150eb8c896fdeeac48675ca7d0c71b4dbdb6c9ef158523be7451628218","last_reissued_at":"2026-05-18T03:34:46.389312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:46.389312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0471","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:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ow3jAb6sdCDKy7MTJCiZrt10uKWD8jgotaQqFf70SEq/aZHkN8ycAcrfIYFNS5disCYWebe6VUEfSwrQlsWqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:37:35.917152Z"},"content_sha256":"5ba7117ed1add1b219bbe039a4af12235e9025d43df93dd22d27673b4ea7e3aa","schema_version":"1.0","event_id":"sha256:5ba7117ed1add1b219bbe039a4af12235e9025d43df93dd22d27673b4ea7e3aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T3KPWFIOXDEJN7POVREGOXFH2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factor frequencies in languages invariant under more symmetries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lubomira Balkova","submitted_at":"2011-07-03T16:25:10Z","abstract_excerpt":"The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\\Delta \\C(n)$, where $\\Delta \\C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\\'a together with the author derived a better upper bound for infinite words whose language is closed under reversal. In this paper, we further diminish the upper bound for uniformly recurrent infinite words whose language is invariant under all elements of a finite group of symmetries and we prove the optimality of the obtained upper bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0471","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:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iklQu8rkFUSo5TNw8J+NcThk2WJfb5I3lam9gbkho+ssBvSSXCIiFLxjdnAP2hL4vXJL0yypnUIPQPlTVULvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:37:35.917539Z"},"content_sha256":"05c4a7a35687658ff7e8ab6ec97abc0ecff7314dab7c5378cebeaeed8c6e6103","schema_version":"1.0","event_id":"sha256:05c4a7a35687658ff7e8ab6ec97abc0ecff7314dab7c5378cebeaeed8c6e6103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3KPWFIOXDEJN7POVREGOXFH2D/bundle.json","state_url":"https://pith.science/pith/T3KPWFIOXDEJN7POVREGOXFH2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3KPWFIOXDEJN7POVREGOXFH2D/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-07-01T18:37:35Z","links":{"resolver":"https://pith.science/pith/T3KPWFIOXDEJN7POVREGOXFH2D","bundle":"https://pith.science/pith/T3KPWFIOXDEJN7POVREGOXFH2D/bundle.json","state":"https://pith.science/pith/T3KPWFIOXDEJN7POVREGOXFH2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3KPWFIOXDEJN7POVREGOXFH2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T3KPWFIOXDEJN7POVREGOXFH2D","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":"da0fb6fdcf53e403f000cdb15b6e1defaf9f3fc0ef5b9eb96b573a773c166d66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-03T16:25:10Z","title_canon_sha256":"ef53906a46f7f7e520a29a8e5ad9245b59b7587e1676182591e07e897656ace4"},"schema_version":"1.0","source":{"id":"1107.0471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0471","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0471v1","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0471","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"T3KPWFIOXDEJ","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T3KPWFIOXDEJN7PO","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T3KPWFIO","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:05c4a7a35687658ff7e8ab6ec97abc0ecff7314dab7c5378cebeaeed8c6e6103","target":"graph","created_at":"2026-05-18T03:34:46Z","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 number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\\Delta \\C(n)$, where $\\Delta \\C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\\'a together with the author derived a better upper bound for infinite words whose language is closed under reversal. In this paper, we further diminish the upper bound for uniformly recurrent infinite words whose language is invariant under all elements of a finite group of symmetries and we prove the optimality of the obtained upper bound.","authors_text":"Lubomira Balkova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-03T16:25:10Z","title":"Factor frequencies in languages invariant under more symmetries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0471","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:5ba7117ed1add1b219bbe039a4af12235e9025d43df93dd22d27673b4ea7e3aa","target":"record","created_at":"2026-05-18T03:34:46Z","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":"da0fb6fdcf53e403f000cdb15b6e1defaf9f3fc0ef5b9eb96b573a773c166d66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-03T16:25:10Z","title_canon_sha256":"ef53906a46f7f7e520a29a8e5ad9245b59b7587e1676182591e07e897656ace4"},"schema_version":"1.0","source":{"id":"1107.0471","kind":"arxiv","version":1}},"canonical_sha256":"9ed4fb150eb8c896fdeeac48675ca7d0c71b4dbdb6c9ef158523be7451628218","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ed4fb150eb8c896fdeeac48675ca7d0c71b4dbdb6c9ef158523be7451628218","first_computed_at":"2026-05-18T03:34:46.389312Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:46.389312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"95yN4gZENj1tBDH+E1k4Dy3m9nI78PTKt5on+yH0BTBl/dUTKoYFmCMGCDQUY3VKrWEh7KvP1dSC5rRJdWDhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:46.389928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ba7117ed1add1b219bbe039a4af12235e9025d43df93dd22d27673b4ea7e3aa","sha256:05c4a7a35687658ff7e8ab6ec97abc0ecff7314dab7c5378cebeaeed8c6e6103"],"state_sha256":"35df2c779147562c33e6c9cf24d35996c12dec9ae6109faa19675d70717ffd35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHs+xYCkyaIh/wO9cQGT2b+1ss3HV+FibsPTVnRQmIi8IACiub/9mIvNRpGbnu09FTXCw6hEIUmxRqcN1t3JAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:37:35.919475Z","bundle_sha256":"c5a7dadd804de3a0dae9e4ec90293c69956c6d8612346efc07ac81c917079ac8"}}