{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BENZHDIAW5DCAA46KJQEM7WFTK","short_pith_number":"pith:BENZHDIA","schema_version":"1.0","canonical_sha256":"091b938d00b74620039e5260467ec59aa0ab6828a33fa73988efb6a3204eb4bd","source":{"kind":"arxiv","id":"1302.4207","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.4207","created_at":"2026-05-18T03:33:23.745009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4207v1","created_at":"2026-05-18T03:33:23.745009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4207","created_at":"2026-05-18T03:33:23.745009+00:00"},{"alias_kind":"pith_short_12","alias_value":"BENZHDIAW5DC","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BENZHDIAW5DCAA46","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BENZHDIA","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05187","citing_title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK","json":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK.json","graph_json":"https://pith.science/api/pith-number/BENZHDIAW5DCAA46KJQEM7WFTK/graph.json","events_json":"https://pith.science/api/pith-number/BENZHDIAW5DCAA46KJQEM7WFTK/events.json","paper":"https://pith.science/paper/BENZHDIA"},"agent_actions":{"view_html":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK","download_json":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK.json","view_paper":"https://pith.science/paper/BENZHDIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4207&json=true","fetch_graph":"https://pith.science/api/pith-number/BENZHDIAW5DCAA46KJQEM7WFTK/graph.json","fetch_events":"https://pith.science/api/pith-number/BENZHDIAW5DCAA46KJQEM7WFTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/action/storage_attestation","attest_author":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/action/author_attestation","sign_citation":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/action/citation_signature","submit_replication":"https://pith.science/pith/BENZHDIAW5DCAA46KJQEM7WFTK/action/replication_record"}},"created_at":"2026-05-18T03:33:23.745009+00:00","updated_at":"2026-05-18T03:33:23.745009+00:00"}