{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XHXJ6WC2TY4BE5FJA54NPZNBOK","short_pith_number":"pith:XHXJ6WC2","schema_version":"1.0","canonical_sha256":"b9ee9f585a9e381274a90778d7e5a1729cfc4d5881cc5554a08a7b107fff814e","source":{"kind":"arxiv","id":"1702.01058","version":1},"attestation_state":"computed","paper":{"title":"On repetition thresholds of caterpillars and trees of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Borut Lu\\v{z}ar, Pascal Ochem","submitted_at":"2017-02-03T15:42:52Z","abstract_excerpt":"The repetition threshold is the smallest real number $\\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\\alpha$. This notion can be generalized to graph classes. In this paper, we completely determine the repetition thresholds for caterpillars and caterpillars of maximum degree $3$. Additionally, we present bounds for the repetition thresholds of trees with bounded maximum degrees."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.01058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-03T15:42:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"31bc0a2839deacd30da6d08df207ef9eb9dc808d321f91d2216f1cede148e9c6","abstract_canon_sha256":"8aacb106cf19eb5005a679b12c89dc8abbbf14c30ca25e8519e63da129da8250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:11.482471Z","signature_b64":"P1tSJG92gzqBbySUf7LHUtnwFAUBHnlTGMpRVfFXDmcJm4Byjm1tZ2XfYHqsgwLrEa7rgZpXyJ3aTkcHT3mcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ee9f585a9e381274a90778d7e5a1729cfc4d5881cc5554a08a7b107fff814e","last_reissued_at":"2026-05-18T00:12:11.481854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:11.481854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On repetition thresholds of caterpillars and trees of bounded degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Borut Lu\\v{z}ar, Pascal Ochem","submitted_at":"2017-02-03T15:42:52Z","abstract_excerpt":"The repetition threshold is the smallest real number $\\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\\alpha$. This notion can be generalized to graph classes. In this paper, we completely determine the repetition thresholds for caterpillars and caterpillars of maximum degree $3$. Additionally, we present bounds for the repetition thresholds of trees with bounded maximum degrees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01058","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.01058","created_at":"2026-05-18T00:12:11.481945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01058v1","created_at":"2026-05-18T00:12:11.481945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01058","created_at":"2026-05-18T00:12:11.481945+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHXJ6WC2TY4B","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHXJ6WC2TY4BE5FJ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHXJ6WC2","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK","json":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK.json","graph_json":"https://pith.science/api/pith-number/XHXJ6WC2TY4BE5FJA54NPZNBOK/graph.json","events_json":"https://pith.science/api/pith-number/XHXJ6WC2TY4BE5FJA54NPZNBOK/events.json","paper":"https://pith.science/paper/XHXJ6WC2"},"agent_actions":{"view_html":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK","download_json":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK.json","view_paper":"https://pith.science/paper/XHXJ6WC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01058&json=true","fetch_graph":"https://pith.science/api/pith-number/XHXJ6WC2TY4BE5FJA54NPZNBOK/graph.json","fetch_events":"https://pith.science/api/pith-number/XHXJ6WC2TY4BE5FJA54NPZNBOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/action/storage_attestation","attest_author":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/action/author_attestation","sign_citation":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/action/citation_signature","submit_replication":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/action/replication_record"}},"created_at":"2026-05-18T00:12:11.481945+00:00","updated_at":"2026-05-18T00:12:11.481945+00:00"}