{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M4HIQ2ECXJYXLH5YNGBHGZERZE","short_pith_number":"pith:M4HIQ2EC","schema_version":"1.0","canonical_sha256":"670e886882ba71759fb86982736491c920c45863662a13d2940d353215ede542","source":{"kind":"arxiv","id":"1711.02147","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for experimenting with Zariski dense subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Hulpke, Alla Detinko, Dane Flannery","submitted_at":"2017-11-06T20:06:31Z","abstract_excerpt":"We give a method to describe all congruence images of a finitely generated Zariski dense group $H \\leq \\mathrm{SL}(n, \\mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if $n=2$ then we compute all congruence images only modulo primes. We propose a separate method that works for all $n$ as long as $H$ contains a known transvection. The algorithms have been implemented in GAP, enabling computer experiments with important classes of linear groups that have recently emerged."},"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.02147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-11-06T20:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"93f2e59cc1b6b36287a6a4dcbf79ec091c9127c8b2e5421ab67ffa373ebcfbf0","abstract_canon_sha256":"4691c4a50a88889524fb35af2aec8b76ce19f0fd6756497e530dc6ef4636d394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:46.529108Z","signature_b64":"cC5Vl5VMjjcyP/wYXTYEfeV3wnr4pEQagL0p07SRgGjJ1UL5OhmU5LNnuwWTIwSDGKKbOzBpMaRUpTHr5FV8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670e886882ba71759fb86982736491c920c45863662a13d2940d353215ede542","last_reissued_at":"2026-05-17T23:46:46.528587Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:46.528587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for experimenting with Zariski dense subgroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Alexander Hulpke, Alla Detinko, Dane Flannery","submitted_at":"2017-11-06T20:06:31Z","abstract_excerpt":"We give a method to describe all congruence images of a finitely generated Zariski dense group $H \\leq \\mathrm{SL}(n, \\mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if $n=2$ then we compute all congruence images only modulo primes. We propose a separate method that works for all $n$ as long as $H$ contains a known transvection. The algorithms have been implemented in GAP, enabling computer experiments with important classes of linear groups that have recently emerged."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02147","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":"1711.02147","created_at":"2026-05-17T23:46:46.528662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02147v3","created_at":"2026-05-17T23:46:46.528662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02147","created_at":"2026-05-17T23:46:46.528662+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4HIQ2ECXJYX","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4HIQ2ECXJYXLH5Y","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4HIQ2EC","created_at":"2026-05-18T12:31:28.150371+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/M4HIQ2ECXJYXLH5YNGBHGZERZE","json":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE.json","graph_json":"https://pith.science/api/pith-number/M4HIQ2ECXJYXLH5YNGBHGZERZE/graph.json","events_json":"https://pith.science/api/pith-number/M4HIQ2ECXJYXLH5YNGBHGZERZE/events.json","paper":"https://pith.science/paper/M4HIQ2EC"},"agent_actions":{"view_html":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE","download_json":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE.json","view_paper":"https://pith.science/paper/M4HIQ2EC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02147&json=true","fetch_graph":"https://pith.science/api/pith-number/M4HIQ2ECXJYXLH5YNGBHGZERZE/graph.json","fetch_events":"https://pith.science/api/pith-number/M4HIQ2ECXJYXLH5YNGBHGZERZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/action/storage_attestation","attest_author":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/action/author_attestation","sign_citation":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/action/citation_signature","submit_replication":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/action/replication_record"}},"created_at":"2026-05-17T23:46:46.528662+00:00","updated_at":"2026-05-17T23:46:46.528662+00:00"}