{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TMFS7DCVHCKKY3INNOMLQ7GYJQ","short_pith_number":"pith:TMFS7DCV","schema_version":"1.0","canonical_sha256":"9b0b2f8c553894ac6d0d6b98b87cd84c3c078ad572c031432779ca8bf079ba05","source":{"kind":"arxiv","id":"1606.00596","version":3},"attestation_state":"computed","paper":{"title":"Randomized Polynomial Time Identity Testing for Noncommutative Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, S. Raja, V. Arvind","submitted_at":"2016-06-02T09:33:02Z","abstract_excerpt":"In this paper we show that the black-box polynomial identity testing for noncommutative polynomials $f\\in\\mathbb{F}\\langle z_1,z_2,\\cdots,z_n \\rangle$ of degree $D$ and sparsity $t$, can be done in randomized $\\poly(n,\\log t,\\log D)$ time. As a consequence, if the black-box contains a circuit $C$ of size $s$ computing $f\\in\\mathbb{F}\\langle z_1,z_2,\\cdots,z_n \\rangle$ which has at most $t$ non-zero monomials, then the identity testing can be done by a randomized algorithm with running time polynomial in $s$ and $n$ and $\\log t$. This makes significant progress on a question that has been open "},"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":"1606.00596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-02T09:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"e93436f0bf677907ddc0c0e41369f6e3808ac30ee1ff2b49ea3ec97a5fd3cf8e","abstract_canon_sha256":"9df3a134bebce00434e5da0cb20cb3775269b18b1499b5cfcf80743091e10c89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:54.529187Z","signature_b64":"uSyh3zfXcUYxzA1hy5Ck0wmYAzqR96+NOYIwDGu1aM6+YSXqoRloXv4sw9EvF1nbrKWI6sIKosmKUJFGI0LrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b0b2f8c553894ac6d0d6b98b87cd84c3c078ad572c031432779ca8bf079ba05","last_reissued_at":"2026-05-18T01:12:54.528843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:54.528843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Polynomial Time Identity Testing for Noncommutative Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, S. Raja, V. Arvind","submitted_at":"2016-06-02T09:33:02Z","abstract_excerpt":"In this paper we show that the black-box polynomial identity testing for noncommutative polynomials $f\\in\\mathbb{F}\\langle z_1,z_2,\\cdots,z_n \\rangle$ of degree $D$ and sparsity $t$, can be done in randomized $\\poly(n,\\log t,\\log D)$ time. As a consequence, if the black-box contains a circuit $C$ of size $s$ computing $f\\in\\mathbb{F}\\langle z_1,z_2,\\cdots,z_n \\rangle$ which has at most $t$ non-zero monomials, then the identity testing can be done by a randomized algorithm with running time polynomial in $s$ and $n$ and $\\log t$. This makes significant progress on a question that has been open "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00596","kind":"arxiv","version":3},"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":"1606.00596","created_at":"2026-05-18T01:12:54.528900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00596v3","created_at":"2026-05-18T01:12:54.528900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00596","created_at":"2026-05-18T01:12:54.528900+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMFS7DCVHCKK","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMFS7DCVHCKKY3IN","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMFS7DCV","created_at":"2026-05-18T12:30:44.179134+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/TMFS7DCVHCKKY3INNOMLQ7GYJQ","json":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ.json","graph_json":"https://pith.science/api/pith-number/TMFS7DCVHCKKY3INNOMLQ7GYJQ/graph.json","events_json":"https://pith.science/api/pith-number/TMFS7DCVHCKKY3INNOMLQ7GYJQ/events.json","paper":"https://pith.science/paper/TMFS7DCV"},"agent_actions":{"view_html":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ","download_json":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ.json","view_paper":"https://pith.science/paper/TMFS7DCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00596&json=true","fetch_graph":"https://pith.science/api/pith-number/TMFS7DCVHCKKY3INNOMLQ7GYJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TMFS7DCVHCKKY3INNOMLQ7GYJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ/action/storage_attestation","attest_author":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ/action/author_attestation","sign_citation":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ/action/citation_signature","submit_replication":"https://pith.science/pith/TMFS7DCVHCKKY3INNOMLQ7GYJQ/action/replication_record"}},"created_at":"2026-05-18T01:12:54.528900+00:00","updated_at":"2026-05-18T01:12:54.528900+00:00"}