{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UTWPZUBAG3RSUQXNNIYCGTKUOL","short_pith_number":"pith:UTWPZUBA","schema_version":"1.0","canonical_sha256":"a4ecfcd02036e32a42ed6a30234d5472f80dce91b8f07db85e111e51c4a82875","source":{"kind":"arxiv","id":"1705.00140","version":2},"attestation_state":"computed","paper":{"title":"Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, Rajit Datta, S. Raja, V. Arvind","submitted_at":"2017-04-29T07:04:07Z","abstract_excerpt":"In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $\\mathbb{F}\\{x_1,x_2,\\ldots,x_n\\}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10], and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing (PIT) and polynomial factorization over $\\mathbb{F}\\{x_1,x_2,\\ldots,x_n\\}$ and show the following results. (1) Given an arithmetic circuit $C$ of size $s$ computing a polynomial $f\\in \\mathbb{F} \\{x_1,x_2,\\ldots,x_n\\}$ of degree $d$,"},"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":"1705.00140","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-29T07:04:07Z","cross_cats_sorted":[],"title_canon_sha256":"3f42059c6415478d63075c3a1ab73dd32af8a852ae952d9293531a9933eedc35","abstract_canon_sha256":"4213bf21ca83cdc5c2711ada682d4dad8662e72d800c1cef97927244e42cc9c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:48.729373Z","signature_b64":"wURfHFgIkHp6Qo84KeXL1wA/gniGokDUq2whaXszjvCWOry/EUNaNZwxBtoxon9pCA1mf9/XOMwpoX0Te/eeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ecfcd02036e32a42ed6a30234d5472f80dce91b8f07db85e111e51c4a82875","last_reissued_at":"2026-05-18T00:40:48.728706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:48.728706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, Rajit Datta, S. Raja, V. Arvind","submitted_at":"2017-04-29T07:04:07Z","abstract_excerpt":"In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $\\mathbb{F}\\{x_1,x_2,\\ldots,x_n\\}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10], and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing (PIT) and polynomial factorization over $\\mathbb{F}\\{x_1,x_2,\\ldots,x_n\\}$ and show the following results. (1) Given an arithmetic circuit $C$ of size $s$ computing a polynomial $f\\in \\mathbb{F} \\{x_1,x_2,\\ldots,x_n\\}$ of degree $d$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00140","kind":"arxiv","version":2},"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":"1705.00140","created_at":"2026-05-18T00:40:48.728800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00140v2","created_at":"2026-05-18T00:40:48.728800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00140","created_at":"2026-05-18T00:40:48.728800+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTWPZUBAG3RS","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTWPZUBAG3RSUQXN","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTWPZUBA","created_at":"2026-05-18T12:31:49.984773+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/UTWPZUBAG3RSUQXNNIYCGTKUOL","json":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL.json","graph_json":"https://pith.science/api/pith-number/UTWPZUBAG3RSUQXNNIYCGTKUOL/graph.json","events_json":"https://pith.science/api/pith-number/UTWPZUBAG3RSUQXNNIYCGTKUOL/events.json","paper":"https://pith.science/paper/UTWPZUBA"},"agent_actions":{"view_html":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL","download_json":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL.json","view_paper":"https://pith.science/paper/UTWPZUBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00140&json=true","fetch_graph":"https://pith.science/api/pith-number/UTWPZUBAG3RSUQXNNIYCGTKUOL/graph.json","fetch_events":"https://pith.science/api/pith-number/UTWPZUBAG3RSUQXNNIYCGTKUOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL/action/storage_attestation","attest_author":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL/action/author_attestation","sign_citation":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL/action/citation_signature","submit_replication":"https://pith.science/pith/UTWPZUBAG3RSUQXNNIYCGTKUOL/action/replication_record"}},"created_at":"2026-05-18T00:40:48.728800+00:00","updated_at":"2026-05-18T00:40:48.728800+00:00"}