{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MWKZAR5I3WFINYXH2YMOADEHGY","short_pith_number":"pith:MWKZAR5I","schema_version":"1.0","canonical_sha256":"65959047a8dd8a86e2e7d618e00c873635beeb0427e97a074aa79a63957379ec","source":{"kind":"arxiv","id":"1710.04591","version":1},"attestation_state":"computed","paper":{"title":"Constructing Directed Cayley Graphs of Small Diameter: A Potent Solovay-Kitaev Procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Henry Bradford","submitted_at":"2017-10-12T16:18:57Z","abstract_excerpt":"Let $\\Gamma$ be a group and $(\\Gamma_n)_{n=1} ^{\\infty}$ be a descending sequence of finite-index normal subgroups. We establish explicit upper bounds on the diameters of the directed Cayley graphs of the $\\Gamma/\\Gamma_n$ , under some natural hypotheses on the behaviour of power and commutator words in $\\Gamma$. The bounds we obtain do not depend on a choice of generating set. Moreover under reasonable conditions our method provides a fast algorithm for constructing directed Cayley graphs of diameter satisfying our bounds. The proof is closely analogous to the the Solovay-Kitaev procedure, wh"},"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":"1710.04591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-12T16:18:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e7d077d6aef819f2b4c13bc08e9506423f5166e85484ef2e5c3ab683cf62a15e","abstract_canon_sha256":"c0803fe0a0946e2b7d6bbd0d623c291f557d68c4f0a58db70d62253da7058ffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.584157Z","signature_b64":"6gIctXyVibVQKdDG2DeRP4KrjK+2Kxs+iSu3QdK4nVktWRoj+FDzNSWeGLhM2+PDMPhAz/iiTTAc/as7OmcEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65959047a8dd8a86e2e7d618e00c873635beeb0427e97a074aa79a63957379ec","last_reissued_at":"2026-05-18T00:33:00.583658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.583658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing Directed Cayley Graphs of Small Diameter: A Potent Solovay-Kitaev Procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Henry Bradford","submitted_at":"2017-10-12T16:18:57Z","abstract_excerpt":"Let $\\Gamma$ be a group and $(\\Gamma_n)_{n=1} ^{\\infty}$ be a descending sequence of finite-index normal subgroups. We establish explicit upper bounds on the diameters of the directed Cayley graphs of the $\\Gamma/\\Gamma_n$ , under some natural hypotheses on the behaviour of power and commutator words in $\\Gamma$. The bounds we obtain do not depend on a choice of generating set. Moreover under reasonable conditions our method provides a fast algorithm for constructing directed Cayley graphs of diameter satisfying our bounds. The proof is closely analogous to the the Solovay-Kitaev procedure, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04591","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":"1710.04591","created_at":"2026-05-18T00:33:00.583736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04591v1","created_at":"2026-05-18T00:33:00.583736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04591","created_at":"2026-05-18T00:33:00.583736+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWKZAR5I3WFI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWKZAR5I3WFINYXH","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWKZAR5I","created_at":"2026-05-18T12:31:31.346846+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/MWKZAR5I3WFINYXH2YMOADEHGY","json":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY.json","graph_json":"https://pith.science/api/pith-number/MWKZAR5I3WFINYXH2YMOADEHGY/graph.json","events_json":"https://pith.science/api/pith-number/MWKZAR5I3WFINYXH2YMOADEHGY/events.json","paper":"https://pith.science/paper/MWKZAR5I"},"agent_actions":{"view_html":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY","download_json":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY.json","view_paper":"https://pith.science/paper/MWKZAR5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04591&json=true","fetch_graph":"https://pith.science/api/pith-number/MWKZAR5I3WFINYXH2YMOADEHGY/graph.json","fetch_events":"https://pith.science/api/pith-number/MWKZAR5I3WFINYXH2YMOADEHGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY/action/storage_attestation","attest_author":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY/action/author_attestation","sign_citation":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY/action/citation_signature","submit_replication":"https://pith.science/pith/MWKZAR5I3WFINYXH2YMOADEHGY/action/replication_record"}},"created_at":"2026-05-18T00:33:00.583736+00:00","updated_at":"2026-05-18T00:33:00.583736+00:00"}