{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S3JP5ZBP7FRUVAM5KVAR4QJW2Y","short_pith_number":"pith:S3JP5ZBP","canonical_record":{"source":{"id":"1506.01055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-20T13:03:55Z","cross_cats_sorted":[],"title_canon_sha256":"fd92019d3497e5ee51b2a0afc9294454341250ae8133105428c4a81f624d1e07","abstract_canon_sha256":"f7cf3ae1d5f4dc78cb7958fc78136e3fe2c08c8d4ed9a3cb42a9fdd97ed38ffd"},"schema_version":"1.0"},"canonical_sha256":"96d2fee42ff9634a819d55411e4136d61195e4de81bee29cce278a1ec8a3142c","source":{"kind":"arxiv","id":"1506.01055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01055","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01055v1","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01055","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"S3JP5ZBP7FRU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S3JP5ZBP7FRUVAM5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S3JP5ZBP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S3JP5ZBP7FRUVAM5KVAR4QJW2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-20T13:03:55Z","cross_cats_sorted":[],"title_canon_sha256":"fd92019d3497e5ee51b2a0afc9294454341250ae8133105428c4a81f624d1e07","abstract_canon_sha256":"f7cf3ae1d5f4dc78cb7958fc78136e3fe2c08c8d4ed9a3cb42a9fdd97ed38ffd"},"schema_version":"1.0"},"canonical_sha256":"96d2fee42ff9634a819d55411e4136d61195e4de81bee29cce278a1ec8a3142c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:26.464663Z","signature_b64":"CDcOIztHvK2OpZ4guFSX14xAyQjKUMLXFd87Mm2cH7UUdMbfsQywgdREfIhFxiBHurlbP+pykrCzF3Mu8bb2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96d2fee42ff9634a819d55411e4136d61195e4de81bee29cce278a1ec8a3142c","last_reissued_at":"2026-05-18T01:58:26.464179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:26.464179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01055","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7TWBEddA3O/khJu6DxB4d5yFPopIr448qC0ktzRlIg6VBKA2mnaDRlOp8rA7rDu2v67DBGPGEDtrrUWdQO5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:53.248062Z"},"content_sha256":"cdd8e4b575d5daa972088496ef2d0ad928f973ea2ced854b02dd621c81ab0b3d","schema_version":"1.0","event_id":"sha256:cdd8e4b575d5daa972088496ef2d0ad928f973ea2ced854b02dd621c81ab0b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S3JP5ZBP7FRUVAM5KVAR4QJW2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inequality for the Fourier spectrum of parity decision trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andrew Wan, Eric Blais, Li-Yang Tan","submitted_at":"2015-05-20T13:03:55Z","abstract_excerpt":"We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'Donnell and Servedio for regular decision trees. We use this bound to obtain the first non-trivial lower bound on the parity decision tree complexity of the recursive majority function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01055","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-18T01:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76Iu6iFQXioUgwDveay0V5FkadIlXI2isbm/XKiVVjiUqBiS/Du4SoNKdK1TsmQSzABOHJRJbnGkYoaWmajyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:53.248506Z"},"content_sha256":"32c27fe0e353f6702fcb0808eaced8d39fca30676232e0cb6b59c03a28f3b548","schema_version":"1.0","event_id":"sha256:32c27fe0e353f6702fcb0808eaced8d39fca30676232e0cb6b59c03a28f3b548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y/bundle.json","state_url":"https://pith.science/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y/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-05-25T04:13:53Z","links":{"resolver":"https://pith.science/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y","bundle":"https://pith.science/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y/bundle.json","state":"https://pith.science/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3JP5ZBP7FRUVAM5KVAR4QJW2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S3JP5ZBP7FRUVAM5KVAR4QJW2Y","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":"f7cf3ae1d5f4dc78cb7958fc78136e3fe2c08c8d4ed9a3cb42a9fdd97ed38ffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-20T13:03:55Z","title_canon_sha256":"fd92019d3497e5ee51b2a0afc9294454341250ae8133105428c4a81f624d1e07"},"schema_version":"1.0","source":{"id":"1506.01055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01055","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01055v1","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01055","created_at":"2026-05-18T01:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"S3JP5ZBP7FRU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S3JP5ZBP7FRUVAM5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S3JP5ZBP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:32c27fe0e353f6702fcb0808eaced8d39fca30676232e0cb6b59c03a28f3b548","target":"graph","created_at":"2026-05-18T01:58:26Z","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 give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'Donnell and Servedio for regular decision trees. We use this bound to obtain the first non-trivial lower bound on the parity decision tree complexity of the recursive majority function.","authors_text":"Andrew Wan, Eric Blais, Li-Yang Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-20T13:03:55Z","title":"An inequality for the Fourier spectrum of parity decision trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01055","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:cdd8e4b575d5daa972088496ef2d0ad928f973ea2ced854b02dd621c81ab0b3d","target":"record","created_at":"2026-05-18T01:58:26Z","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":"f7cf3ae1d5f4dc78cb7958fc78136e3fe2c08c8d4ed9a3cb42a9fdd97ed38ffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-20T13:03:55Z","title_canon_sha256":"fd92019d3497e5ee51b2a0afc9294454341250ae8133105428c4a81f624d1e07"},"schema_version":"1.0","source":{"id":"1506.01055","kind":"arxiv","version":1}},"canonical_sha256":"96d2fee42ff9634a819d55411e4136d61195e4de81bee29cce278a1ec8a3142c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96d2fee42ff9634a819d55411e4136d61195e4de81bee29cce278a1ec8a3142c","first_computed_at":"2026-05-18T01:58:26.464179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:26.464179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CDcOIztHvK2OpZ4guFSX14xAyQjKUMLXFd87Mm2cH7UUdMbfsQywgdREfIhFxiBHurlbP+pykrCzF3Mu8bb2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:26.464663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdd8e4b575d5daa972088496ef2d0ad928f973ea2ced854b02dd621c81ab0b3d","sha256:32c27fe0e353f6702fcb0808eaced8d39fca30676232e0cb6b59c03a28f3b548"],"state_sha256":"38f15fa5c7c74f0c30bc8d3ea7f574dbe95e468ed83611542cfb4840a22704c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+DREeYLdAF74eDuzmHfFnyDbsDIPKYBKK9qNc22elYrWRdyuJxltVrKQx4VGc4uEMDSahqIhuKzAGoG47+fDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:13:53.252089Z","bundle_sha256":"3eb382c115640abe28646096308824f5a07df0a119656a7cfb0dde033a9614ea"}}