{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Z3FZRRRIDXMDFBQRDQG5T27P3D","short_pith_number":"pith:Z3FZRRRI","schema_version":"1.0","canonical_sha256":"cecb98c6281dd83286111c0dd9ebefd8f97afdbd375d50e151c5983cf636e0fe","source":{"kind":"arxiv","id":"1511.07627","version":1},"attestation_state":"computed","paper":{"title":"Deciding if a variety forms an algebraic group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Bettina Eick, John Abbott","submitted_at":"2015-11-24T09:56:42Z","abstract_excerpt":"Let $n$ be a positive integer and let $f_1, \\ldots, f_r$ be polynomials in $n^2$ indeterminates over an algebraically closed field $K$. We describe an algorithm to decide if the invertible matrices contained in the variety of $f_1, \\ldots, f_r$ form a subgroup of $GL(n,K)$; that is, we show how to decide if the polynomials $f_1, \\ldots, f_r$ define a linear algebraic 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":"1511.07627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-11-24T09:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"2d25d4a9f92b3db0ddf36d0b33eca9261c95be8e876f0eac7ee9a88c73efd22b","abstract_canon_sha256":"247045f46041da22f14e5c9e08d8756a49bb94ed7851009919b4b5b92a4b2727"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:04.149593Z","signature_b64":"DdSdL7tYOUuhbCwwogF9datGv7VF2cSknlVZ3ms5jhdiGmLcPkBCqTWvZQnxxWuZSPs5UCWfu2eyVVodUTTNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cecb98c6281dd83286111c0dd9ebefd8f97afdbd375d50e151c5983cf636e0fe","last_reissued_at":"2026-05-18T01:26:04.148838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:04.148838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding if a variety forms an algebraic group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Bettina Eick, John Abbott","submitted_at":"2015-11-24T09:56:42Z","abstract_excerpt":"Let $n$ be a positive integer and let $f_1, \\ldots, f_r$ be polynomials in $n^2$ indeterminates over an algebraically closed field $K$. We describe an algorithm to decide if the invertible matrices contained in the variety of $f_1, \\ldots, f_r$ form a subgroup of $GL(n,K)$; that is, we show how to decide if the polynomials $f_1, \\ldots, f_r$ define a linear algebraic group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07627","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":"1511.07627","created_at":"2026-05-18T01:26:04.148989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07627v1","created_at":"2026-05-18T01:26:04.148989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07627","created_at":"2026-05-18T01:26:04.148989+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3FZRRRIDXMD","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3FZRRRIDXMDFBQR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3FZRRRI","created_at":"2026-05-18T12:29:52.810259+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/Z3FZRRRIDXMDFBQRDQG5T27P3D","json":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D.json","graph_json":"https://pith.science/api/pith-number/Z3FZRRRIDXMDFBQRDQG5T27P3D/graph.json","events_json":"https://pith.science/api/pith-number/Z3FZRRRIDXMDFBQRDQG5T27P3D/events.json","paper":"https://pith.science/paper/Z3FZRRRI"},"agent_actions":{"view_html":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D","download_json":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D.json","view_paper":"https://pith.science/paper/Z3FZRRRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07627&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3FZRRRIDXMDFBQRDQG5T27P3D/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3FZRRRIDXMDFBQRDQG5T27P3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D/action/storage_attestation","attest_author":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D/action/author_attestation","sign_citation":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D/action/citation_signature","submit_replication":"https://pith.science/pith/Z3FZRRRIDXMDFBQRDQG5T27P3D/action/replication_record"}},"created_at":"2026-05-18T01:26:04.148989+00:00","updated_at":"2026-05-18T01:26:04.148989+00:00"}