{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OBLTAK5REVJBL3544J4KJAA3U5","short_pith_number":"pith:OBLTAK5R","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"},"canonical_sha256":"7057302bb1255215efbce278a4801ba77256a907aad3f84765ae2b87f0d2be10","source":{"kind":"arxiv","id":"1209.5993","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5993","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5993v5","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5993","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"OBLTAK5REVJB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OBLTAK5REVJBL354","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OBLTAK5R","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OBLTAK5REVJBL3544J4KJAA3U5","target":"record","payload":{"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"},"canonical_sha256":"7057302bb1255215efbce278a4801ba77256a907aad3f84765ae2b87f0d2be10","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"},"source_kind":"arxiv","source_id":"1209.5993","source_version":5,"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-18T01:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRXmt10zX+LSLAKBGvuoRnrYItOVOooqta3DZ07x1c6AYRo4CuTRXUOxml+rCBvsTrfLqjmCAG71kokioK1EDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:17:13.983931Z"},"content_sha256":"ada38e585c696a674b536ab7e1d28d70faa69685bb204ed1d944db23a71c478c","schema_version":"1.0","event_id":"sha256:ada38e585c696a674b536ab7e1d28d70faa69685bb204ed1d944db23a71c478c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OBLTAK5REVJBL3544J4KJAA3U5","target":"graph","payload":{"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"},"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-18T01:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/90LsAmrIWl07C8FhWQEBvn4jODNJ/zeQ5+sZqX5ar7sxYf0a+v0CbJSh4aSP7HgTRj8Q5HPvGs7EubjTxyVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:17:14.007530Z"},"content_sha256":"f74797a54a85c300250b7dac3c249acae9982b59898b549a88834ee98a16e5cb","schema_version":"1.0","event_id":"sha256:f74797a54a85c300250b7dac3c249acae9982b59898b549a88834ee98a16e5cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/bundle.json","state_url":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBLTAK5REVJBL3544J4KJAA3U5/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-08T01:17:14Z","links":{"resolver":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5","bundle":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/bundle.json","state":"https://pith.science/pith/OBLTAK5REVJBL3544J4KJAA3U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBLTAK5REVJBL3544J4KJAA3U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OBLTAK5REVJBL3544J4KJAA3U5","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":"bcf7d964996ab0cfb1aa4a767b0e64e18d5643407d91a6a9918b2fd30a3a7578","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-26T16:33:26Z","title_canon_sha256":"fde3b5e25f5ac690b63f191524f0834d29a567d96f85ae34f49e1160c59317f2"},"schema_version":"1.0","source":{"id":"1209.5993","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5993","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5993v5","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5993","created_at":"2026-05-18T01:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"OBLTAK5REVJB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OBLTAK5REVJBL354","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OBLTAK5R","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:f74797a54a85c300250b7dac3c249acae9982b59898b549a88834ee98a16e5cb","target":"graph","created_at":"2026-05-18T01:13:38Z","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 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","authors_text":"Ketan D. Mulmuley","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-26T16:33:26Z","title":"Geometric Complexity Theory V: Efficient algorithms for Noether Normalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5993","kind":"arxiv","version":5},"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:ada38e585c696a674b536ab7e1d28d70faa69685bb204ed1d944db23a71c478c","target":"record","created_at":"2026-05-18T01:13:38Z","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":"bcf7d964996ab0cfb1aa4a767b0e64e18d5643407d91a6a9918b2fd30a3a7578","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-26T16:33:26Z","title_canon_sha256":"fde3b5e25f5ac690b63f191524f0834d29a567d96f85ae34f49e1160c59317f2"},"schema_version":"1.0","source":{"id":"1209.5993","kind":"arxiv","version":5}},"canonical_sha256":"7057302bb1255215efbce278a4801ba77256a907aad3f84765ae2b87f0d2be10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7057302bb1255215efbce278a4801ba77256a907aad3f84765ae2b87f0d2be10","first_computed_at":"2026-05-18T01:13:38.469778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:38.469778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NaCMzgKuBB70swcgb8DEpfnoqvrjWEDijBJe1VV/dUKtNZPaZDawLnra+Etucea8HfdYY7rEHZzvf+T+eGkBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:38.470348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5993","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ada38e585c696a674b536ab7e1d28d70faa69685bb204ed1d944db23a71c478c","sha256:f74797a54a85c300250b7dac3c249acae9982b59898b549a88834ee98a16e5cb"],"state_sha256":"6368dbc28bafd6e4de270782cb535d2e77f0e636763febb1d3b01896595c23d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuLSw5MtPGX6rSdDNasHSGOava4KPFOdAuq3fV8KmirGSN9bc3l7R6D6ZorvQGrMkTS8sw+S1I+6NxCRMU6yBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:17:14.121527Z","bundle_sha256":"3ba6cba33aedae739bea68ef138dd191ce233a682c4e34a94ddb2d5a7759b659"}}