{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","short_pith_number":"pith:M3XJNLBJ","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"},"canonical_sha256":"66ee96ac29b7720b9923dc350ec6b96d62c1684a7f17152f16d35defffbbf302","source":{"kind":"arxiv","id":"1005.2642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2642","created_at":"2026-05-18T02:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2642v1","created_at":"2026-05-18T02:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2642","created_at":"2026-05-18T02:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"M3XJNLBJW5ZA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M3XJNLBJW5ZAXGJD","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M3XJNLBJ","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","target":"record","payload":{"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"},"canonical_sha256":"66ee96ac29b7720b9923dc350ec6b96d62c1684a7f17152f16d35defffbbf302","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"},"source_kind":"arxiv","source_id":"1005.2642","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-05-18T02:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oh9sP4N2RwqqXhe4AOxq7yE8K1si6OgVUl/R+XLU3cJnGBQvrEkJfeUwCUD5QNF5di3pIIeHxgJdW3wKBDqMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:53:26.104225Z"},"content_sha256":"d58d4f2a8a838fffa1d5340a7527c25061f82949974fa2e027285dd80c9f5731","schema_version":"1.0","event_id":"sha256:d58d4f2a8a838fffa1d5340a7527c25061f82949974fa2e027285dd80c9f5731"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","target":"graph","payload":{"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"},"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:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3p6saGZuGPkt+6BaS0aDTSBjmgZhMu0mckk3PU/8TkByBUhuoWxtk4hhfJzggPnxvuUs+LlI623FqEtMKFJnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:53:26.104613Z"},"content_sha256":"d3c39b90cae17dea58baa182143ac4a3296d17ad449ea6d0e2692b8a917b0b95","schema_version":"1.0","event_id":"sha256:d3c39b90cae17dea58baa182143ac4a3296d17ad449ea6d0e2692b8a917b0b95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/bundle.json","state_url":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/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-03T02:53:26Z","links":{"resolver":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","bundle":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/bundle.json","state":"https://pith.science/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3XJNLBJW5ZAXGJD3Q2Q5RVZNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:M3XJNLBJW5ZAXGJD3Q2Q5RVZNV","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":"5cef540b2e2418baf00af822e940f23c21b1b8990a6d0c05855b72b744a35547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-05-15T00:23:45Z","title_canon_sha256":"79078d9f84da5c6dd9d4df865283cb83023eec7aa0cecaed64a622d76881c854"},"schema_version":"1.0","source":{"id":"1005.2642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2642","created_at":"2026-05-18T02:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2642v1","created_at":"2026-05-18T02:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2642","created_at":"2026-05-18T02:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"M3XJNLBJW5ZA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M3XJNLBJW5ZAXGJD","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M3XJNLBJ","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:d3c39b90cae17dea58baa182143ac4a3296d17ad449ea6d0e2692b8a917b0b95","target":"graph","created_at":"2026-05-18T02:24:06Z","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 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","authors_text":"Dustin Wehr, Mark Braverman, Pierre McKenzie, Rahul Santhanam, Stephen Cook","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-05-15T00:23:45Z","title":"Pebbles and Branching Programs for Tree Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2642","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:d58d4f2a8a838fffa1d5340a7527c25061f82949974fa2e027285dd80c9f5731","target":"record","created_at":"2026-05-18T02:24:06Z","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":"5cef540b2e2418baf00af822e940f23c21b1b8990a6d0c05855b72b744a35547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-05-15T00:23:45Z","title_canon_sha256":"79078d9f84da5c6dd9d4df865283cb83023eec7aa0cecaed64a622d76881c854"},"schema_version":"1.0","source":{"id":"1005.2642","kind":"arxiv","version":1}},"canonical_sha256":"66ee96ac29b7720b9923dc350ec6b96d62c1684a7f17152f16d35defffbbf302","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66ee96ac29b7720b9923dc350ec6b96d62c1684a7f17152f16d35defffbbf302","first_computed_at":"2026-05-18T02:24:06.830778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:06.830778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dpYcN1uvhMmkeKnEmWPkEYsZ45lByNyR18tDXsBlaZJ9wOpWPbO6yqll5tV/MK3Ff5njPcApwkT9vAOo2QuoAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:06.831478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d58d4f2a8a838fffa1d5340a7527c25061f82949974fa2e027285dd80c9f5731","sha256:d3c39b90cae17dea58baa182143ac4a3296d17ad449ea6d0e2692b8a917b0b95"],"state_sha256":"13fcca1c5b9eb4e18fe1c8609a2df09b3572eea6648377392b19e7b5755ae2d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkw/Xy4PbiAwJU/XMvtYtJm1xW4NqPIUy87hhZGOdgUBGGnYhSpET+PWCo3+38DqwsgDQ4kch/Sn+pBd+jIXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:53:26.106695Z","bundle_sha256":"4f69dcc39b95ba042a21f64ec9c88003b31da6fa1368c4ef823178a53416f57a"}}