{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XHXJ6WC2TY4BE5FJA54NPZNBOK","short_pith_number":"pith:XHXJ6WC2","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"},"canonical_sha256":"b9ee9f585a9e381274a90778d7e5a1729cfc4d5881cc5554a08a7b107fff814e","source":{"kind":"arxiv","id":"1702.01058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01058","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01058v1","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01058","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"XHXJ6WC2TY4B","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XHXJ6WC2TY4BE5FJ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XHXJ6WC2","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XHXJ6WC2TY4BE5FJA54NPZNBOK","target":"record","payload":{"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"},"canonical_sha256":"b9ee9f585a9e381274a90778d7e5a1729cfc4d5881cc5554a08a7b107fff814e","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"},"source_kind":"arxiv","source_id":"1702.01058","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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xcj4q1pNoLSnduJ43xYYP8I7ZRE2Xu6Pn5GyftF6EnrVXrPdO+66qGBNndSPsMWeiuU0AWz0c4kiRTPphCSODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:57:59.719927Z"},"content_sha256":"f619b5d45ea5e9947c223a322ac69b6f41824c445a47652dd618559b50310b2d","schema_version":"1.0","event_id":"sha256:f619b5d45ea5e9947c223a322ac69b6f41824c445a47652dd618559b50310b2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XHXJ6WC2TY4BE5FJA54NPZNBOK","target":"graph","payload":{"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"},"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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLYiCh3ML3hutWnQgJk0PJS6UYjLeSdq6Olp5Aa9ZHtcX7+MUtjwwZ+6GmgFSRWk/4S2eKPCkL/AwC+QfD4sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:57:59.720286Z"},"content_sha256":"e6bb74dc3b0acf5d5469c7705e7233f73b10dd111ec6fb6fb1b01cc34ae93384","schema_version":"1.0","event_id":"sha256:e6bb74dc3b0acf5d5469c7705e7233f73b10dd111ec6fb6fb1b01cc34ae93384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/bundle.json","state_url":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/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-05-27T12:57:59Z","links":{"resolver":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK","bundle":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/bundle.json","state":"https://pith.science/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHXJ6WC2TY4BE5FJA54NPZNBOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XHXJ6WC2TY4BE5FJA54NPZNBOK","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":"8aacb106cf19eb5005a679b12c89dc8abbbf14c30ca25e8519e63da129da8250","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-03T15:42:52Z","title_canon_sha256":"31bc0a2839deacd30da6d08df207ef9eb9dc808d321f91d2216f1cede148e9c6"},"schema_version":"1.0","source":{"id":"1702.01058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01058","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01058v1","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01058","created_at":"2026-05-18T00:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"XHXJ6WC2TY4B","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XHXJ6WC2TY4BE5FJ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XHXJ6WC2","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:e6bb74dc3b0acf5d5469c7705e7233f73b10dd111ec6fb6fb1b01cc34ae93384","target":"graph","created_at":"2026-05-18T00:12:11Z","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 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.","authors_text":"Alexandre Pinlou, Borut Lu\\v{z}ar, Pascal Ochem","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-03T15:42:52Z","title":"On repetition thresholds of caterpillars and trees of bounded degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01058","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:f619b5d45ea5e9947c223a322ac69b6f41824c445a47652dd618559b50310b2d","target":"record","created_at":"2026-05-18T00:12:11Z","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":"8aacb106cf19eb5005a679b12c89dc8abbbf14c30ca25e8519e63da129da8250","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-03T15:42:52Z","title_canon_sha256":"31bc0a2839deacd30da6d08df207ef9eb9dc808d321f91d2216f1cede148e9c6"},"schema_version":"1.0","source":{"id":"1702.01058","kind":"arxiv","version":1}},"canonical_sha256":"b9ee9f585a9e381274a90778d7e5a1729cfc4d5881cc5554a08a7b107fff814e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9ee9f585a9e381274a90778d7e5a1729cfc4d5881cc5554a08a7b107fff814e","first_computed_at":"2026-05-18T00:12:11.481854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:11.481854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P1tSJG92gzqBbySUf7LHUtnwFAUBHnlTGMpRVfFXDmcJm4Byjm1tZ2XfYHqsgwLrEa7rgZpXyJ3aTkcHT3mcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:11.482471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f619b5d45ea5e9947c223a322ac69b6f41824c445a47652dd618559b50310b2d","sha256:e6bb74dc3b0acf5d5469c7705e7233f73b10dd111ec6fb6fb1b01cc34ae93384"],"state_sha256":"8da13ed9f2e43300631f65ce5ff888d09553083ed0f56f472ad0d82bebdf4660"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zt1KRiJUZWGgcvltIOwCb4BqXSI/6f375q5rrEQef9ciu/Y9HDGxw9nNQYFrR9YzLa+9g6MecsnOBC6XfuH4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:57:59.723523Z","bundle_sha256":"722691782d38cc7d5d0f9a143918ddc07b3fc31b728df5276348589ce6a4c9ce"}}