{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XOV6QDSFWOYOK2PSF7SDKCYDWJ","short_pith_number":"pith:XOV6QDSF","schema_version":"1.0","canonical_sha256":"bbabe80e45b3b0e569f22fe4350b03b244fd53cafc57203c84c6072e6469fbf1","source":{"kind":"arxiv","id":"1304.7979","version":3},"attestation_state":"computed","paper":{"title":"Growth of Primitive Elements in Free Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Conan Wu, Doron Puder","submitted_at":"2013-04-30T13:02:07Z","abstract_excerpt":"In the free group $F_k$, an element is said to be primitive if it belongs to a free generating set. In this paper, we describe what a generic primitive element looks like. We prove that up to conjugation, a random primitive word of length $N$ contains one of the letters exactly once asymptotically almost surely (as $N \\to \\infty$).\n  This also solves a question from the list `Open problems in combinatorial group theory' [Baumslag-Myasnikov-Shpilrain 02']. Let $p_{k,N}$ be the number of primitive words of length $N$ in $F_k$. We show that for $k \\ge 3$, the exponential growth rate of $p_{k,N}$ "},"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":"1304.7979","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2013-04-30T13:02:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f35fe3fb63d5aaf8aa9c21c79fade91c4cefcb3b6e7fe757e56abecdef424207","abstract_canon_sha256":"07466414495596d9c5ffc81cb4f0220438be2d1c5e7a825db552224b1fab9542"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.257644Z","signature_b64":"LDSQhYb4m1dYcIyzE81am8opJnGNLsbI/gcjnmviE32EAB1j1QZyTyEBB4ULyosS5y/uDqtRZYUOmAud1LEQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbabe80e45b3b0e569f22fe4350b03b244fd53cafc57203c84c6072e6469fbf1","last_reissued_at":"2026-05-18T02:39:32.257081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.257081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Growth of Primitive Elements in Free Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Conan Wu, Doron Puder","submitted_at":"2013-04-30T13:02:07Z","abstract_excerpt":"In the free group $F_k$, an element is said to be primitive if it belongs to a free generating set. In this paper, we describe what a generic primitive element looks like. We prove that up to conjugation, a random primitive word of length $N$ contains one of the letters exactly once asymptotically almost surely (as $N \\to \\infty$).\n  This also solves a question from the list `Open problems in combinatorial group theory' [Baumslag-Myasnikov-Shpilrain 02']. Let $p_{k,N}$ be the number of primitive words of length $N$ in $F_k$. We show that for $k \\ge 3$, the exponential growth rate of $p_{k,N}$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7979","kind":"arxiv","version":3},"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":"1304.7979","created_at":"2026-05-18T02:39:32.257155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7979v3","created_at":"2026-05-18T02:39:32.257155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7979","created_at":"2026-05-18T02:39:32.257155+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOV6QDSFWOYO","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOV6QDSFWOYOK2PS","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOV6QDSF","created_at":"2026-05-18T12:28:06.772260+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/XOV6QDSFWOYOK2PSF7SDKCYDWJ","json":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ.json","graph_json":"https://pith.science/api/pith-number/XOV6QDSFWOYOK2PSF7SDKCYDWJ/graph.json","events_json":"https://pith.science/api/pith-number/XOV6QDSFWOYOK2PSF7SDKCYDWJ/events.json","paper":"https://pith.science/paper/XOV6QDSF"},"agent_actions":{"view_html":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ","download_json":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ.json","view_paper":"https://pith.science/paper/XOV6QDSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7979&json=true","fetch_graph":"https://pith.science/api/pith-number/XOV6QDSFWOYOK2PSF7SDKCYDWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XOV6QDSFWOYOK2PSF7SDKCYDWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ/action/storage_attestation","attest_author":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ/action/author_attestation","sign_citation":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ/action/citation_signature","submit_replication":"https://pith.science/pith/XOV6QDSFWOYOK2PSF7SDKCYDWJ/action/replication_record"}},"created_at":"2026-05-18T02:39:32.257155+00:00","updated_at":"2026-05-18T02:39:32.257155+00:00"}