{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PFVKN3TCIQ2RQ3W3G5WM6NNYEI","short_pith_number":"pith:PFVKN3TC","schema_version":"1.0","canonical_sha256":"796aa6ee624435186edb376ccf35b8223b8e6cb9338feaf3198099d287f29431","source":{"kind":"arxiv","id":"1908.11114","version":3},"attestation_state":"computed","paper":{"title":"Discrete and free two-generated subgroups of ${\\rm SL_2}$ over non-archimedean local fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Matthew J. Conder","submitted_at":"2019-08-29T09:17:45Z","abstract_excerpt":"We present a practical algorithm which, given a non-archimedean local field $K$ and any two elements $A,B\\in {\\rm SL_2}(K)$, determines after finitely many steps whether or not the subgroup $\\langle A, B \\rangle\\le {\\rm SL_2}(K)$ is discrete and free of rank two. This makes use of the Ping Pong Lemma applied to the action of ${\\rm SL_2}(K)$ by isometries on its Bruhat-Tits tree. The algorithm itself can also be used for two-generated subgroups of the isometry group of any locally finite simplicial tree, and has applications to the constructive membership problem. In an appendix joint with Fr\\'"},"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":"1908.11114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-08-29T09:17:45Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"d0b96ea6a8d907baca0c8357e0dae050875a7f48ce3fd986e092c6fc0d40a72f","abstract_canon_sha256":"d2cc6039e2a55aeb614dc00b8b9f075406e904557fdc77f44bf642c4909ae553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:52.838293Z","signature_b64":"zg3HDW/xYk9KroffqbxVkxaZQL6xe16Ki8FH6CtfqVLZ2zYm92t0DAg0NgS/Kdnx1DJUVByiaB+fkTrVsITHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"796aa6ee624435186edb376ccf35b8223b8e6cb9338feaf3198099d287f29431","last_reissued_at":"2026-07-05T00:42:52.837840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:52.837840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete and free two-generated subgroups of ${\\rm SL_2}$ over non-archimedean local fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.GR","authors_text":"Matthew J. Conder","submitted_at":"2019-08-29T09:17:45Z","abstract_excerpt":"We present a practical algorithm which, given a non-archimedean local field $K$ and any two elements $A,B\\in {\\rm SL_2}(K)$, determines after finitely many steps whether or not the subgroup $\\langle A, B \\rangle\\le {\\rm SL_2}(K)$ is discrete and free of rank two. This makes use of the Ping Pong Lemma applied to the action of ${\\rm SL_2}(K)$ by isometries on its Bruhat-Tits tree. The algorithm itself can also be used for two-generated subgroups of the isometry group of any locally finite simplicial tree, and has applications to the constructive membership problem. In an appendix joint with Fr\\'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11114","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.11114/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.11114","created_at":"2026-07-05T00:42:52.837893+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11114v3","created_at":"2026-07-05T00:42:52.837893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11114","created_at":"2026-07-05T00:42:52.837893+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFVKN3TCIQ2R","created_at":"2026-07-05T00:42:52.837893+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFVKN3TCIQ2RQ3W3","created_at":"2026-07-05T00:42:52.837893+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFVKN3TC","created_at":"2026-07-05T00:42:52.837893+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/PFVKN3TCIQ2RQ3W3G5WM6NNYEI","json":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI.json","graph_json":"https://pith.science/api/pith-number/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/graph.json","events_json":"https://pith.science/api/pith-number/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/events.json","paper":"https://pith.science/paper/PFVKN3TC"},"agent_actions":{"view_html":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI","download_json":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI.json","view_paper":"https://pith.science/paper/PFVKN3TC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11114&json=true","fetch_graph":"https://pith.science/api/pith-number/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/graph.json","fetch_events":"https://pith.science/api/pith-number/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/action/storage_attestation","attest_author":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/action/author_attestation","sign_citation":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/action/citation_signature","submit_replication":"https://pith.science/pith/PFVKN3TCIQ2RQ3W3G5WM6NNYEI/action/replication_record"}},"created_at":"2026-07-05T00:42:52.837893+00:00","updated_at":"2026-07-05T00:42:52.837893+00:00"}