{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BENZHDIAW5DCAA46KJQEM7WFTK","short_pith_number":"pith:BENZHDIA","canonical_record":{"source":{"id":"1302.4207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-18T10:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"ecae32097f7ad56ef6ddd0e11207de00bd09d39349ce5655fdb39e3808ea0631","abstract_canon_sha256":"3ec88673c714929bc8e72e6fb2566655490802f9fed0feffbc553fc7530455a9"},"schema_version":"1.0"},"canonical_sha256":"091b938d00b74620039e5260467ec59aa0ab6828a33fa73988efb6a3204eb4bd","source":{"kind":"arxiv","id":"1302.4207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4207","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4207v1","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4207","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"BENZHDIAW5DC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BENZHDIAW5DCAA46","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BENZHDIA","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BENZHDIAW5DCAA46KJQEM7WFTK","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-18T10:12:29Z","cross_cats_sorted":[],"title_canon_sha256":"ecae32097f7ad56ef6ddd0e11207de00bd09d39349ce5655fdb39e3808ea0631","abstract_canon_sha256":"3ec88673c714929bc8e72e6fb2566655490802f9fed0feffbc553fc7530455a9"},"schema_version":"1.0"},"canonical_sha256":"091b938d00b74620039e5260467ec59aa0ab6828a33fa73988efb6a3204eb4bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.745559Z","signature_b64":"n3m3VepRKH7f3iHgGMAUVOooAFuikI7CFmDXZVlqUVXBB8vtiB9JKNH+xqngK1FNtkHyNKPnBBC+AShG0v7sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"091b938d00b74620039e5260467ec59aa0ab6828a33fa73988efb6a3204eb4bd","last_reissued_at":"2026-05-18T03:33:23.744916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.744916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4207","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-18T03:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqGPh/kP74vKRAv/KUGO17HNGNp8aniRRh8X3X6Zdiv6PO1YD/pTY7HkAaBBTwinHpX/m7HsVovd9a8uxFFXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:16:35.611013Z"},"content_sha256":"3e57ae7a110e33feb7e7966c313b859f30c4c8425f844668ca2910ce64135d16","schema_version":"1.0","event_id":"sha256:3e57ae7a110e33feb7e7966c313b859f30c4c8425f844668ca2910ce64135d16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BENZHDIAW5DCAA46KJQEM7WFTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A composition theorem for decision tree complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ashley Montanaro","submitted_at":"2013-02-18T10:12:29Z","abstract_excerpt":"We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4207","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-18T03:33:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4AC0ZsbI90D/JcxccWQ7PwfhoXsHLgfiSitF/tM8xu1v8fsniidRt+htFhxjV4WLYXjsFxzIX7XKOiAm37gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:16:35.611461Z"},"content_sha256":"a3db986b88720431e59118938e45170213b20eff66c5750e10664456d4a18a1f","schema_version":"1.0","event_id":"sha256:a3db986b88720431e59118938e45170213b20eff66c5750e10664456d4a18a1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/bundle.json","state_url":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BENZHDIAW5DCAA46KJQEM7WFTK/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-08T17:16:35Z","links":{"resolver":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK","bundle":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/bundle.json","state":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BENZHDIAW5DCAA46KJQEM7WFTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BENZHDIAW5DCAA46KJQEM7WFTK","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":"3ec88673c714929bc8e72e6fb2566655490802f9fed0feffbc553fc7530455a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-18T10:12:29Z","title_canon_sha256":"ecae32097f7ad56ef6ddd0e11207de00bd09d39349ce5655fdb39e3808ea0631"},"schema_version":"1.0","source":{"id":"1302.4207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4207","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4207v1","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4207","created_at":"2026-05-18T03:33:23Z"},{"alias_kind":"pith_short_12","alias_value":"BENZHDIAW5DC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BENZHDIAW5DCAA46","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BENZHDIA","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:a3db986b88720431e59118938e45170213b20eff66c5750e10664456d4a18a1f","target":"graph","created_at":"2026-05-18T03:33:23Z","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 completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.","authors_text":"Ashley Montanaro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-18T10:12:29Z","title":"A composition theorem for decision tree complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4207","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:3e57ae7a110e33feb7e7966c313b859f30c4c8425f844668ca2910ce64135d16","target":"record","created_at":"2026-05-18T03:33:23Z","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":"3ec88673c714929bc8e72e6fb2566655490802f9fed0feffbc553fc7530455a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-18T10:12:29Z","title_canon_sha256":"ecae32097f7ad56ef6ddd0e11207de00bd09d39349ce5655fdb39e3808ea0631"},"schema_version":"1.0","source":{"id":"1302.4207","kind":"arxiv","version":1}},"canonical_sha256":"091b938d00b74620039e5260467ec59aa0ab6828a33fa73988efb6a3204eb4bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"091b938d00b74620039e5260467ec59aa0ab6828a33fa73988efb6a3204eb4bd","first_computed_at":"2026-05-18T03:33:23.744916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:23.744916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n3m3VepRKH7f3iHgGMAUVOooAFuikI7CFmDXZVlqUVXBB8vtiB9JKNH+xqngK1FNtkHyNKPnBBC+AShG0v7sBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:23.745559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e57ae7a110e33feb7e7966c313b859f30c4c8425f844668ca2910ce64135d16","sha256:a3db986b88720431e59118938e45170213b20eff66c5750e10664456d4a18a1f"],"state_sha256":"d06ecc921cb08cf28a98d4a83306f327c261e6aa54fb4d22fbbfa5d7722fa44e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"79l4PF4wXNdFHl6NexuN2d+bHna6T91zThosd14Svx70ZtWQKJz/NX19Y1+9hubfpE37skBRKJhNdvSvDvfODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:16:35.616605Z","bundle_sha256":"fc7f873a40cdc946c68cca36c06a81098b0e09c5c0500c9b8da9df01c5ac3e06"}}