{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OSVD2JP6NNH2ENFVWF7JGYPJPL","short_pith_number":"pith:OSVD2JP6","schema_version":"1.0","canonical_sha256":"74aa3d25fe6b4fa234b5b17e9361e97ac0b634e696fcf13b2703e036f8e18aa5","source":{"kind":"arxiv","id":"1905.04546","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for linear groups of finite rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"A.S. Detinko, D.L. Flannery, E.A. O'Brien","submitted_at":"2019-05-11T16:23:00Z","abstract_excerpt":"Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\\\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely generated subgroup of $G$ has finite index. The algorithms are implemented in MAGMA for groups over algebraic number fields."},"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":"1905.04546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2019-05-11T16:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"0262de94168a54b8aaff51371479ab8a5db669787f3623ce80aadc64f404b912","abstract_canon_sha256":"d22b88fcf8307dde22b3573ef7d9b663dee9e4d415a3922ed66cffba906a1eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.434453Z","signature_b64":"u2l/V7gCnRb2VUjW0zVEbnUect0RYx3U+nPw5iVug2I6uhBg5MFtoZP1dyarQ2mZkY2Yxl/v5fTEeM0g5JeDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74aa3d25fe6b4fa234b5b17e9361e97ac0b634e696fcf13b2703e036f8e18aa5","last_reissued_at":"2026-05-17T23:46:24.433776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.433776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for linear groups of finite rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"A.S. Detinko, D.L. Flannery, E.A. O'Brien","submitted_at":"2019-05-11T16:23:00Z","abstract_excerpt":"Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\\\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely generated subgroup of $G$ has finite index. The algorithms are implemented in MAGMA for groups over algebraic number fields."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04546","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":"1905.04546","created_at":"2026-05-17T23:46:24.433887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04546v1","created_at":"2026-05-17T23:46:24.433887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04546","created_at":"2026-05-17T23:46:24.433887+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSVD2JP6NNH2","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSVD2JP6NNH2ENFV","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSVD2JP6","created_at":"2026-05-18T12:33:24.271573+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/OSVD2JP6NNH2ENFVWF7JGYPJPL","json":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL.json","graph_json":"https://pith.science/api/pith-number/OSVD2JP6NNH2ENFVWF7JGYPJPL/graph.json","events_json":"https://pith.science/api/pith-number/OSVD2JP6NNH2ENFVWF7JGYPJPL/events.json","paper":"https://pith.science/paper/OSVD2JP6"},"agent_actions":{"view_html":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL","download_json":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL.json","view_paper":"https://pith.science/paper/OSVD2JP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04546&json=true","fetch_graph":"https://pith.science/api/pith-number/OSVD2JP6NNH2ENFVWF7JGYPJPL/graph.json","fetch_events":"https://pith.science/api/pith-number/OSVD2JP6NNH2ENFVWF7JGYPJPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL/action/storage_attestation","attest_author":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL/action/author_attestation","sign_citation":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL/action/citation_signature","submit_replication":"https://pith.science/pith/OSVD2JP6NNH2ENFVWF7JGYPJPL/action/replication_record"}},"created_at":"2026-05-17T23:46:24.433887+00:00","updated_at":"2026-05-17T23:46:24.433887+00:00"}