{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:BYYH5R6ISPU6QMXF423VHEZVCY","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":"81b2041b9e083559ecc766bb174148ccb7141372d1208e7698cb4a5da4695d0b","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.GR","submitted_at":"2005-04-06T04:23:35Z","title_canon_sha256":"fb59e225d91b96140f10ed752a035cab2e71bb7e5c86142d1ad3f1426e965808"},"schema_version":"1.0","source":{"id":"math/0504091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0504091","created_at":"2026-05-18T04:42:22Z"},{"alias_kind":"arxiv_version","alias_value":"math/0504091v1","created_at":"2026-05-18T04:42:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0504091","created_at":"2026-05-18T04:42:22Z"},{"alias_kind":"pith_short_12","alias_value":"BYYH5R6ISPU6","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"BYYH5R6ISPU6QMXF","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"BYYH5R6I","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:26bf59bc6db56ba6730952d69dd4a9262656101d91353e01ec3d9d06d52bd003","target":"graph","created_at":"2026-05-18T04:42:22Z","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":"We give a non-deterministic algorithm that expresses elements of SL_N(Z), for N > 2, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We show that the non-deterministic time-complexity of the subtractive version of Euclid's algorithm for finding the greatest common divisor of N > 2 integers a_1,..., a_N is at most a constant times N log n where n := max {|a_1|,..., |a_N|}. This leads to an elementary proof that for N > 2 the word metric in SL_N(Z) is biLipschitz equivalent to the logarithm of the matrix norm -- an instance of a th","authors_text":"T. R. Riley","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.GR","submitted_at":"2005-04-06T04:23:35Z","title":"Navigating in the Cayley graphs of SL_N(Z) and SL_N(F_p)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0504091","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:1e8f8d76ceabbacf7a3403411badfc0c2eabdb7779ee2f504d8d4628ae964865","target":"record","created_at":"2026-05-18T04:42:22Z","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":"81b2041b9e083559ecc766bb174148ccb7141372d1208e7698cb4a5da4695d0b","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.GR","submitted_at":"2005-04-06T04:23:35Z","title_canon_sha256":"fb59e225d91b96140f10ed752a035cab2e71bb7e5c86142d1ad3f1426e965808"},"schema_version":"1.0","source":{"id":"math/0504091","kind":"arxiv","version":1}},"canonical_sha256":"0e307ec7c893e9e832e5e6b7539335160c9c9152b76944b779424b68c270e36d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e307ec7c893e9e832e5e6b7539335160c9c9152b76944b779424b68c270e36d","first_computed_at":"2026-05-18T04:42:22.449280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:22.449280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sx0sNgKQdjrlzbE0uUyCAYVaXplvKK4TNVnEjE09L5/jziOaE1SBic7CEQrKO9cLIdeU0IBpH1DiYOqnYxTfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:22.449947Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0504091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e8f8d76ceabbacf7a3403411badfc0c2eabdb7779ee2f504d8d4628ae964865","sha256:26bf59bc6db56ba6730952d69dd4a9262656101d91353e01ec3d9d06d52bd003"],"state_sha256":"fbde0e58110b06e6f5f89053a74545c1de3f303c614b6cb50f29f2a62da1699a"}