{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6B4SSEGNFIF3RSWDXES3FQSSTL","short_pith_number":"pith:6B4SSEGN","schema_version":"1.0","canonical_sha256":"f0792910cd2a0bb8cac3b925b2c2529ae03ee04453db9d369c5ac479945ace51","source":{"kind":"arxiv","id":"1301.6568","version":2},"attestation_state":"computed","paper":{"title":"The total run length of a word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen, Jamie Simpson","submitted_at":"2013-01-28T15:02:32Z","abstract_excerpt":"A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length $n$. A number of associated problems have also been investigated. In this paper we consider a new variation on the theme. We say that the total run length (TRL) of a word is the sum of the lengths of the runs in the word and that $\\tau(n)$ is the maximum TRL over all words of length $n$. We show "},"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":"1301.6568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-28T15:02:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"db17a5f969aaa9957268d280df60d068f894ddefeafca978a8563296bbccfe42","abstract_canon_sha256":"80033b841fefdfc3b527d6fad51e0d73cc69866703ea1c20f90d681ee607dfd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:32.066674Z","signature_b64":"VtTK6zssRy081FoeM+BBYlBsLo/ra001N4qiH/lc3GpGHCI2QM1s7Anpn0FtKG6acsaMr2iw7T7u0M2lg1vVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0792910cd2a0bb8cac3b925b2c2529ae03ee04453db9d369c5ac479945ace51","last_reissued_at":"2026-05-18T03:26:32.066241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:32.066241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The total run length of a word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen, Jamie Simpson","submitted_at":"2013-01-28T15:02:32Z","abstract_excerpt":"A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length $n$. A number of associated problems have also been investigated. In this paper we consider a new variation on the theme. We say that the total run length (TRL) of a word is the sum of the lengths of the runs in the word and that $\\tau(n)$ is the maximum TRL over all words of length $n$. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6568","kind":"arxiv","version":2},"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":"1301.6568","created_at":"2026-05-18T03:26:32.066311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6568v2","created_at":"2026-05-18T03:26:32.066311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6568","created_at":"2026-05-18T03:26:32.066311+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B4SSEGNFIF3","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B4SSEGNFIF3RSWD","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B4SSEGN","created_at":"2026-05-18T12:27:36.564083+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/6B4SSEGNFIF3RSWDXES3FQSSTL","json":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL.json","graph_json":"https://pith.science/api/pith-number/6B4SSEGNFIF3RSWDXES3FQSSTL/graph.json","events_json":"https://pith.science/api/pith-number/6B4SSEGNFIF3RSWDXES3FQSSTL/events.json","paper":"https://pith.science/paper/6B4SSEGN"},"agent_actions":{"view_html":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL","download_json":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL.json","view_paper":"https://pith.science/paper/6B4SSEGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6568&json=true","fetch_graph":"https://pith.science/api/pith-number/6B4SSEGNFIF3RSWDXES3FQSSTL/graph.json","fetch_events":"https://pith.science/api/pith-number/6B4SSEGNFIF3RSWDXES3FQSSTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL/action/storage_attestation","attest_author":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL/action/author_attestation","sign_citation":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL/action/citation_signature","submit_replication":"https://pith.science/pith/6B4SSEGNFIF3RSWDXES3FQSSTL/action/replication_record"}},"created_at":"2026-05-18T03:26:32.066311+00:00","updated_at":"2026-05-18T03:26:32.066311+00:00"}