{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SA47EC7OWNORB6A63PUZ35E7IE","short_pith_number":"pith:SA47EC7O","schema_version":"1.0","canonical_sha256":"9039f20beeb35d10f81edbe99df49f4103c1dda503a6cfcda157b4ace6b4c39a","source":{"kind":"arxiv","id":"1508.02388","version":1},"attestation_state":"computed","paper":{"title":"Non-commutative lattice problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Alexei Myasnikov, Andrey Nikolaev","submitted_at":"2015-08-10T20:02:10Z","abstract_excerpt":"We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup element closest to a given group element, or finding a shortest non-trivial element of a subgroup in the case of nilpotent groups, and a large class of surface groups and Coxeter groups. We also provide polynomial time algorithm to compute geodesics in given generators of a subgroup of a free group."},"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":"1508.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-08-10T20:02:10Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"3bab548b806eb6dbb19aa1ec573050ec01c6258c99180feb054cd4eb74078f9a","abstract_canon_sha256":"6720fedf6f93051008b90dc46ac2fcc1b25dd7d9b89d306bf8b32d23f898fb4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:29.329342Z","signature_b64":"AgL37RuIiuuwQXD9OieNbibrb+OseAK4XQkV70V6IRv93U8vo2zlW6w9OuJDkK1i7ZzRaKO6WlRaopNNTQrwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9039f20beeb35d10f81edbe99df49f4103c1dda503a6cfcda157b4ace6b4c39a","last_reissued_at":"2026-05-18T01:35:29.328697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:29.328697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-commutative lattice problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Alexei Myasnikov, Andrey Nikolaev","submitted_at":"2015-08-10T20:02:10Z","abstract_excerpt":"We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup element closest to a given group element, or finding a shortest non-trivial element of a subgroup in the case of nilpotent groups, and a large class of surface groups and Coxeter groups. We also provide polynomial time algorithm to compute geodesics in given generators of a subgroup of a free group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02388","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":"1508.02388","created_at":"2026-05-18T01:35:29.328785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02388v1","created_at":"2026-05-18T01:35:29.328785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02388","created_at":"2026-05-18T01:35:29.328785+00:00"},{"alias_kind":"pith_short_12","alias_value":"SA47EC7OWNOR","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SA47EC7OWNORB6A6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SA47EC7O","created_at":"2026-05-18T12:29:39.896362+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/SA47EC7OWNORB6A63PUZ35E7IE","json":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE.json","graph_json":"https://pith.science/api/pith-number/SA47EC7OWNORB6A63PUZ35E7IE/graph.json","events_json":"https://pith.science/api/pith-number/SA47EC7OWNORB6A63PUZ35E7IE/events.json","paper":"https://pith.science/paper/SA47EC7O"},"agent_actions":{"view_html":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE","download_json":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE.json","view_paper":"https://pith.science/paper/SA47EC7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02388&json=true","fetch_graph":"https://pith.science/api/pith-number/SA47EC7OWNORB6A63PUZ35E7IE/graph.json","fetch_events":"https://pith.science/api/pith-number/SA47EC7OWNORB6A63PUZ35E7IE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE/action/storage_attestation","attest_author":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE/action/author_attestation","sign_citation":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE/action/citation_signature","submit_replication":"https://pith.science/pith/SA47EC7OWNORB6A63PUZ35E7IE/action/replication_record"}},"created_at":"2026-05-18T01:35:29.328785+00:00","updated_at":"2026-05-18T01:35:29.328785+00:00"}