{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GIBBJSEZLGCQZGYPWG6FP4HOKL","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":"b391b7f705539d3bca633803608f01699f6b9fbf924c38852b08b1a278e01f7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T06:52:06Z","title_canon_sha256":"e28e616a560eab81b02e6ed1732c4d83da46add6b4e78ad277c7818cbae87997"},"schema_version":"1.0","source":{"id":"1301.1425","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1425","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1425v2","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1425","created_at":"2026-05-18T03:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"GIBBJSEZLGCQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GIBBJSEZLGCQZGYP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GIBBJSEZ","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:6ce2212863473658a98bad305f194e2948a349f092bc69635ab3fa44bf2597dd","target":"graph","created_at":"2026-05-18T03:07:02Z","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 contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012). Proving a super-polynomial lower bound for the size of nondeterministic thrifty branching programs (NTBP) would separate $NL$ from $P$ for thrifty models solving the tree evaluation problem. First, we show that {\\em Read-Once NTBPs} are equivalent to whole black-white pebbling algorithms thus showing a tight lower bound (ignoring polynomial factors) for this model.\n  We then introduce a weaker restriction of NTBPs called {\\em Bitwise Inde","authors_text":"Balagopal Komarath, Jayalal Sarma M. N","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T06:52:06Z","title":"Pebbling, Entropy and Branching Program Size Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1425","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:96648b4a40880e291a07101aabbe4ef048a97f93dff0e03880d9a8da777b5e0d","target":"record","created_at":"2026-05-18T03:07:02Z","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":"b391b7f705539d3bca633803608f01699f6b9fbf924c38852b08b1a278e01f7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T06:52:06Z","title_canon_sha256":"e28e616a560eab81b02e6ed1732c4d83da46add6b4e78ad277c7818cbae87997"},"schema_version":"1.0","source":{"id":"1301.1425","kind":"arxiv","version":2}},"canonical_sha256":"320214c89959850c9b0fb1bc57f0ee52e2e03b3c8371836f7649edf545c51553","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320214c89959850c9b0fb1bc57f0ee52e2e03b3c8371836f7649edf545c51553","first_computed_at":"2026-05-18T03:07:02.025088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:02.025088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DrvyLsRS45+GK1tWlMdeNIEahuBlTtUMeSoRFAcCwba3U1N6r5W/QeMZPGKs2Dkgqczvx5Iso5CSoI/563hkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:02.025691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1425","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96648b4a40880e291a07101aabbe4ef048a97f93dff0e03880d9a8da777b5e0d","sha256:6ce2212863473658a98bad305f194e2948a349f092bc69635ab3fa44bf2597dd"],"state_sha256":"6afaefc2476aca826ac8f84e06eeff63090f8ab565f9ce18232bc5ef68f3be20"}