{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:63SCMYFQJQXOOCRHCMPDB3JEQI","short_pith_number":"pith:63SCMYFQ","canonical_record":{"source":{"id":"1004.0105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-01T10:43:05Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"82fe2ca105d38d34e5f7a40d85d74cfc1727b9362af5d54fe5e90ac9ff4dace6","abstract_canon_sha256":"0b3bbd3f3683c7193efb06f7d2bf0ce4d7229daec10aba1a1dbc09828483ffbd"},"schema_version":"1.0"},"canonical_sha256":"f6e42660b04c2ee70a27131e30ed2482276af25f8e6a924a087e88bf596d4d19","source":{"kind":"arxiv","id":"1004.0105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0105","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0105v1","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0105","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"63SCMYFQJQXO","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"63SCMYFQJQXOOCRH","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"63SCMYFQ","created_at":"2026-07-04T17:24:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:63SCMYFQJQXOOCRHCMPDB3JEQI","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-01T10:43:05Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"82fe2ca105d38d34e5f7a40d85d74cfc1727b9362af5d54fe5e90ac9ff4dace6","abstract_canon_sha256":"0b3bbd3f3683c7193efb06f7d2bf0ce4d7229daec10aba1a1dbc09828483ffbd"},"schema_version":"1.0"},"canonical_sha256":"f6e42660b04c2ee70a27131e30ed2482276af25f8e6a924a087e88bf596d4d19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:24:31.526541Z","signature_b64":"mT3tePQy9knWTrQQZV9fsGa+LRlPZjAfcfRqXrSSVjk9KIvP/dPLOwSHuvmkGDA7UWefDhKJZ+X03E734IeZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6e42660b04c2ee70a27131e30ed2482276af25f8e6a924a087e88bf596d4d19","last_reissued_at":"2026-07-04T17:24:31.526193Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:24:31.526193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0105","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-07-04T17:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHQq6DTC1gn5dSPHYtrAfvj+Uh12+x2okInyd3qBhlZVOlUNgPSKFgvhavs0i1KQMV2bIbvpN8eJakLtbPZxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:48:58.177848Z"},"content_sha256":"a237ebbd0422d947f9780089908bfbfa76ae39c83815d740c1813f8b0e3c1978","schema_version":"1.0","event_id":"sha256:a237ebbd0422d947f9780089908bfbfa76ae39c83815d740c1813f8b0e3c1978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:63SCMYFQJQXOOCRHCMPDB3JEQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Hartmut Klauck, Miklos Santha, Rahul Jain","submitted_at":"2010-04-01T10:43:05Z","abstract_excerpt":"A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1004.0105/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcSj2aIfqT84A050ELMUQkoSAWcEW+/Sn95kN9E6SwJj2Pt6XZTWVD0Gy6ZZ5W0oD1OHNQQjpxhN5QpGTTHDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:48:58.178364Z"},"content_sha256":"075ef10a7ce11c636146072ca7f354f8b4eda9b8611428e4af837ac23b0d70d4","schema_version":"1.0","event_id":"sha256:075ef10a7ce11c636146072ca7f354f8b4eda9b8611428e4af837ac23b0d70d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63SCMYFQJQXOOCRHCMPDB3JEQI/bundle.json","state_url":"https://pith.science/pith/63SCMYFQJQXOOCRHCMPDB3JEQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63SCMYFQJQXOOCRHCMPDB3JEQI/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-12T19:48:58Z","links":{"resolver":"https://pith.science/pith/63SCMYFQJQXOOCRHCMPDB3JEQI","bundle":"https://pith.science/pith/63SCMYFQJQXOOCRHCMPDB3JEQI/bundle.json","state":"https://pith.science/pith/63SCMYFQJQXOOCRHCMPDB3JEQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63SCMYFQJQXOOCRHCMPDB3JEQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:63SCMYFQJQXOOCRHCMPDB3JEQI","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":"0b3bbd3f3683c7193efb06f7d2bf0ce4d7229daec10aba1a1dbc09828483ffbd","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-01T10:43:05Z","title_canon_sha256":"82fe2ca105d38d34e5f7a40d85d74cfc1727b9362af5d54fe5e90ac9ff4dace6"},"schema_version":"1.0","source":{"id":"1004.0105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0105","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0105v1","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0105","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"63SCMYFQJQXO","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"63SCMYFQJQXOOCRH","created_at":"2026-07-04T17:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"63SCMYFQ","created_at":"2026-07-04T17:24:31Z"}],"graph_snapshots":[{"event_id":"sha256:075ef10a7ce11c636146072ca7f354f8b4eda9b8611428e4af837ac23b0d70d4","target":"graph","created_at":"2026-07-04T17:24:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1004.0105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.","authors_text":"Hartmut Klauck, Miklos Santha, Rahul Jain","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-01T10:43:05Z","title":"Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0105","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:a237ebbd0422d947f9780089908bfbfa76ae39c83815d740c1813f8b0e3c1978","target":"record","created_at":"2026-07-04T17:24:31Z","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":"0b3bbd3f3683c7193efb06f7d2bf0ce4d7229daec10aba1a1dbc09828483ffbd","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-01T10:43:05Z","title_canon_sha256":"82fe2ca105d38d34e5f7a40d85d74cfc1727b9362af5d54fe5e90ac9ff4dace6"},"schema_version":"1.0","source":{"id":"1004.0105","kind":"arxiv","version":1}},"canonical_sha256":"f6e42660b04c2ee70a27131e30ed2482276af25f8e6a924a087e88bf596d4d19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6e42660b04c2ee70a27131e30ed2482276af25f8e6a924a087e88bf596d4d19","first_computed_at":"2026-07-04T17:24:31.526193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:24:31.526193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mT3tePQy9knWTrQQZV9fsGa+LRlPZjAfcfRqXrSSVjk9KIvP/dPLOwSHuvmkGDA7UWefDhKJZ+X03E734IeZCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:24:31.526541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a237ebbd0422d947f9780089908bfbfa76ae39c83815d740c1813f8b0e3c1978","sha256:075ef10a7ce11c636146072ca7f354f8b4eda9b8611428e4af837ac23b0d70d4"],"state_sha256":"1039fd14549acb6cd0794b3e529ce02d0b20b3ebe7aa60a83da0f273b185b70d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQ4yHgXMWaqVOvlpDVvD120ioiszsTmRmWnXN15psykwXR0mCg9q3dS0e7mc3PvqYwB7M2wAHOirlobb5scsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T19:48:58.183091Z","bundle_sha256":"e0833e603272311e438b182d4613bfc33979c8fd3a911156ad9b215b91fcdf28"}}