{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XUXKYNSKHMSS77R3CDY3KDNL5H","short_pith_number":"pith:XUXKYNSK","schema_version":"1.0","canonical_sha256":"bd2eac364a3b252ffe3b10f1b50dabe9ed5b1bd30e7c35e45427ecfd64335009","source":{"kind":"arxiv","id":"1801.04103","version":3},"attestation_state":"computed","paper":{"title":"Self-Predicting Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT","math.PR"],"primary_cat":"cs.DM","authors_text":"Nir Weinberger, Ofer Shayevitz","submitted_at":"2018-01-12T09:37:22Z","abstract_excerpt":"A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is obtained from $X^{n}$ by independently flipping each coordinate with probability $\\delta$. This paper is about self-predicting functions, which are those that coincide with their optimal predictor."},"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":"1801.04103","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-12T09:37:22Z","cross_cats_sorted":["cs.IT","math.CO","math.IT","math.PR"],"title_canon_sha256":"644acc4e938bebd2cfd1998e92f1448a4afdfd5d2af6ecdc2372209be8b745b3","abstract_canon_sha256":"3f393ffec972721014835f7b60a855f6b0499c5ddd1673f5054c4a433d057daa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:28.619363Z","signature_b64":"NQ0wmy9R5jdMzwDdw+vUIpqlUyJ/kMvqeuzjWzcoLhru9jV03VWSOFwPUN6LkU16IjL0CBUSlR/1qUAbT2srBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd2eac364a3b252ffe3b10f1b50dabe9ed5b1bd30e7c35e45427ecfd64335009","last_reissued_at":"2026-05-17T23:50:28.618749Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:28.618749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Predicting Boolean Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT","math.PR"],"primary_cat":"cs.DM","authors_text":"Nir Weinberger, Ofer Shayevitz","submitted_at":"2018-01-12T09:37:22Z","abstract_excerpt":"A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is obtained from $X^{n}$ by independently flipping each coordinate with probability $\\delta$. This paper is about self-predicting functions, which are those that coincide with their optimal predictor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04103","kind":"arxiv","version":3},"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":"1801.04103","created_at":"2026-05-17T23:50:28.618818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04103v3","created_at":"2026-05-17T23:50:28.618818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04103","created_at":"2026-05-17T23:50:28.618818+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUXKYNSKHMSS","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUXKYNSKHMSS77R3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUXKYNSK","created_at":"2026-05-18T12:33:01.666342+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/XUXKYNSKHMSS77R3CDY3KDNL5H","json":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H.json","graph_json":"https://pith.science/api/pith-number/XUXKYNSKHMSS77R3CDY3KDNL5H/graph.json","events_json":"https://pith.science/api/pith-number/XUXKYNSKHMSS77R3CDY3KDNL5H/events.json","paper":"https://pith.science/paper/XUXKYNSK"},"agent_actions":{"view_html":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H","download_json":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H.json","view_paper":"https://pith.science/paper/XUXKYNSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04103&json=true","fetch_graph":"https://pith.science/api/pith-number/XUXKYNSKHMSS77R3CDY3KDNL5H/graph.json","fetch_events":"https://pith.science/api/pith-number/XUXKYNSKHMSS77R3CDY3KDNL5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H/action/storage_attestation","attest_author":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H/action/author_attestation","sign_citation":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H/action/citation_signature","submit_replication":"https://pith.science/pith/XUXKYNSKHMSS77R3CDY3KDNL5H/action/replication_record"}},"created_at":"2026-05-17T23:50:28.618818+00:00","updated_at":"2026-05-17T23:50:28.618818+00:00"}