{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SNLJQYBRG76O2Q5IJMQ6GOGQPF","short_pith_number":"pith:SNLJQYBR","canonical_record":{"source":{"id":"1411.7341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-26T19:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"419295140914745e9237f71179a1d0d6a1d2e03227e468a303634c7ec20077b3","abstract_canon_sha256":"bb505f1e3304bf7d564f6f2f727c7942efda2c3e5d3ab5274e650b2f1cba29f1"},"schema_version":"1.0"},"canonical_sha256":"935698603137fced43a84b21e338d0794360eb2444ab0ddc61e1e04337c67074","source":{"kind":"arxiv","id":"1411.7341","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7341","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7341v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7341","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"SNLJQYBRG76O","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SNLJQYBRG76O2Q5I","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SNLJQYBR","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SNLJQYBRG76O2Q5IJMQ6GOGQPF","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-26T19:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"419295140914745e9237f71179a1d0d6a1d2e03227e468a303634c7ec20077b3","abstract_canon_sha256":"bb505f1e3304bf7d564f6f2f727c7942efda2c3e5d3ab5274e650b2f1cba29f1"},"schema_version":"1.0"},"canonical_sha256":"935698603137fced43a84b21e338d0794360eb2444ab0ddc61e1e04337c67074","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.734741Z","signature_b64":"YP/0rOCUPlp4byY8DCrMGkzSVV3pqu1u+PE5UrhfXsduzOSP/jmk7f2WZt+eSEzVRlBWv2n1EG4kCiA6zXPmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"935698603137fced43a84b21e338d0794360eb2444ab0ddc61e1e04337c67074","last_reissued_at":"2026-05-18T02:07:26.734062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.734062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7341","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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWbf9pY064nqBQIFNZF2Ht+At5LFHiYBA3olSbHzQp/20gZt0uJeD01q6Wa+wvUd8lc5Qso7owUb0mHbI7HkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:24:42.455183Z"},"content_sha256":"7bd40dd81b71fb8270c32ab87a018755cf4b2df2220083db98112943d40f6d50","schema_version":"1.0","event_id":"sha256:7bd40dd81b71fb8270c32ab87a018755cf4b2df2220083db98112943d40f6d50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SNLJQYBRG76O2Q5IJMQ6GOGQPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arpita Korwar, Nitin Saxena, Rohit Gurjar, Thomas Thierauf","submitted_at":"2014-11-26T19:24:14Z","abstract_excerpt":"A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding blackbox algorithm with quasi-polynomial time complexity $n^{O(\\log n)}$. In both the cases, our time complexity is double exponential in the number of ROABPs.\n  ROABPs are a generalization of set-multilinear depth-$3$ circuits. The prior results for the sum of constantly many set-multilinear depth-$3$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7341","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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OMAEq9F4y0a+6BGldSxhOqmfn0mRcoVHDM93ZVxg2vFqo7KrzT/sYsbQYQ8TLBPUaTbkMHpgEDr8UgHOZLCQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:24:42.455558Z"},"content_sha256":"02cab86d838342c06a5f3cc7bbdb58293aabc8acfcb369c045c802a75b79474c","schema_version":"1.0","event_id":"sha256:02cab86d838342c06a5f3cc7bbdb58293aabc8acfcb369c045c802a75b79474c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF/bundle.json","state_url":"https://pith.science/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF/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-01T13:24:42Z","links":{"resolver":"https://pith.science/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF","bundle":"https://pith.science/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF/bundle.json","state":"https://pith.science/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNLJQYBRG76O2Q5IJMQ6GOGQPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SNLJQYBRG76O2Q5IJMQ6GOGQPF","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":"bb505f1e3304bf7d564f6f2f727c7942efda2c3e5d3ab5274e650b2f1cba29f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-26T19:24:14Z","title_canon_sha256":"419295140914745e9237f71179a1d0d6a1d2e03227e468a303634c7ec20077b3"},"schema_version":"1.0","source":{"id":"1411.7341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7341","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7341v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7341","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"SNLJQYBRG76O","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SNLJQYBRG76O2Q5I","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SNLJQYBR","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:02cab86d838342c06a5f3cc7bbdb58293aabc8acfcb369c045c802a75b79474c","target":"graph","created_at":"2026-05-18T02:07:26Z","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":"A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding blackbox algorithm with quasi-polynomial time complexity $n^{O(\\log n)}$. In both the cases, our time complexity is double exponential in the number of ROABPs.\n  ROABPs are a generalization of set-multilinear depth-$3$ circuits. The prior results for the sum of constantly many set-multilinear depth-$3$","authors_text":"Arpita Korwar, Nitin Saxena, Rohit Gurjar, Thomas Thierauf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-26T19:24:14Z","title":"Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7341","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:7bd40dd81b71fb8270c32ab87a018755cf4b2df2220083db98112943d40f6d50","target":"record","created_at":"2026-05-18T02:07:26Z","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":"bb505f1e3304bf7d564f6f2f727c7942efda2c3e5d3ab5274e650b2f1cba29f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-26T19:24:14Z","title_canon_sha256":"419295140914745e9237f71179a1d0d6a1d2e03227e468a303634c7ec20077b3"},"schema_version":"1.0","source":{"id":"1411.7341","kind":"arxiv","version":2}},"canonical_sha256":"935698603137fced43a84b21e338d0794360eb2444ab0ddc61e1e04337c67074","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"935698603137fced43a84b21e338d0794360eb2444ab0ddc61e1e04337c67074","first_computed_at":"2026-05-18T02:07:26.734062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:26.734062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YP/0rOCUPlp4byY8DCrMGkzSVV3pqu1u+PE5UrhfXsduzOSP/jmk7f2WZt+eSEzVRlBWv2n1EG4kCiA6zXPmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:26.734741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bd40dd81b71fb8270c32ab87a018755cf4b2df2220083db98112943d40f6d50","sha256:02cab86d838342c06a5f3cc7bbdb58293aabc8acfcb369c045c802a75b79474c"],"state_sha256":"115e696db84375cd4310aa165ce5e313f6950f83175931d61abc8301761f55b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YDjYTK1jOCvNtDIYVxjsnDPzqzbOZfpNpW6T7DxyyCVhBRdB5TllOi2xI8Z/87xc4SfqS/s/1VfxhwtJnoxnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:24:42.457519Z","bundle_sha256":"d1958fb2a84f2a137b7ab33547a063bc9fcaa1975f7126c64b061f9aac4a963d"}}