{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7B7VQXIJ5XGS5B6P65CRU3LTGF","short_pith_number":"pith:7B7VQXIJ","canonical_record":{"source":{"id":"1411.3419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-13T02:25:53Z","cross_cats_sorted":[],"title_canon_sha256":"e3221b6367015e1f814de3b517679ab13cfe5565a86e1e9f0d74c67172992daa","abstract_canon_sha256":"9988ab9bf39341740cef2b38e50d5486157417e8f5499e3149a2f05a9a9fb649"},"schema_version":"1.0"},"canonical_sha256":"f87f585d09edcd2e87cff7451a6d73314aaf5a7c7c20dbba68786a955e31dfc6","source":{"kind":"arxiv","id":"1411.3419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3419","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3419v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3419","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"7B7VQXIJ5XGS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7B7VQXIJ5XGS5B6P","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7B7VQXIJ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7B7VQXIJ5XGS5B6P65CRU3LTGF","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-13T02:25:53Z","cross_cats_sorted":[],"title_canon_sha256":"e3221b6367015e1f814de3b517679ab13cfe5565a86e1e9f0d74c67172992daa","abstract_canon_sha256":"9988ab9bf39341740cef2b38e50d5486157417e8f5499e3149a2f05a9a9fb649"},"schema_version":"1.0"},"canonical_sha256":"f87f585d09edcd2e87cff7451a6d73314aaf5a7c7c20dbba68786a955e31dfc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.824827Z","signature_b64":"JF5Aa++SWdJ14op1RlL3oQG0H2sNvt7tODsiP18zf07FuvCyoqwqDY18WA+iM35HRhirE5HggO0N7KYQJuPHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f87f585d09edcd2e87cff7451a6d73314aaf5a7c7c20dbba68786a955e31dfc6","last_reissued_at":"2026-05-18T02:37:43.824346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.824346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3419","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFbXxcRZcu5kUMmAvRS8+1VWhMFxD2JeTSSiEoS+gS8TSUu3Tc03TCLdztdQu03xXo0hzs9zceAghfOu4AYcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:46:30.407723Z"},"content_sha256":"22a2d37fceeb738724c74f11d40acf382e3f339e352908eb3806a3f6f38edeb4","schema_version":"1.0","event_id":"sha256:22a2d37fceeb738724c74f11d40acf382e3f339e352908eb3806a3f6f38edeb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7B7VQXIJ5XGS5B6P65CRU3LTGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tighter Relations Between Sensitivity and Other Complexity Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Jieming Mao, Mohammad Bavarian, Song Zuo, Xiaoming Sun, Yihan Gao","submitted_at":"2014-11-13T02:25:53Z","abstract_excerpt":"Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is polynomially related to other major complexity measures. Despite much attention to the problem and major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004.\n  In this work, we present new upper bounds for various complexity measures"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3419","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJZAMqU6o+iqTSybFCzw374yrTbSZYq3IH3SiSKBn26+9rJrTafxMjMnPr4XEHP+i8zxLykxCWSgOpTDx9BJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:46:30.408071Z"},"content_sha256":"94573e3d31bcf403c40f5d2e308bf4f6c1dbbd46b0a438621c9891b2dd0664cb","schema_version":"1.0","event_id":"sha256:94573e3d31bcf403c40f5d2e308bf4f6c1dbbd46b0a438621c9891b2dd0664cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF/bundle.json","state_url":"https://pith.science/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF/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-25T23:46:30Z","links":{"resolver":"https://pith.science/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF","bundle":"https://pith.science/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF/bundle.json","state":"https://pith.science/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7B7VQXIJ5XGS5B6P65CRU3LTGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7B7VQXIJ5XGS5B6P65CRU3LTGF","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":"9988ab9bf39341740cef2b38e50d5486157417e8f5499e3149a2f05a9a9fb649","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-13T02:25:53Z","title_canon_sha256":"e3221b6367015e1f814de3b517679ab13cfe5565a86e1e9f0d74c67172992daa"},"schema_version":"1.0","source":{"id":"1411.3419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3419","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3419v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3419","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"7B7VQXIJ5XGS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7B7VQXIJ5XGS5B6P","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7B7VQXIJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:94573e3d31bcf403c40f5d2e308bf4f6c1dbbd46b0a438621c9891b2dd0664cb","target":"graph","created_at":"2026-05-18T02:37:43Z","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":"Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is polynomially related to other major complexity measures. Despite much attention to the problem and major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004.\n  In this work, we present new upper bounds for various complexity measures","authors_text":"Andris Ambainis, Jieming Mao, Mohammad Bavarian, Song Zuo, Xiaoming Sun, Yihan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-13T02:25:53Z","title":"Tighter Relations Between Sensitivity and Other Complexity Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3419","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:22a2d37fceeb738724c74f11d40acf382e3f339e352908eb3806a3f6f38edeb4","target":"record","created_at":"2026-05-18T02:37:43Z","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":"9988ab9bf39341740cef2b38e50d5486157417e8f5499e3149a2f05a9a9fb649","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-13T02:25:53Z","title_canon_sha256":"e3221b6367015e1f814de3b517679ab13cfe5565a86e1e9f0d74c67172992daa"},"schema_version":"1.0","source":{"id":"1411.3419","kind":"arxiv","version":1}},"canonical_sha256":"f87f585d09edcd2e87cff7451a6d73314aaf5a7c7c20dbba68786a955e31dfc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f87f585d09edcd2e87cff7451a6d73314aaf5a7c7c20dbba68786a955e31dfc6","first_computed_at":"2026-05-18T02:37:43.824346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.824346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JF5Aa++SWdJ14op1RlL3oQG0H2sNvt7tODsiP18zf07FuvCyoqwqDY18WA+iM35HRhirE5HggO0N7KYQJuPHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.824827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22a2d37fceeb738724c74f11d40acf382e3f339e352908eb3806a3f6f38edeb4","sha256:94573e3d31bcf403c40f5d2e308bf4f6c1dbbd46b0a438621c9891b2dd0664cb"],"state_sha256":"f5bc2b4d2c44ffe523f4fba102e8e4c2393c525176f9da7ac5c87070b3fa1ac0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSMYss/mFOFVAAnqu/Tv6mEEk8kwAt6g/GVK91jY1R6Sos+oPpxsM8W7zVwEbUVb6dmfJ+zSwe3yLxLk6fdtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:46:30.410496Z","bundle_sha256":"a9e934f6b3349de66322b425cc4136c690bf3134c0b80e3cd9e505cedf262238"}}