{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GIBBJSEZLGCQZGYPWG6FP4HOKL","short_pith_number":"pith:GIBBJSEZ","schema_version":"1.0","canonical_sha256":"320214c89959850c9b0fb1bc57f0ee52e2e03b3c8371836f7649edf545c51553","source":{"kind":"arxiv","id":"1301.1425","version":2},"attestation_state":"computed","paper":{"title":"Pebbling, Entropy and Branching Program Size Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Jayalal Sarma M. N","submitted_at":"2013-01-08T06:52:06Z","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"},"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":"1301.1425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T06:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"e28e616a560eab81b02e6ed1732c4d83da46add6b4e78ad277c7818cbae87997","abstract_canon_sha256":"b391b7f705539d3bca633803608f01699f6b9fbf924c38852b08b1a278e01f7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:02.025691Z","signature_b64":"DrvyLsRS45+GK1tWlMdeNIEahuBlTtUMeSoRFAcCwba3U1N6r5W/QeMZPGKs2Dkgqczvx5Iso5CSoI/563hkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320214c89959850c9b0fb1bc57f0ee52e2e03b3c8371836f7649edf545c51553","last_reissued_at":"2026-05-18T03:07:02.025088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:02.025088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pebbling, Entropy and Branching Program Size Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Jayalal Sarma M. N","submitted_at":"2013-01-08T06:52:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1425","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":"1301.1425","created_at":"2026-05-18T03:07:02.025179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1425v2","created_at":"2026-05-18T03:07:02.025179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1425","created_at":"2026-05-18T03:07:02.025179+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIBBJSEZLGCQ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIBBJSEZLGCQZGYP","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIBBJSEZ","created_at":"2026-05-18T12:27:45.050594+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/GIBBJSEZLGCQZGYPWG6FP4HOKL","json":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL.json","graph_json":"https://pith.science/api/pith-number/GIBBJSEZLGCQZGYPWG6FP4HOKL/graph.json","events_json":"https://pith.science/api/pith-number/GIBBJSEZLGCQZGYPWG6FP4HOKL/events.json","paper":"https://pith.science/paper/GIBBJSEZ"},"agent_actions":{"view_html":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL","download_json":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL.json","view_paper":"https://pith.science/paper/GIBBJSEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1425&json=true","fetch_graph":"https://pith.science/api/pith-number/GIBBJSEZLGCQZGYPWG6FP4HOKL/graph.json","fetch_events":"https://pith.science/api/pith-number/GIBBJSEZLGCQZGYPWG6FP4HOKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL/action/storage_attestation","attest_author":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL/action/author_attestation","sign_citation":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL/action/citation_signature","submit_replication":"https://pith.science/pith/GIBBJSEZLGCQZGYPWG6FP4HOKL/action/replication_record"}},"created_at":"2026-05-18T03:07:02.025179+00:00","updated_at":"2026-05-18T03:07:02.025179+00:00"}