{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5YZSDXOYJK7KRWVVTKPQ7PBMZL","short_pith_number":"pith:5YZSDXOY","canonical_record":{"source":{"id":"1402.5078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-20T17:16:23Z","cross_cats_sorted":[],"title_canon_sha256":"a694ba5ec4a5b46c561ccac725930ae55de340cf58c8fa11ac738f6e2b38db69","abstract_canon_sha256":"267d8855cd8c67c26acc9e22f1d3d448305523ae201cbc29ed9ff69494cc0454"},"schema_version":"1.0"},"canonical_sha256":"ee3321ddd84abea8dab59a9f0fbc2ccaf36ff8863dd1800675757c6a32dacf9e","source":{"kind":"arxiv","id":"1402.5078","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5078","created_at":"2026-05-18T02:20:19Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5078v2","created_at":"2026-05-18T02:20:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5078","created_at":"2026-05-18T02:20:19Z"},{"alias_kind":"pith_short_12","alias_value":"5YZSDXOYJK7K","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5YZSDXOYJK7KRWVV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5YZSDXOY","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5YZSDXOYJK7KRWVVTKPQ7PBMZL","target":"record","payload":{"canonical_record":{"source":{"id":"1402.5078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-20T17:16:23Z","cross_cats_sorted":[],"title_canon_sha256":"a694ba5ec4a5b46c561ccac725930ae55de340cf58c8fa11ac738f6e2b38db69","abstract_canon_sha256":"267d8855cd8c67c26acc9e22f1d3d448305523ae201cbc29ed9ff69494cc0454"},"schema_version":"1.0"},"canonical_sha256":"ee3321ddd84abea8dab59a9f0fbc2ccaf36ff8863dd1800675757c6a32dacf9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:19.992283Z","signature_b64":"/RqSJcSlRD8q5s4opxculP7M+utE9xW3RxVzieTNU3u8iDPNOQ3nWJmGOkyDk/lApSA3A8hfTGRo5vfrtbkKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee3321ddd84abea8dab59a9f0fbc2ccaf36ff8863dd1800675757c6a32dacf9e","last_reissued_at":"2026-05-18T02:20:19.991800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:19.991800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.5078","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-05-18T02:20:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NjdwlLrPdjfA0HjniIp6WLu4rG+4iW48oV1ROT6igg4xV0o/iU4g5WltM59xfFkqvaKyw9eOHQLN0ytakuJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:23:58.075080Z"},"content_sha256":"b206b7032bcaf69acba43995283b462dc41a7f060066dc5ff7052264df2dcbaa","schema_version":"1.0","event_id":"sha256:b206b7032bcaf69acba43995283b462dc41a7f060066dc5ff7052264df2dcbaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5YZSDXOYJK7KRWVVTKPQ7PBMZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Kri\\v{s}j\\=anis Pr\\=usis","submitted_at":"2014-02-20T17:16:23Z","abstract_excerpt":"Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy, is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity.\n  Previously the best known lower bound was $C_1(f)\\geq \\frac{bs_0(f)}{2 s_0(f)}$, achieved by Kenyon and Kutin. We improve this to $C_1(f)\\geq \\frac{3 bs_0(f)}{2 s_0(f)}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5078","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":""},"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:20:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6xSbikr+O8EnV2sec1UCF9hJ+zlqMZTv6hvPFvBDcXNeQW/dHlDKWPnD6RlXwWfCoBhfIdcedkGULRXDdsTQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:23:58.075742Z"},"content_sha256":"20f377f267a88415f9b684c79ae50a641d7460401a769406fe9fe1688a4f2361","schema_version":"1.0","event_id":"sha256:20f377f267a88415f9b684c79ae50a641d7460401a769406fe9fe1688a4f2361"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL/bundle.json","state_url":"https://pith.science/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL/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-26T09:23:58Z","links":{"resolver":"https://pith.science/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL","bundle":"https://pith.science/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL/bundle.json","state":"https://pith.science/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YZSDXOYJK7KRWVVTKPQ7PBMZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5YZSDXOYJK7KRWVVTKPQ7PBMZL","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":"267d8855cd8c67c26acc9e22f1d3d448305523ae201cbc29ed9ff69494cc0454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-20T17:16:23Z","title_canon_sha256":"a694ba5ec4a5b46c561ccac725930ae55de340cf58c8fa11ac738f6e2b38db69"},"schema_version":"1.0","source":{"id":"1402.5078","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5078","created_at":"2026-05-18T02:20:19Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5078v2","created_at":"2026-05-18T02:20:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5078","created_at":"2026-05-18T02:20:19Z"},{"alias_kind":"pith_short_12","alias_value":"5YZSDXOYJK7K","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5YZSDXOYJK7KRWVV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5YZSDXOY","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:20f377f267a88415f9b684c79ae50a641d7460401a769406fe9fe1688a4f2361","target":"graph","created_at":"2026-05-18T02:20:19Z","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, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy, is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity.\n  Previously the best known lower bound was $C_1(f)\\geq \\frac{bs_0(f)}{2 s_0(f)}$, achieved by Kenyon and Kutin. We improve this to $C_1(f)\\geq \\frac{3 bs_0(f)}{2 s_0(f)}","authors_text":"Andris Ambainis, Kri\\v{s}j\\=anis Pr\\=usis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-20T17:16:23Z","title":"A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5078","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:b206b7032bcaf69acba43995283b462dc41a7f060066dc5ff7052264df2dcbaa","target":"record","created_at":"2026-05-18T02:20:19Z","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":"267d8855cd8c67c26acc9e22f1d3d448305523ae201cbc29ed9ff69494cc0454","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-20T17:16:23Z","title_canon_sha256":"a694ba5ec4a5b46c561ccac725930ae55de340cf58c8fa11ac738f6e2b38db69"},"schema_version":"1.0","source":{"id":"1402.5078","kind":"arxiv","version":2}},"canonical_sha256":"ee3321ddd84abea8dab59a9f0fbc2ccaf36ff8863dd1800675757c6a32dacf9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee3321ddd84abea8dab59a9f0fbc2ccaf36ff8863dd1800675757c6a32dacf9e","first_computed_at":"2026-05-18T02:20:19.991800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:19.991800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/RqSJcSlRD8q5s4opxculP7M+utE9xW3RxVzieTNU3u8iDPNOQ3nWJmGOkyDk/lApSA3A8hfTGRo5vfrtbkKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:19.992283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5078","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b206b7032bcaf69acba43995283b462dc41a7f060066dc5ff7052264df2dcbaa","sha256:20f377f267a88415f9b684c79ae50a641d7460401a769406fe9fe1688a4f2361"],"state_sha256":"a2f26404e1c16d3603b2b66dbd7c1feed37c036f04c5945ba1d29803edc97af3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcNgWA8inkMbIzFRfD3Z0kDCRwPwSPLizoVA1O3hBYmFQtiaUBVEBggST1wVPo0A3SGYnTBqTPmYMfjOn2T9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:23:58.079113Z","bundle_sha256":"883023afc733b7d50f7ac0df0fdc98f09f26b470f0e4332aa45046fd1331ccb9"}}