{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LY7MPCGHGCNKVVIAP3PQ2RWDW3","short_pith_number":"pith:LY7MPCGH","schema_version":"1.0","canonical_sha256":"5e3ec788c7309aaad5007edf0d46c3b6d4a6cddfc95de098bc53349c8f8b6185","source":{"kind":"arxiv","id":"1601.08031","version":2},"attestation_state":"computed","paper":{"title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arpita Korwar, Nitin Saxena, Rohit Gurjar","submitted_at":"2016-01-29T10:22:51Z","abstract_excerpt":"We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. The best previously known hitting set for this case had size $(nw)^{O(\\log n)}$ where $n$ is the number of variables and $w$ is the width of the ROABP. Even for a constant-width ROABP, nothing better than a quasi-polynomial bound was known. We improve the hitting-set size for the known-order case to $n^{O(\\log w)}$. In particular, this gives the first polynomial-size hitting set for constant-width ROABP (known-order)."},"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":"1601.08031","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-01-29T10:22:51Z","cross_cats_sorted":[],"title_canon_sha256":"95e4713a9424a2302250d4bcaa6834663e5604c9359e2b1b65d02feb95ca7a18","abstract_canon_sha256":"48fb313ecd1a8a0a873a9a328493606175241d479510cd6584bc980ab65133c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:07.350212Z","signature_b64":"T81R1ZJ7e75Kd/JBMw/tiVTxw+VWwcLZbUP0NM2pZ8PTr6TXlgp7ulWcTxx/Wo9zO7u+3XxcBxPkbz2cvI9hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e3ec788c7309aaad5007edf0d46c3b6d4a6cddfc95de098bc53349c8f8b6185","last_reissued_at":"2026-05-18T00:11:07.349464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:07.349464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arpita Korwar, Nitin Saxena, Rohit Gurjar","submitted_at":"2016-01-29T10:22:51Z","abstract_excerpt":"We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. The best previously known hitting set for this case had size $(nw)^{O(\\log n)}$ where $n$ is the number of variables and $w$ is the width of the ROABP. Even for a constant-width ROABP, nothing better than a quasi-polynomial bound was known. We improve the hitting-set size for the known-order case to $n^{O(\\log w)}$. In particular, this gives the first polynomial-size hitting set for constant-width ROABP (known-order)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08031","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":"1601.08031","created_at":"2026-05-18T00:11:07.349592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.08031v2","created_at":"2026-05-18T00:11:07.349592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08031","created_at":"2026-05-18T00:11:07.349592+00:00"},{"alias_kind":"pith_short_12","alias_value":"LY7MPCGHGCNK","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LY7MPCGHGCNKVVIA","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LY7MPCGH","created_at":"2026-05-18T12:30:29.479603+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/LY7MPCGHGCNKVVIAP3PQ2RWDW3","json":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3.json","graph_json":"https://pith.science/api/pith-number/LY7MPCGHGCNKVVIAP3PQ2RWDW3/graph.json","events_json":"https://pith.science/api/pith-number/LY7MPCGHGCNKVVIAP3PQ2RWDW3/events.json","paper":"https://pith.science/paper/LY7MPCGH"},"agent_actions":{"view_html":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3","download_json":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3.json","view_paper":"https://pith.science/paper/LY7MPCGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.08031&json=true","fetch_graph":"https://pith.science/api/pith-number/LY7MPCGHGCNKVVIAP3PQ2RWDW3/graph.json","fetch_events":"https://pith.science/api/pith-number/LY7MPCGHGCNKVVIAP3PQ2RWDW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/action/storage_attestation","attest_author":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/action/author_attestation","sign_citation":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/action/citation_signature","submit_replication":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/action/replication_record"}},"created_at":"2026-05-18T00:11:07.349592+00:00","updated_at":"2026-05-18T00:11:07.349592+00:00"}