{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YENAB42FKBDKPFWGB25O6EQPUV","short_pith_number":"pith:YENAB42F","schema_version":"1.0","canonical_sha256":"c11a00f3455046a796c60ebaef120fa543bf3164bdaa9b8f660ca39dfe2b9b2b","source":{"kind":"arxiv","id":"1711.07884","version":1},"attestation_state":"computed","paper":{"title":"On random presentations with fixed relator length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"C. J. Ashcroft, Colva M. Roney-Dougal","submitted_at":"2017-11-21T16:30:08Z","abstract_excerpt":"The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the case where $n$ is fixed, and $k$ tends to infinity. We instead fix $k$, and let $n$ tend to infinity. We prove that for all $k \\geq 2$ at density $d > 1/2$ a random group in this model is trivial or cyclic of order two, whilst for $d < \\frac{1}{2}$ such a random group is infinite and hyperbolic. In addition we show that for $d<\\frac{1}{k}$ such a random gro"},"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":"1711.07884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-11-21T16:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"e6d32b182e8f63ee8f8c83234f2760f8e4e62e59f09258323ab06220967999ce","abstract_canon_sha256":"70ac7363b7c04e431e5fa8f8abc5a63e544c9f2483702df257c6f35ad15d2098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.249432Z","signature_b64":"SgUx4sJokE0vu5m/XkF0fGQaCCTEsrL3qSTLCbz8PtXJHRLxGWaaCQhsJo3UhnMdpo6/WmpYK1ve6spE2H3UDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c11a00f3455046a796c60ebaef120fa543bf3164bdaa9b8f660ca39dfe2b9b2b","last_reissued_at":"2026-05-18T00:29:56.248842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.248842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On random presentations with fixed relator length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"C. J. Ashcroft, Colva M. Roney-Dougal","submitted_at":"2017-11-21T16:30:08Z","abstract_excerpt":"The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the case where $n$ is fixed, and $k$ tends to infinity. We instead fix $k$, and let $n$ tend to infinity. We prove that for all $k \\geq 2$ at density $d > 1/2$ a random group in this model is trivial or cyclic of order two, whilst for $d < \\frac{1}{2}$ such a random group is infinite and hyperbolic. In addition we show that for $d<\\frac{1}{k}$ such a random gro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07884","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":"1711.07884","created_at":"2026-05-18T00:29:56.248925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07884v1","created_at":"2026-05-18T00:29:56.248925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07884","created_at":"2026-05-18T00:29:56.248925+00:00"},{"alias_kind":"pith_short_12","alias_value":"YENAB42FKBDK","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YENAB42FKBDKPFWG","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YENAB42F","created_at":"2026-05-18T12:31:56.362134+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/YENAB42FKBDKPFWGB25O6EQPUV","json":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV.json","graph_json":"https://pith.science/api/pith-number/YENAB42FKBDKPFWGB25O6EQPUV/graph.json","events_json":"https://pith.science/api/pith-number/YENAB42FKBDKPFWGB25O6EQPUV/events.json","paper":"https://pith.science/paper/YENAB42F"},"agent_actions":{"view_html":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV","download_json":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV.json","view_paper":"https://pith.science/paper/YENAB42F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07884&json=true","fetch_graph":"https://pith.science/api/pith-number/YENAB42FKBDKPFWGB25O6EQPUV/graph.json","fetch_events":"https://pith.science/api/pith-number/YENAB42FKBDKPFWGB25O6EQPUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV/action/storage_attestation","attest_author":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV/action/author_attestation","sign_citation":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV/action/citation_signature","submit_replication":"https://pith.science/pith/YENAB42FKBDKPFWGB25O6EQPUV/action/replication_record"}},"created_at":"2026-05-18T00:29:56.248925+00:00","updated_at":"2026-05-18T00:29:56.248925+00:00"}