{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KPPE4YUH5BJDYG4L7CDNWC6DL7","short_pith_number":"pith:KPPE4YUH","schema_version":"1.0","canonical_sha256":"53de4e6287e8523c1b8bf886db0bc35fe8c3033531f5c50212effc0e73c3d847","source":{"kind":"arxiv","id":"1209.2408","version":2},"attestation_state":"computed","paper":{"title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amir Shpilka, Michael A. Forbes","submitted_at":"2012-09-11T19:52:41Z","abstract_excerpt":"We study the problem of obtaining deterministic black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an deterministic white-box polynomial identity testing algorithm (due to Raz and Shpilka), but prior to this work there was no known such black-box algorithm.\n  The main result of this work gives the first quasi-polynomial sized hitting sets for size S circuits from this class, when the order of the variables is known. As our hitting set is of size exp(lg^2 S), this is analogous (in the terminology of boo"},"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.2408","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-11T19:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"0dfb7ed5e094ea9b078c43b477ae70bc201eb83ecd1c30a604fafc2d5eee8be3","abstract_canon_sha256":"69852f38331757480d859fa57686aa6c196ca26efe2383460f96459214efdf1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:46.493682Z","signature_b64":"qm5jkfEcsC9JotN4AwtymakGZ9++kts9WlGe72SBorF+Db20ASkAr8j+atbP37LI40uA5UaTwVZNzi6mTX9DDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53de4e6287e8523c1b8bf886db0bc35fe8c3033531f5c50212effc0e73c3d847","last_reissued_at":"2026-05-18T03:12:46.493056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:46.493056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amir Shpilka, Michael A. Forbes","submitted_at":"2012-09-11T19:52:41Z","abstract_excerpt":"We study the problem of obtaining deterministic black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an deterministic white-box polynomial identity testing algorithm (due to Raz and Shpilka), but prior to this work there was no known such black-box algorithm.\n  The main result of this work gives the first quasi-polynomial sized hitting sets for size S circuits from this class, when the order of the variables is known. As our hitting set is of size exp(lg^2 S), this is analogous (in the terminology of boo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2408","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":"1209.2408","created_at":"2026-05-18T03:12:46.493152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2408v2","created_at":"2026-05-18T03:12:46.493152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2408","created_at":"2026-05-18T03:12:46.493152+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPPE4YUH5BJD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPPE4YUH5BJDYG4L","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPPE4YUH","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18981","citing_title":"The Complexity of Order-Finding for ROABPs","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7","json":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7.json","graph_json":"https://pith.science/api/pith-number/KPPE4YUH5BJDYG4L7CDNWC6DL7/graph.json","events_json":"https://pith.science/api/pith-number/KPPE4YUH5BJDYG4L7CDNWC6DL7/events.json","paper":"https://pith.science/paper/KPPE4YUH"},"agent_actions":{"view_html":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7","download_json":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7.json","view_paper":"https://pith.science/paper/KPPE4YUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2408&json=true","fetch_graph":"https://pith.science/api/pith-number/KPPE4YUH5BJDYG4L7CDNWC6DL7/graph.json","fetch_events":"https://pith.science/api/pith-number/KPPE4YUH5BJDYG4L7CDNWC6DL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7/action/storage_attestation","attest_author":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7/action/author_attestation","sign_citation":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7/action/citation_signature","submit_replication":"https://pith.science/pith/KPPE4YUH5BJDYG4L7CDNWC6DL7/action/replication_record"}},"created_at":"2026-05-18T03:12:46.493152+00:00","updated_at":"2026-05-18T03:12:46.493152+00:00"}