{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5VA5HSPNOGTLVQAQMCG4PE6EIM","short_pith_number":"pith:5VA5HSPN","canonical_record":{"source":{"id":"2412.06552","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-09T15:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"9619b3408825f51ce4e9f819a3a7b61a8be88f8f9876e9a7bf1c5cbcc983a63a","abstract_canon_sha256":"d1f22b3d3b3ee4e2abc6f3fb073236eae8b291ecb6c30b339b222b22faf87c3f"},"schema_version":"1.0"},"canonical_sha256":"ed41d3c9ed71a6bac010608dc793c443397bf77ebd8be51610677ec46c8c06d1","source":{"kind":"arxiv","id":"2412.06552","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06552","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06552v2","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06552","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"5VA5HSPNOGTL","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"5VA5HSPNOGTLVQAQ","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"5VA5HSPN","created_at":"2026-07-05T11:13:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5VA5HSPNOGTLVQAQMCG4PE6EIM","target":"record","payload":{"canonical_record":{"source":{"id":"2412.06552","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-09T15:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"9619b3408825f51ce4e9f819a3a7b61a8be88f8f9876e9a7bf1c5cbcc983a63a","abstract_canon_sha256":"d1f22b3d3b3ee4e2abc6f3fb073236eae8b291ecb6c30b339b222b22faf87c3f"},"schema_version":"1.0"},"canonical_sha256":"ed41d3c9ed71a6bac010608dc793c443397bf77ebd8be51610677ec46c8c06d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:16.628490Z","signature_b64":"lEQsTavY2u5bBMsTYNUS1by5dnVCiyJu8dMKbp/qERE+q5O1PO06Oj3CndoRF8+4H7wAwX0eHB2Z397jZseaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed41d3c9ed71a6bac010608dc793c443397bf77ebd8be51610677ec46c8c06d1","last_reissued_at":"2026-07-05T11:13:16.627954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:16.627954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.06552","source_version":2,"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-05T11:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7h/C4BPzxc3ZyeYqx0vExh84KA2zwm5co3kVjnj9vI7DGkXT5rnOM87kfYvKcD0BxEdSyXZyACKhfYQ2szGcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:58:49.966490Z"},"content_sha256":"7f2ea44a7bb242ed0a01a0368976aa77ea34fd9410aaecff474570889f784b32","schema_version":"1.0","event_id":"sha256:7f2ea44a7bb242ed0a01a0368976aa77ea34fd9410aaecff474570889f784b32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5VA5HSPNOGTLVQAQMCG4PE6EIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Direct Sums for Parity Decision Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gilbert Maystre, Mika G\\\"o\\\"os, Siyao Guo, Tyler Besselman, Weiqiang Yuan","submitted_at":"2024-12-09T15:01:46Z","abstract_excerpt":"Direct sum theorems state that the cost of solving $k$ instances of a problem is at least $\\Omega(k)$ times the cost of solving a single instance. We prove the first such results in the randomised parity decision tree model. We show that a direct sum theorem holds whenever (1) the lower bound for parity decision trees is proved using the discrepancy method; or (2) the lower bound is proved relative to a product distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06552","kind":"arxiv","version":2},"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/2412.06552/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-05T11:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DifahO39RBCJZ3VUVR1BQA8xS27OaH/w9m6eEhXQlrKTt0cmErGRuQSva46SJ0OdriIO+2SQKGGQsqY1sXZyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T21:58:49.966975Z"},"content_sha256":"d7dd26a04a984a943085ade7bc2fef843d00b3ac301e7f4bbee534e7a2d1a5e4","schema_version":"1.0","event_id":"sha256:d7dd26a04a984a943085ade7bc2fef843d00b3ac301e7f4bbee534e7a2d1a5e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/bundle.json","state_url":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/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-20T21:58:49Z","links":{"resolver":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM","bundle":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/bundle.json","state":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5VA5HSPNOGTLVQAQMCG4PE6EIM","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":"d1f22b3d3b3ee4e2abc6f3fb073236eae8b291ecb6c30b339b222b22faf87c3f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-09T15:01:46Z","title_canon_sha256":"9619b3408825f51ce4e9f819a3a7b61a8be88f8f9876e9a7bf1c5cbcc983a63a"},"schema_version":"1.0","source":{"id":"2412.06552","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06552","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06552v2","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06552","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"5VA5HSPNOGTL","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"5VA5HSPNOGTLVQAQ","created_at":"2026-07-05T11:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"5VA5HSPN","created_at":"2026-07-05T11:13:16Z"}],"graph_snapshots":[{"event_id":"sha256:d7dd26a04a984a943085ade7bc2fef843d00b3ac301e7f4bbee534e7a2d1a5e4","target":"graph","created_at":"2026-07-05T11:13:16Z","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/2412.06552/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Direct sum theorems state that the cost of solving $k$ instances of a problem is at least $\\Omega(k)$ times the cost of solving a single instance. We prove the first such results in the randomised parity decision tree model. We show that a direct sum theorem holds whenever (1) the lower bound for parity decision trees is proved using the discrepancy method; or (2) the lower bound is proved relative to a product distribution.","authors_text":"Gilbert Maystre, Mika G\\\"o\\\"os, Siyao Guo, Tyler Besselman, Weiqiang Yuan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06552","kind":"arxiv","version":2},"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:7f2ea44a7bb242ed0a01a0368976aa77ea34fd9410aaecff474570889f784b32","target":"record","created_at":"2026-07-05T11:13:16Z","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":"d1f22b3d3b3ee4e2abc6f3fb073236eae8b291ecb6c30b339b222b22faf87c3f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-12-09T15:01:46Z","title_canon_sha256":"9619b3408825f51ce4e9f819a3a7b61a8be88f8f9876e9a7bf1c5cbcc983a63a"},"schema_version":"1.0","source":{"id":"2412.06552","kind":"arxiv","version":2}},"canonical_sha256":"ed41d3c9ed71a6bac010608dc793c443397bf77ebd8be51610677ec46c8c06d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed41d3c9ed71a6bac010608dc793c443397bf77ebd8be51610677ec46c8c06d1","first_computed_at":"2026-07-05T11:13:16.627954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:16.627954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lEQsTavY2u5bBMsTYNUS1by5dnVCiyJu8dMKbp/qERE+q5O1PO06Oj3CndoRF8+4H7wAwX0eHB2Z397jZseaDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:16.628490Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.06552","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f2ea44a7bb242ed0a01a0368976aa77ea34fd9410aaecff474570889f784b32","sha256:d7dd26a04a984a943085ade7bc2fef843d00b3ac301e7f4bbee534e7a2d1a5e4"],"state_sha256":"550d17ad5c006326eb693b300284714cdeeaae9af0785d60e369f6d95725085b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWMkXIiWm3ruAbfVpXUFQNqO1mkhhee+cOW632czWUx2gnfNq4oM2Fa5Ef9ugyIXy4UdxCfLICMyDW+j0xopCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T21:58:49.971043Z","bundle_sha256":"3fa9e0b2e5683db9ff4553a4cd74a662a4151ff84209a31b406dd5c5c33dc004"}}