{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LY7MPCGHGCNKVVIAP3PQ2RWDW3","short_pith_number":"pith:LY7MPCGH","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"},"canonical_sha256":"5e3ec788c7309aaad5007edf0d46c3b6d4a6cddfc95de098bc53349c8f8b6185","source":{"kind":"arxiv","id":"1601.08031","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08031","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08031v2","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08031","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"LY7MPCGHGCNK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LY7MPCGHGCNKVVIA","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LY7MPCGH","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LY7MPCGHGCNKVVIAP3PQ2RWDW3","target":"record","payload":{"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"},"canonical_sha256":"5e3ec788c7309aaad5007edf0d46c3b6d4a6cddfc95de098bc53349c8f8b6185","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"},"source_kind":"arxiv","source_id":"1601.08031","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEWTcEM+1h9lK+/4xLrrRiGZLKWZuFCvnuK4+BC5VjwuI8D3o+CPuvjQuJwcmf0o1cA2NpRqf1cHcuUX+yL5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:49:44.501293Z"},"content_sha256":"6e9069a10ee50ce8a320de1607b4ea34a58e1dc81a6b51da2a2add2a0d39689d","schema_version":"1.0","event_id":"sha256:6e9069a10ee50ce8a320de1607b4ea34a58e1dc81a6b51da2a2add2a0d39689d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LY7MPCGHGCNKVVIAP3PQ2RWDW3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llnp24G1M3meKrNIo+2S3n3PANWT5bKmbXIxBOZb9Xm9BwcgpQcp3MAn4WRuWcfTF1CjGmFQkV56re9sCIOQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:49:44.501655Z"},"content_sha256":"196f889a2798442aeaf0be03023d1e82d2d7aa5363adafae5dea318451478900","schema_version":"1.0","event_id":"sha256:196f889a2798442aeaf0be03023d1e82d2d7aa5363adafae5dea318451478900"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/bundle.json","state_url":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T19:49:44Z","links":{"resolver":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3","bundle":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/bundle.json","state":"https://pith.science/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LY7MPCGHGCNKVVIAP3PQ2RWDW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LY7MPCGHGCNKVVIAP3PQ2RWDW3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"48fb313ecd1a8a0a873a9a328493606175241d479510cd6584bc980ab65133c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-01-29T10:22:51Z","title_canon_sha256":"95e4713a9424a2302250d4bcaa6834663e5604c9359e2b1b65d02feb95ca7a18"},"schema_version":"1.0","source":{"id":"1601.08031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08031","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08031v2","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08031","created_at":"2026-05-18T00:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"LY7MPCGHGCNK","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LY7MPCGHGCNKVVIA","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LY7MPCGH","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:196f889a2798442aeaf0be03023d1e82d2d7aa5363adafae5dea318451478900","target":"graph","created_at":"2026-05-18T00:11:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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).","authors_text":"Arpita Korwar, Nitin Saxena, Rohit Gurjar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-01-29T10:22:51Z","title":"Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08031","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e9069a10ee50ce8a320de1607b4ea34a58e1dc81a6b51da2a2add2a0d39689d","target":"record","created_at":"2026-05-18T00:11:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"48fb313ecd1a8a0a873a9a328493606175241d479510cd6584bc980ab65133c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2016-01-29T10:22:51Z","title_canon_sha256":"95e4713a9424a2302250d4bcaa6834663e5604c9359e2b1b65d02feb95ca7a18"},"schema_version":"1.0","source":{"id":"1601.08031","kind":"arxiv","version":2}},"canonical_sha256":"5e3ec788c7309aaad5007edf0d46c3b6d4a6cddfc95de098bc53349c8f8b6185","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e3ec788c7309aaad5007edf0d46c3b6d4a6cddfc95de098bc53349c8f8b6185","first_computed_at":"2026-05-18T00:11:07.349464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:07.349464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T81R1ZJ7e75Kd/JBMw/tiVTxw+VWwcLZbUP0NM2pZ8PTr6TXlgp7ulWcTxx/Wo9zO7u+3XxcBxPkbz2cvI9hBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:07.350212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.08031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e9069a10ee50ce8a320de1607b4ea34a58e1dc81a6b51da2a2add2a0d39689d","sha256:196f889a2798442aeaf0be03023d1e82d2d7aa5363adafae5dea318451478900"],"state_sha256":"5449c509ef8d25791ea2da6fa0508cdfa36bc6522dde4b25d601e9e57aeb172c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lv/qVWZdTmIbsekKTTqgsvV3dTRPlXW52uCgaFTNch2uXp5hL9LrRvSKmLFfzvcia79rK2BcD1mS/WfHoF4tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:49:44.503526Z","bundle_sha256":"55e0815cefac6edf9ddd5e897c17b894f1e52df5ac3702c69a6c037cada7cb02"}}