{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OBLTAK5REVJBL3544J4KJAA3U5","short_pith_number":"pith:OBLTAK5R","schema_version":"1.0","canonical_sha256":"7057302bb1255215efbce278a4801ba77256a907aad3f84765ae2b87f0d2be10","source":{"kind":"arxiv","id":"1209.5993","version":5},"attestation_state":"computed","paper":{"title":"Geometric Complexity Theory V: Efficient algorithms for Noether Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Ketan D. Mulmuley","submitted_at":"2012-09-26T16:33:26Z","abstract_excerpt":"We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized polynomial-time Monte Carlo algorithm for this problem. For some interesting cases of explicit varieties, we give deterministic quasi-polynomial time algorithms. These may be contrasted with the standard EXPSPACE-algorithms for these problems in computational algebraic geometry.\n  In particular, we show that:\n  (1) The categorical quotient for any finite dime"},"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":"1209.5993","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-26T16:33:26Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"fde3b5e25f5ac690b63f191524f0834d29a567d96f85ae34f49e1160c59317f2","abstract_canon_sha256":"bcf7d964996ab0cfb1aa4a767b0e64e18d5643407d91a6a9918b2fd30a3a7578"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:38.470348Z","signature_b64":"NaCMzgKuBB70swcgb8DEpfnoqvrjWEDijBJe1VV/dUKtNZPaZDawLnra+Etucea8HfdYY7rEHZzvf+T+eGkBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7057302bb1255215efbce278a4801ba77256a907aad3f84765ae2b87f0d2be10","last_reissued_at":"2026-05-18T01:13:38.469778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:38.469778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Complexity Theory V: Efficient algorithms for Noether Normalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Ketan D. Mulmuley","submitted_at":"2012-09-26T16:33:26Z","abstract_excerpt":"We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized polynomial-time Monte Carlo algorithm for this problem. For some interesting cases of explicit varieties, we give deterministic quasi-polynomial time algorithms. These may be contrasted with the standard EXPSPACE-algorithms for these problems in computational algebraic geometry.\n  In particular, we show that:\n  (1) The categorical quotient for any finite dime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5993","kind":"arxiv","version":5},"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":"1209.5993","created_at":"2026-05-18T01:13:38.469876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5993v5","created_at":"2026-05-18T01:13:38.469876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5993","created_at":"2026-05-18T01:13:38.469876+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBLTAK5REVJB","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBLTAK5REVJBL354","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBLTAK5R","created_at":"2026-05-18T12:27:16.716162+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/OBLTAK5REVJBL3544J4KJAA3U5","json":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5.json","graph_json":"https://pith.science/api/pith-number/OBLTAK5REVJBL3544J4KJAA3U5/graph.json","events_json":"https://pith.science/api/pith-number/OBLTAK5REVJBL3544J4KJAA3U5/events.json","paper":"https://pith.science/paper/OBLTAK5R"},"agent_actions":{"view_html":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5","download_json":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5.json","view_paper":"https://pith.science/paper/OBLTAK5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5993&json=true","fetch_graph":"https://pith.science/api/pith-number/OBLTAK5REVJBL3544J4KJAA3U5/graph.json","fetch_events":"https://pith.science/api/pith-number/OBLTAK5REVJBL3544J4KJAA3U5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/action/storage_attestation","attest_author":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/action/author_attestation","sign_citation":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/action/citation_signature","submit_replication":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/action/replication_record"}},"created_at":"2026-05-18T01:13:38.469876+00:00","updated_at":"2026-05-18T01:13:38.469876+00:00"}