{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LWFGJC6HU6SAB2RM2XR3AJZ4AE","short_pith_number":"pith:LWFGJC6H","canonical_record":{"source":{"id":"1712.05735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-15T16:27:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"511f5e837ac41a9bc465a782d45e1b391b9e3ef753ce62631a8d7abb72fd1e88","abstract_canon_sha256":"68f584c411274b65e107309f6e46578bf23e11e6aebde8aad3cbd9dd2cbec62e"},"schema_version":"1.0"},"canonical_sha256":"5d8a648bc7a7a400ea2cd5e3b0273c0108bc3556f6b3c2e63e823e6b1c18d2ce","source":{"kind":"arxiv","id":"1712.05735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05735","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05735v2","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05735","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"LWFGJC6HU6SA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LWFGJC6HU6SAB2RM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LWFGJC6H","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LWFGJC6HU6SAB2RM2XR3AJZ4AE","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-15T16:27:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"511f5e837ac41a9bc465a782d45e1b391b9e3ef753ce62631a8d7abb72fd1e88","abstract_canon_sha256":"68f584c411274b65e107309f6e46578bf23e11e6aebde8aad3cbd9dd2cbec62e"},"schema_version":"1.0"},"canonical_sha256":"5d8a648bc7a7a400ea2cd5e3b0273c0108bc3556f6b3c2e63e823e6b1c18d2ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.541194Z","signature_b64":"x7SQMx2XU1o0lclhrWIBIuaGbdZlkyWePf4YNkvWEEJiinm0J4K8HcCAYXHqkicvbUshNvW0UiKVUi1hmKfcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d8a648bc7a7a400ea2cd5e3b0273c0108bc3556f6b3c2e63e823e6b1c18d2ce","last_reissued_at":"2026-05-17T23:54:26.540715Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.540715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05735","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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWbx3M3Amf0qvHVp+dxWfavADC/bU3enDsKl1vnx80TIyjw8sP6geLmfpSzoqCsPkMXx2KspbB6KpCCBHRMPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:57:01.741151Z"},"content_sha256":"4563e293a15ec6f395afbd52cd011f46921742d314d2a67042fb2fd1a8e2cd8a","schema_version":"1.0","event_id":"sha256:4563e293a15ec6f395afbd52cd011f46921742d314d2a67042fb2fd1a8e2cd8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LWFGJC6HU6SAB2RM2XR3AJZ4AE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh","submitted_at":"2017-12-15T16:27:26Z","abstract_excerpt":"$\\newcommand{\\sp}{\\mathsf{sparsity}}\\newcommand{\\s}{\\mathsf{s}}\\newcommand{\\al}{\\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of $f$ (denoted by $\\s(f)$). The XOR Log-Rank Conjecture states that for any $n$ bit Boolean function, $f$ the communication complexity of a related function $f^{\\oplus}$ on $2n$ bits, (defined as $f^{\\oplus}(x,y)=f(x\\oplus y)$) is at most polynomial in logarithm of the sparsity of $f$ (denoted by $\\sp(f)$). A recent result of Lin and Zhang (2017) implies that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05735","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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkhM+UJ1F3smOGvTK1ObvbfGI62a1a66TXLeXWxLX2C/YDNVltUxG4QV8VdQRGc4h2xGdpScR+g4u2QYfH1JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:57:01.741981Z"},"content_sha256":"38d1db5e8c9f3784ee1fd13099660bd9d5aab57b1533594640036a7965e88f39","schema_version":"1.0","event_id":"sha256:38d1db5e8c9f3784ee1fd13099660bd9d5aab57b1533594640036a7965e88f39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/bundle.json","state_url":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/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-23T08:57:01Z","links":{"resolver":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE","bundle":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/bundle.json","state":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LWFGJC6HU6SAB2RM2XR3AJZ4AE","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":"68f584c411274b65e107309f6e46578bf23e11e6aebde8aad3cbd9dd2cbec62e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-15T16:27:26Z","title_canon_sha256":"511f5e837ac41a9bc465a782d45e1b391b9e3ef753ce62631a8d7abb72fd1e88"},"schema_version":"1.0","source":{"id":"1712.05735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05735","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05735v2","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05735","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"LWFGJC6HU6SA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LWFGJC6HU6SAB2RM","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LWFGJC6H","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:38d1db5e8c9f3784ee1fd13099660bd9d5aab57b1533594640036a7965e88f39","target":"graph","created_at":"2026-05-17T23:54: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":"$\\newcommand{\\sp}{\\mathsf{sparsity}}\\newcommand{\\s}{\\mathsf{s}}\\newcommand{\\al}{\\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of $f$ (denoted by $\\s(f)$). The XOR Log-Rank Conjecture states that for any $n$ bit Boolean function, $f$ the communication complexity of a related function $f^{\\oplus}$ on $2n$ bits, (defined as $f^{\\oplus}(x,y)=f(x\\oplus y)$) is at most polynomial in logarithm of the sparsity of $f$ (denoted by $\\sp(f)$). A recent result of Lin and Zhang (2017) implies that ","authors_text":"Jayalal Sarma, Krishnamoorthy Dinesh","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-15T16:27:26Z","title":"Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05735","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:4563e293a15ec6f395afbd52cd011f46921742d314d2a67042fb2fd1a8e2cd8a","target":"record","created_at":"2026-05-17T23:54: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":"68f584c411274b65e107309f6e46578bf23e11e6aebde8aad3cbd9dd2cbec62e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-12-15T16:27:26Z","title_canon_sha256":"511f5e837ac41a9bc465a782d45e1b391b9e3ef753ce62631a8d7abb72fd1e88"},"schema_version":"1.0","source":{"id":"1712.05735","kind":"arxiv","version":2}},"canonical_sha256":"5d8a648bc7a7a400ea2cd5e3b0273c0108bc3556f6b3c2e63e823e6b1c18d2ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d8a648bc7a7a400ea2cd5e3b0273c0108bc3556f6b3c2e63e823e6b1c18d2ce","first_computed_at":"2026-05-17T23:54:26.540715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:26.540715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x7SQMx2XU1o0lclhrWIBIuaGbdZlkyWePf4YNkvWEEJiinm0J4K8HcCAYXHqkicvbUshNvW0UiKVUi1hmKfcDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:26.541194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4563e293a15ec6f395afbd52cd011f46921742d314d2a67042fb2fd1a8e2cd8a","sha256:38d1db5e8c9f3784ee1fd13099660bd9d5aab57b1533594640036a7965e88f39"],"state_sha256":"a015e0eee54a837faaf05a6dc0387dd2b0fc9f653e4301f5a4791f87bb05dff4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdllpJA4yRXWuhDdGA1n5+i05WsZ042whB5+DAy0slziqcefarZZut5DttNcFCD6Hp1bWjPktibhGOlFlOjYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:57:01.745654Z","bundle_sha256":"41ddee8bdbb1a502c63cdefa9d38b7747031cb0448b6916247b6586b62fda9f4"}}