{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","short_pith_number":"pith:M3XJNLBJ","schema_version":"1.0","canonical_sha256":"66ee96ac29b7720b9923dc350ec6b96d62c1684a7f17152f16d35defffbbf302","source":{"kind":"arxiv","id":"1005.2642","version":1},"attestation_state":"computed","paper":{"title":"Pebbles and Branching Programs for Tree Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dustin Wehr, Mark Braverman, Pierre McKenzie, Rahul Santhanam, Stephen Cook","submitted_at":"2010-05-15T00:23:45Z","abstract_excerpt":"We introduce the Tree Evaluation Problem, show that it is in logDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarithmic space lower bound. The input to the problem is a rooted, balanced d-ary tree of height h, whose internal nodes are labeled with d-ary functions on [k] = {1,...,k}, and whose leaves are labeled with elements of [k].  Each node obtains a value in [k] equal to its d-ary function applied to the values of its d children.  The output is the value of the root.  We show that the standard black pebbling algorithm applied t"},"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":"1005.2642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-05-15T00:23:45Z","cross_cats_sorted":[],"title_canon_sha256":"79078d9f84da5c6dd9d4df865283cb83023eec7aa0cecaed64a622d76881c854","abstract_canon_sha256":"5cef540b2e2418baf00af822e940f23c21b1b8990a6d0c05855b72b744a35547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:06.831478Z","signature_b64":"dpYcN1uvhMmkeKnEmWPkEYsZ45lByNyR18tDXsBlaZJ9wOpWPbO6yqll5tV/MK3Ff5njPcApwkT9vAOo2QuoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ee96ac29b7720b9923dc350ec6b96d62c1684a7f17152f16d35defffbbf302","last_reissued_at":"2026-05-18T02:24:06.830778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:06.830778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pebbles and Branching Programs for Tree Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Dustin Wehr, Mark Braverman, Pierre McKenzie, Rahul Santhanam, Stephen Cook","submitted_at":"2010-05-15T00:23:45Z","abstract_excerpt":"We introduce the Tree Evaluation Problem, show that it is in logDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarithmic space lower bound. The input to the problem is a rooted, balanced d-ary tree of height h, whose internal nodes are labeled with d-ary functions on [k] = {1,...,k}, and whose leaves are labeled with elements of [k].  Each node obtains a value in [k] equal to its d-ary function applied to the values of its d children.  The output is the value of the root.  We show that the standard black pebbling algorithm applied t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2642","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":""},"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":"1005.2642","created_at":"2026-05-18T02:24:06.830890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2642v1","created_at":"2026-05-18T02:24:06.830890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2642","created_at":"2026-05-18T02:24:06.830890+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3XJNLBJW5ZA","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3XJNLBJW5ZAXGJD","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3XJNLBJ","created_at":"2026-05-18T12:26:10.704358+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/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","json":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV.json","graph_json":"https://pith.science/api/pith-number/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/graph.json","events_json":"https://pith.science/api/pith-number/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/events.json","paper":"https://pith.science/paper/M3XJNLBJ"},"agent_actions":{"view_html":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","download_json":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV.json","view_paper":"https://pith.science/paper/M3XJNLBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2642&json=true","fetch_graph":"https://pith.science/api/pith-number/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/graph.json","fetch_events":"https://pith.science/api/pith-number/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/action/storage_attestation","attest_author":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/action/author_attestation","sign_citation":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/action/citation_signature","submit_replication":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/action/replication_record"}},"created_at":"2026-05-18T02:24:06.830890+00:00","updated_at":"2026-05-18T02:24:06.830890+00:00"}