{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:G722AYREDQVMY7YFGMIVRTDZ3Y","short_pith_number":"pith:G722AYRE","schema_version":"1.0","canonical_sha256":"37f5a062241c2acc7f05331158cc79de2f8bbab2260691f97a8ba479293352ba","source":{"kind":"arxiv","id":"1101.3627","version":1},"attestation_state":"computed","paper":{"title":"On the connection between correlation-immune functions and perfect 2-colorings of the Boolean n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir N. Potapov","submitted_at":"2011-01-19T07:03:25Z","abstract_excerpt":"A coloring of the Boolean $n$-cube is called perfect if, for every vertex $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean function is called correlation-immune of degree $n-m$ if it takes the value 1 the same number of times for each $m$-face of the Boolean $n$-cube. In the present paper it is proven that each Boolean function $\\chi^S$ ($S\\subset E^n$) satisfies the inequality $${\\rm nei}(S)+ 2({\\rm cor}(S)+1)(1-\\rho(S))\\leq n,$$ where ${\\rm cor}(S)$ is the maximum degree of the correlation immunity of $\\chi^S$, ${\\rm nei} (S)= \\frac{1}{|S|"},"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":"1101.3627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-19T07:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"362b4cd65b35f41cb02afb2f1b1bc77bb0c1bd8a59e6d02da9562694d258c656","abstract_canon_sha256":"54e32cca9fab3f2ea986497a305f39ee2a445cbc62927a409337a28cc4425d84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:21.859214Z","signature_b64":"WE7/bfCR5MjFsjxdKRRFOL0umwvagioFa7k1lKe/DS4Ceb9KhELR8yKUXlSoDqrv3JlRPYV8WmxQJW38rUuLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f5a062241c2acc7f05331158cc79de2f8bbab2260691f97a8ba479293352ba","last_reissued_at":"2026-05-18T04:31:21.858774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:21.858774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the connection between correlation-immune functions and perfect 2-colorings of the Boolean n-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladimir N. Potapov","submitted_at":"2011-01-19T07:03:25Z","abstract_excerpt":"A coloring of the Boolean $n$-cube is called perfect if, for every vertex $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean function is called correlation-immune of degree $n-m$ if it takes the value 1 the same number of times for each $m$-face of the Boolean $n$-cube. In the present paper it is proven that each Boolean function $\\chi^S$ ($S\\subset E^n$) satisfies the inequality $${\\rm nei}(S)+ 2({\\rm cor}(S)+1)(1-\\rho(S))\\leq n,$$ where ${\\rm cor}(S)$ is the maximum degree of the correlation immunity of $\\chi^S$, ${\\rm nei} (S)= \\frac{1}{|S|"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3627","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.3627","created_at":"2026-05-18T04:31:21.858835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3627v1","created_at":"2026-05-18T04:31:21.858835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3627","created_at":"2026-05-18T04:31:21.858835+00:00"},{"alias_kind":"pith_short_12","alias_value":"G722AYREDQVM","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"G722AYREDQVMY7YF","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"G722AYRE","created_at":"2026-05-18T12:26:28.662955+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/G722AYREDQVMY7YFGMIVRTDZ3Y","json":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y.json","graph_json":"https://pith.science/api/pith-number/G722AYREDQVMY7YFGMIVRTDZ3Y/graph.json","events_json":"https://pith.science/api/pith-number/G722AYREDQVMY7YFGMIVRTDZ3Y/events.json","paper":"https://pith.science/paper/G722AYRE"},"agent_actions":{"view_html":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y","download_json":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y.json","view_paper":"https://pith.science/paper/G722AYRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3627&json=true","fetch_graph":"https://pith.science/api/pith-number/G722AYREDQVMY7YFGMIVRTDZ3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/G722AYREDQVMY7YFGMIVRTDZ3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y/action/storage_attestation","attest_author":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y/action/author_attestation","sign_citation":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y/action/citation_signature","submit_replication":"https://pith.science/pith/G722AYREDQVMY7YFGMIVRTDZ3Y/action/replication_record"}},"created_at":"2026-05-18T04:31:21.858835+00:00","updated_at":"2026-05-18T04:31:21.858835+00:00"}