{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LWFGJC6HU6SAB2RM2XR3AJZ4AE","short_pith_number":"pith:LWFGJC6H","schema_version":"1.0","canonical_sha256":"5d8a648bc7a7a400ea2cd5e3b0273c0108bc3556f6b3c2e63e823e6b1c18d2ce","source":{"kind":"arxiv","id":"1712.05735","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.05735","created_at":"2026-05-17T23:54:26.540784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05735v2","created_at":"2026-05-17T23:54:26.540784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05735","created_at":"2026-05-17T23:54:26.540784+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWFGJC6HU6SA","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWFGJC6HU6SAB2RM","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWFGJC6H","created_at":"2026-05-18T12:31:28.150371+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/LWFGJC6HU6SAB2RM2XR3AJZ4AE","json":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE.json","graph_json":"https://pith.science/api/pith-number/LWFGJC6HU6SAB2RM2XR3AJZ4AE/graph.json","events_json":"https://pith.science/api/pith-number/LWFGJC6HU6SAB2RM2XR3AJZ4AE/events.json","paper":"https://pith.science/paper/LWFGJC6H"},"agent_actions":{"view_html":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE","download_json":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE.json","view_paper":"https://pith.science/paper/LWFGJC6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05735&json=true","fetch_graph":"https://pith.science/api/pith-number/LWFGJC6HU6SAB2RM2XR3AJZ4AE/graph.json","fetch_events":"https://pith.science/api/pith-number/LWFGJC6HU6SAB2RM2XR3AJZ4AE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/action/storage_attestation","attest_author":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/action/author_attestation","sign_citation":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/action/citation_signature","submit_replication":"https://pith.science/pith/LWFGJC6HU6SAB2RM2XR3AJZ4AE/action/replication_record"}},"created_at":"2026-05-17T23:54:26.540784+00:00","updated_at":"2026-05-17T23:54:26.540784+00:00"}