{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M4HIQ2ECXJYXLH5YNGBHGZERZE","short_pith_number":"pith:M4HIQ2EC","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"},"canonical_sha256":"670e886882ba71759fb86982736491c920c45863662a13d2940d353215ede542","source":{"kind":"arxiv","id":"1711.02147","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02147","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02147v3","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02147","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"M4HIQ2ECXJYX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M4HIQ2ECXJYXLH5Y","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M4HIQ2EC","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M4HIQ2ECXJYXLH5YNGBHGZERZE","target":"record","payload":{"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"},"canonical_sha256":"670e886882ba71759fb86982736491c920c45863662a13d2940d353215ede542","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"},"source_kind":"arxiv","source_id":"1711.02147","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzQk0lzUQHZhrecdfBSt6QvPr3U3h/ygP6MZ4mpwA48pDvQEDBFa7Pbyv9bUIl87vxR+gauSy8F1X8gqc7hdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:11:54.807854Z"},"content_sha256":"e7b02fe1b444508e08e225acb28f3f0fceb72be71808007b40294f13da3d367e","schema_version":"1.0","event_id":"sha256:e7b02fe1b444508e08e225acb28f3f0fceb72be71808007b40294f13da3d367e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M4HIQ2ECXJYXLH5YNGBHGZERZE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUYLxuy+9AUV4KJaV5CUx/9rZt2PP/1ZKgiFS8ixDJ0oLkXj/LNXhKHwNb6aVtif76YxhSYSuGEEPnwtA5NZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T15:11:54.808184Z"},"content_sha256":"27d769c56904290ec282bcdded3a996ceb63a924bc08962b8ad03c4de05902ff","schema_version":"1.0","event_id":"sha256:27d769c56904290ec282bcdded3a996ceb63a924bc08962b8ad03c4de05902ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/bundle.json","state_url":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T15:11:54Z","links":{"resolver":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE","bundle":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/bundle.json","state":"https://pith.science/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4HIQ2ECXJYXLH5YNGBHGZERZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M4HIQ2ECXJYXLH5YNGBHGZERZE","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":"4691c4a50a88889524fb35af2aec8b76ce19f0fd6756497e530dc6ef4636d394","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-11-06T20:06:31Z","title_canon_sha256":"93f2e59cc1b6b36287a6a4dcbf79ec091c9127c8b2e5421ab67ffa373ebcfbf0"},"schema_version":"1.0","source":{"id":"1711.02147","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02147","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02147v3","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02147","created_at":"2026-05-17T23:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"M4HIQ2ECXJYX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M4HIQ2ECXJYXLH5Y","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M4HIQ2EC","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:27d769c56904290ec282bcdded3a996ceb63a924bc08962b8ad03c4de05902ff","target":"graph","created_at":"2026-05-17T23:46:46Z","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 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.","authors_text":"Alexander Hulpke, Alla Detinko, Dane Flannery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-11-06T20:06:31Z","title":"Algorithms for experimenting with Zariski dense subgroups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02147","kind":"arxiv","version":3},"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:e7b02fe1b444508e08e225acb28f3f0fceb72be71808007b40294f13da3d367e","target":"record","created_at":"2026-05-17T23:46:46Z","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":"4691c4a50a88889524fb35af2aec8b76ce19f0fd6756497e530dc6ef4636d394","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-11-06T20:06:31Z","title_canon_sha256":"93f2e59cc1b6b36287a6a4dcbf79ec091c9127c8b2e5421ab67ffa373ebcfbf0"},"schema_version":"1.0","source":{"id":"1711.02147","kind":"arxiv","version":3}},"canonical_sha256":"670e886882ba71759fb86982736491c920c45863662a13d2940d353215ede542","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"670e886882ba71759fb86982736491c920c45863662a13d2940d353215ede542","first_computed_at":"2026-05-17T23:46:46.528587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:46.528587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cC5Vl5VMjjcyP/wYXTYEfeV3wnr4pEQagL0p07SRgGjJ1UL5OhmU5LNnuwWTIwSDGKKbOzBpMaRUpTHr5FV8CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:46.529108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02147","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7b02fe1b444508e08e225acb28f3f0fceb72be71808007b40294f13da3d367e","sha256:27d769c56904290ec282bcdded3a996ceb63a924bc08962b8ad03c4de05902ff"],"state_sha256":"e15c516a3f22d90a604f6a07a330713bcba44afab6ff3af64e09b17207c78ba7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D73IkWy5AftKm7FK+nUoctAXfkB+URJgzXEslWHPNXcdOFjNXkuM4clk2PBV829Lp4IwP/EQ+HB4bEHA+8l7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T15:11:54.810009Z","bundle_sha256":"261c8f3d1ca7bba894b0609c42d0a5833f0ea6d91a2c699963cf1b11067baaf4"}}