{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YP224XS7DRDR5RVEVWWMX4SXED","short_pith_number":"pith:YP224XS7","schema_version":"1.0","canonical_sha256":"c3f5ae5e5f1c471ec6a4adaccbf25720f968d24a44329bcb4bb0a6161a593113","source":{"kind":"arxiv","id":"1605.02815","version":1},"attestation_state":"computed","paper":{"title":"Boundaries of VP and VNP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO","math.RT"],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao","submitted_at":"2016-05-10T01:06:40Z","abstract_excerpt":"One fundamental question in the context of the geometric complexity theory approach to the VP vs. VNP conjecture is whether VP = $\\overline{\\textrm{VP}}$, where VP is the class of families of polynomials that are of polynomial degree and can be computed by arithmetic circuits of polynomial size, and $\\overline{\\textrm{VP}}$ is the class of families of polynomials that are of polynomial degree and can be approximated infinitesimally closely by arithmetic circuits of polynomial size. The goal of this article is to study the conjecture in (Mulmuley, FOCS 2012) that $\\overline{\\textrm{VP}}$ is not"},"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":"1605.02815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-10T01:06:40Z","cross_cats_sorted":["math.AG","math.CO","math.RT"],"title_canon_sha256":"dac85aebfa640572b5b9419e3af4f8deaa77e84b22ee9f5433c46aa79f6b84b3","abstract_canon_sha256":"1a1915cb0623c020a1ad11b785c5b76a6feb58d66fc39a00deb8c528a70166a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:13.081639Z","signature_b64":"QKMdk/0X8BeWHuS239/Ho0yFCc+wovvO7lENbVxvUSkQl3ChyGgcVxUEAa1sLhQIO/oTQPqeKs0qtk/YtsU6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3f5ae5e5f1c471ec6a4adaccbf25720f968d24a44329bcb4bb0a6161a593113","last_reissued_at":"2026-05-18T01:15:13.080990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:13.080990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boundaries of VP and VNP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.CO","math.RT"],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow, Ketan D. Mulmuley, Youming Qiao","submitted_at":"2016-05-10T01:06:40Z","abstract_excerpt":"One fundamental question in the context of the geometric complexity theory approach to the VP vs. VNP conjecture is whether VP = $\\overline{\\textrm{VP}}$, where VP is the class of families of polynomials that are of polynomial degree and can be computed by arithmetic circuits of polynomial size, and $\\overline{\\textrm{VP}}$ is the class of families of polynomials that are of polynomial degree and can be approximated infinitesimally closely by arithmetic circuits of polynomial size. The goal of this article is to study the conjecture in (Mulmuley, FOCS 2012) that $\\overline{\\textrm{VP}}$ is not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02815","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":"1605.02815","created_at":"2026-05-18T01:15:13.081086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02815v1","created_at":"2026-05-18T01:15:13.081086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02815","created_at":"2026-05-18T01:15:13.081086+00:00"},{"alias_kind":"pith_short_12","alias_value":"YP224XS7DRDR","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YP224XS7DRDR5RVE","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YP224XS7","created_at":"2026-05-18T12:30:53.716459+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/YP224XS7DRDR5RVEVWWMX4SXED","json":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED.json","graph_json":"https://pith.science/api/pith-number/YP224XS7DRDR5RVEVWWMX4SXED/graph.json","events_json":"https://pith.science/api/pith-number/YP224XS7DRDR5RVEVWWMX4SXED/events.json","paper":"https://pith.science/paper/YP224XS7"},"agent_actions":{"view_html":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED","download_json":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED.json","view_paper":"https://pith.science/paper/YP224XS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02815&json=true","fetch_graph":"https://pith.science/api/pith-number/YP224XS7DRDR5RVEVWWMX4SXED/graph.json","fetch_events":"https://pith.science/api/pith-number/YP224XS7DRDR5RVEVWWMX4SXED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED/action/storage_attestation","attest_author":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED/action/author_attestation","sign_citation":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED/action/citation_signature","submit_replication":"https://pith.science/pith/YP224XS7DRDR5RVEVWWMX4SXED/action/replication_record"}},"created_at":"2026-05-18T01:15:13.081086+00:00","updated_at":"2026-05-18T01:15:13.081086+00:00"}