{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5VA5HSPNOGTLVQAQMCG4PE6EIM","short_pith_number":"pith:5VA5HSPN","schema_version":"1.0","canonical_sha256":"ed41d3c9ed71a6bac010608dc793c443397bf77ebd8be51610677ec46c8c06d1","source":{"kind":"arxiv","id":"2412.06552","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.06552","created_at":"2026-07-05T11:13:16.628016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06552v2","created_at":"2026-07-05T11:13:16.628016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06552","created_at":"2026-07-05T11:13:16.628016+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VA5HSPNOGTL","created_at":"2026-07-05T11:13:16.628016+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VA5HSPNOGTLVQAQ","created_at":"2026-07-05T11:13:16.628016+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VA5HSPN","created_at":"2026-07-05T11:13:16.628016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM","json":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM.json","graph_json":"https://pith.science/api/pith-number/5VA5HSPNOGTLVQAQMCG4PE6EIM/graph.json","events_json":"https://pith.science/api/pith-number/5VA5HSPNOGTLVQAQMCG4PE6EIM/events.json","paper":"https://pith.science/paper/5VA5HSPN"},"agent_actions":{"view_html":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM","download_json":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM.json","view_paper":"https://pith.science/paper/5VA5HSPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06552&json=true","fetch_graph":"https://pith.science/api/pith-number/5VA5HSPNOGTLVQAQMCG4PE6EIM/graph.json","fetch_events":"https://pith.science/api/pith-number/5VA5HSPNOGTLVQAQMCG4PE6EIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/action/storage_attestation","attest_author":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/action/author_attestation","sign_citation":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/action/citation_signature","submit_replication":"https://pith.science/pith/5VA5HSPNOGTLVQAQMCG4PE6EIM/action/replication_record"}},"created_at":"2026-07-05T11:13:16.628016+00:00","updated_at":"2026-07-05T11:13:16.628016+00:00"}