{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SSPCXBYFPJDM3XNVXQ6PUYLPSW","short_pith_number":"pith:SSPCXBYF","canonical_record":{"source":{"id":"1007.2724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-16T09:28:34Z","cross_cats_sorted":[],"title_canon_sha256":"72e0ff560cfa30ccc886ac761cba2b9463e78d79d3e1bdce6082f1d3d4d18d56","abstract_canon_sha256":"24097cb8d84aba4b28c1fc1848650552eeabd064c55f2a2739b79050a2f428c9"},"schema_version":"1.0"},"canonical_sha256":"949e2b87057a46cdddb5bc3cfa616f95951f07a905a698e540962a871f124569","source":{"kind":"arxiv","id":"1007.2724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2724","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2724v1","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2724","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"SSPCXBYFPJDM","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SSPCXBYFPJDM3XNV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SSPCXBYF","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SSPCXBYFPJDM3XNVXQ6PUYLPSW","target":"record","payload":{"canonical_record":{"source":{"id":"1007.2724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-16T09:28:34Z","cross_cats_sorted":[],"title_canon_sha256":"72e0ff560cfa30ccc886ac761cba2b9463e78d79d3e1bdce6082f1d3d4d18d56","abstract_canon_sha256":"24097cb8d84aba4b28c1fc1848650552eeabd064c55f2a2739b79050a2f428c9"},"schema_version":"1.0"},"canonical_sha256":"949e2b87057a46cdddb5bc3cfa616f95951f07a905a698e540962a871f124569","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:31.074782Z","signature_b64":"/HN5qT3Zrc5+mUHRt9qS01WDeKwvrFlQyr8amngaA4BQ2W+Hx4QAEWstPWAG6rPJpEcj1EJqHrMjPVpTMyavDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949e2b87057a46cdddb5bc3cfa616f95951f07a905a698e540962a871f124569","last_reissued_at":"2026-05-18T00:43:31.074326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:31.074326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.2724","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-18T00:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78jW7th0LXfjkiinDbr1IorVZrEHwiEgQjQFOFlbDGdnMDcoJcQz0qlGGt4hjyvj3NevGcgbCxRbz8vNNfZtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:40:32.313895Z"},"content_sha256":"383a09080cf03eef20f473c0088a2e240a0d4a73ee2ef8028e2f4f7b1c10f762","schema_version":"1.0","event_id":"sha256:383a09080cf03eef20f473c0088a2e240a0d4a73ee2ef8028e2f4f7b1c10f762"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SSPCXBYFPJDM3XNVXQ6PUYLPSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Pelantov\\'a, K. Klouda, L. Balkov\\'a","submitted_at":"2010-07-16T09:28:34Z","abstract_excerpt":"In this paper, we study the critical exponent of infinite words $\\ubeta$ coding $\\beta$-integers for $\\beta$ being a~non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in the infinite word in question. We calculate also the ultimate critical exponent that expresses how long repetitions occur in the infinite word $\\ubeta$ when the factors of length growing ad infinitum are considered. The basic ingredients of our method are the description of all bispecial factors of $\\ubeta$ and the notion of return words. This method can be applie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2724","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-18T00:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4X3sHt0zMWHk18hlr/KgEdmsvyvRMp1GjbYW81wRAkRgdZdWu7N4q/q7o3gFx1jZ+r0g6xtLwPhVITQpGzDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:40:32.314247Z"},"content_sha256":"c9bd7c8572eba049effb47881c47ab8e8f18bf53aa7e866f3f2b85ba039c1193","schema_version":"1.0","event_id":"sha256:c9bd7c8572eba049effb47881c47ab8e8f18bf53aa7e866f3f2b85ba039c1193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW/bundle.json","state_url":"https://pith.science/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW/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-21T16:40:32Z","links":{"resolver":"https://pith.science/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW","bundle":"https://pith.science/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW/bundle.json","state":"https://pith.science/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSPCXBYFPJDM3XNVXQ6PUYLPSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SSPCXBYFPJDM3XNVXQ6PUYLPSW","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":"24097cb8d84aba4b28c1fc1848650552eeabd064c55f2a2739b79050a2f428c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-16T09:28:34Z","title_canon_sha256":"72e0ff560cfa30ccc886ac761cba2b9463e78d79d3e1bdce6082f1d3d4d18d56"},"schema_version":"1.0","source":{"id":"1007.2724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.2724","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.2724v1","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2724","created_at":"2026-05-18T00:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"SSPCXBYFPJDM","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SSPCXBYFPJDM3XNV","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SSPCXBYF","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:c9bd7c8572eba049effb47881c47ab8e8f18bf53aa7e866f3f2b85ba039c1193","target":"graph","created_at":"2026-05-18T00:43:31Z","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 study the critical exponent of infinite words $\\ubeta$ coding $\\beta$-integers for $\\beta$ being a~non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in the infinite word in question. We calculate also the ultimate critical exponent that expresses how long repetitions occur in the infinite word $\\ubeta$ when the factors of length growing ad infinitum are considered. The basic ingredients of our method are the description of all bispecial factors of $\\ubeta$ and the notion of return words. This method can be applie","authors_text":"E. Pelantov\\'a, K. Klouda, L. Balkov\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-16T09:28:34Z","title":"Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2724","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:383a09080cf03eef20f473c0088a2e240a0d4a73ee2ef8028e2f4f7b1c10f762","target":"record","created_at":"2026-05-18T00:43:31Z","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":"24097cb8d84aba4b28c1fc1848650552eeabd064c55f2a2739b79050a2f428c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-16T09:28:34Z","title_canon_sha256":"72e0ff560cfa30ccc886ac761cba2b9463e78d79d3e1bdce6082f1d3d4d18d56"},"schema_version":"1.0","source":{"id":"1007.2724","kind":"arxiv","version":1}},"canonical_sha256":"949e2b87057a46cdddb5bc3cfa616f95951f07a905a698e540962a871f124569","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"949e2b87057a46cdddb5bc3cfa616f95951f07a905a698e540962a871f124569","first_computed_at":"2026-05-18T00:43:31.074326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:31.074326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HN5qT3Zrc5+mUHRt9qS01WDeKwvrFlQyr8amngaA4BQ2W+Hx4QAEWstPWAG6rPJpEcj1EJqHrMjPVpTMyavDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:31.074782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.2724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:383a09080cf03eef20f473c0088a2e240a0d4a73ee2ef8028e2f4f7b1c10f762","sha256:c9bd7c8572eba049effb47881c47ab8e8f18bf53aa7e866f3f2b85ba039c1193"],"state_sha256":"db1bfb6cdde528edbb29914a1aced6320dc010a760d9426afe85e679be4ac91f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfPnqqt2pVFpR0RNofMPKe1UfdGhE8NjVcT4RkiCPXTkJz63RBAFgYPMzAE0r+qaFcRQeyRZsZK49blH32jWBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T16:40:32.316170Z","bundle_sha256":"40269b3e4e323062b6896202e32e4c850e555849fb8e0dfe258d5fa0d9d3a1f8"}}