{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:XVUC764II3KJVO5ITN3EJRALZH","short_pith_number":"pith:XVUC764I","canonical_record":{"source":{"id":"0912.2565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-12-14T02:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"db28d8ebdfc1aa88ad9e822dbae9896a4465a4680ccce2d8e9a693e983e1743d","abstract_canon_sha256":"79c3ff0b4d8229c2c8cf78cbd78c8f670a91ac5a681d119836543fccf7484353"},"schema_version":"1.0"},"canonical_sha256":"bd682ffb8846d49abba89b7644c40bc9c5e406f68b35380edc89e167a460422f","source":{"kind":"arxiv","id":"0912.2565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.2565","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"0912.2565v1","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2565","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"XVUC764II3KJ","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"XVUC764II3KJVO5I","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"XVUC764I","created_at":"2026-07-04T17:17:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:XVUC764II3KJVO5ITN3EJRALZH","target":"record","payload":{"canonical_record":{"source":{"id":"0912.2565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-12-14T02:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"db28d8ebdfc1aa88ad9e822dbae9896a4465a4680ccce2d8e9a693e983e1743d","abstract_canon_sha256":"79c3ff0b4d8229c2c8cf78cbd78c8f670a91ac5a681d119836543fccf7484353"},"schema_version":"1.0"},"canonical_sha256":"bd682ffb8846d49abba89b7644c40bc9c5e406f68b35380edc89e167a460422f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:17:45.630190Z","signature_b64":"6W4RVQ7wvSsrA3s+xe8WzXjePvIofsUA2xlCGegACqEriCRXnTlNzFSDsKurzJ1fRRLzT9ZlFqGIc5+mXPNzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd682ffb8846d49abba89b7644c40bc9c5e406f68b35380edc89e167a460422f","last_reissued_at":"2026-07-04T17:17:45.629696Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:17:45.629696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.2565","source_version":1,"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-07-04T17:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5nR0XO5a1wxB6drCkElVziCxShvbOosnma1ptaGxljnR7scW0EfEe9372R/SLY+HTcWct+YJKsCgwLTF8ZtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:23:21.149756Z"},"content_sha256":"a2ed1afe6837aea11ace7e7b57c89efd4364e4fb98b92bce200087981915d2f2","schema_version":"1.0","event_id":"sha256:a2ed1afe6837aea11ace7e7b57c89efd4364e4fb98b92bce200087981915d2f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:XVUC764II3KJVO5ITN3EJRALZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Identity Testing of Read-Once Algebraic Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Maurice Jansen, Youming Qiao","submitted_at":"2009-12-14T02:10:50Z","abstract_excerpt":"In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\\Sigma_k$-RO-formulas). We show that $\\Sigma_k$-RO-ABPs are strictly more powerful than $\\Sigma_k$-RO-formulas, for any $k \\leq \\lfloor n/2\\rfloor$, where $n$ is the number of variables. We obtain the following results:\n  1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2565","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0912.2565/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFYluUbUi7xxmT7iKF8lICzAeosFsZbxj8T3fIF9ZT0zaa6iyzoNH9oD4hLQKD/gqdERdeU/NNbe6MM/+SSrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:23:21.150643Z"},"content_sha256":"5c708b9228e424a5e9dec170106c232e47693e19fc75918813f92d28b357a5d7","schema_version":"1.0","event_id":"sha256:5c708b9228e424a5e9dec170106c232e47693e19fc75918813f92d28b357a5d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVUC764II3KJVO5ITN3EJRALZH/bundle.json","state_url":"https://pith.science/pith/XVUC764II3KJVO5ITN3EJRALZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVUC764II3KJVO5ITN3EJRALZH/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-08-04T02:23:21Z","links":{"resolver":"https://pith.science/pith/XVUC764II3KJVO5ITN3EJRALZH","bundle":"https://pith.science/pith/XVUC764II3KJVO5ITN3EJRALZH/bundle.json","state":"https://pith.science/pith/XVUC764II3KJVO5ITN3EJRALZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVUC764II3KJVO5ITN3EJRALZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:XVUC764II3KJVO5ITN3EJRALZH","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":"79c3ff0b4d8229c2c8cf78cbd78c8f670a91ac5a681d119836543fccf7484353","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-12-14T02:10:50Z","title_canon_sha256":"db28d8ebdfc1aa88ad9e822dbae9896a4465a4680ccce2d8e9a693e983e1743d"},"schema_version":"1.0","source":{"id":"0912.2565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.2565","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"0912.2565v1","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2565","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"XVUC764II3KJ","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"XVUC764II3KJVO5I","created_at":"2026-07-04T17:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"XVUC764I","created_at":"2026-07-04T17:17:45Z"}],"graph_snapshots":[{"event_id":"sha256:5c708b9228e424a5e9dec170106c232e47693e19fc75918813f92d28b357a5d7","target":"graph","created_at":"2026-07-04T17:17:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0912.2565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\\Sigma_k$-RO-formulas). We show that $\\Sigma_k$-RO-ABPs are strictly more powerful than $\\Sigma_k$-RO-formulas, for any $k \\leq \\lfloor n/2\\rfloor$, where $n$ is the number of variables. We obtain the following results:\n  1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds th","authors_text":"Jayalal Sarma, Maurice Jansen, Youming Qiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-12-14T02:10:50Z","title":"Deterministic Identity Testing of Read-Once Algebraic Branching Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2565","kind":"arxiv","version":1},"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:a2ed1afe6837aea11ace7e7b57c89efd4364e4fb98b92bce200087981915d2f2","target":"record","created_at":"2026-07-04T17:17:45Z","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":"79c3ff0b4d8229c2c8cf78cbd78c8f670a91ac5a681d119836543fccf7484353","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-12-14T02:10:50Z","title_canon_sha256":"db28d8ebdfc1aa88ad9e822dbae9896a4465a4680ccce2d8e9a693e983e1743d"},"schema_version":"1.0","source":{"id":"0912.2565","kind":"arxiv","version":1}},"canonical_sha256":"bd682ffb8846d49abba89b7644c40bc9c5e406f68b35380edc89e167a460422f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd682ffb8846d49abba89b7644c40bc9c5e406f68b35380edc89e167a460422f","first_computed_at":"2026-07-04T17:17:45.629696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:17:45.629696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6W4RVQ7wvSsrA3s+xe8WzXjePvIofsUA2xlCGegACqEriCRXnTlNzFSDsKurzJ1fRRLzT9ZlFqGIc5+mXPNzCA==","signature_status":"signed_v1","signed_at":"2026-07-04T17:17:45.630190Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.2565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2ed1afe6837aea11ace7e7b57c89efd4364e4fb98b92bce200087981915d2f2","sha256:5c708b9228e424a5e9dec170106c232e47693e19fc75918813f92d28b357a5d7"],"state_sha256":"29ede55c3e4214616ef4e073599e3ac4645f785c71a6801038b1b9fd9a4e400a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BatJIAdD0fDz90Bo3swtT5nnnPcahEQA4wOzhRp1/FigEyI0c/pIICYVd/9tz6n/HQRffCE/japycexcE+zrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:23:21.157603Z","bundle_sha256":"f4719a47b42d6c360f593be2c265fae5829819b25db3a7ebdc61a64ae0116079"}}