{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NWMDHNZRMSKFW757OCXFT6NS4M","short_pith_number":"pith:NWMDHNZR","schema_version":"1.0","canonical_sha256":"6d9833b73164945b7fbf70ae59f9b2e3164ab84a668b15d33da5bbf91cedf668","source":{"kind":"arxiv","id":"1904.04867","version":1},"attestation_state":"computed","paper":{"title":"Black-Box Complexity of the Binary Value Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Maxim Buzdalov, Nina Bulanova","submitted_at":"2019-04-09T18:54:36Z","abstract_excerpt":"The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its unbiased black-box complexity was previously shown to be at most $\\lceil \\log_2 n \\rceil + 2$, where $n$ is the problem size. We augment it with an upper bound of $\\log_2 n + 2.42141558 - o(1)$, which is more precise for many values of $n$. We also present a lower bound of $\\log_2 n + 1.1186406 - o(1)$. Additionally, we prove that BinVal is an easiest function among all unimodal pseudo-Boolean functions at least for u"},"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":"1904.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-04-09T18:54:36Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a966c585e115848cfb447162328ee774e88262d1dac1ed80a03f04c695e0b269","abstract_canon_sha256":"fed905cdbc5fc556ed38906d8ee3037397e642ef4d5a41b2d51d90d513313317"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:57.774479Z","signature_b64":"lXYClPvUNY5IBE5MG8GFy2sQnMt5hQZ8Tq/ZN9ZvkR5oSB4uGoBV8bxmWNbZ1ElZaYVnSg+YSTGM9ZY5+MMYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d9833b73164945b7fbf70ae59f9b2e3164ab84a668b15d33da5bbf91cedf668","last_reissued_at":"2026-05-17T23:48:57.773948Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:57.773948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Black-Box Complexity of the Binary Value Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NE","authors_text":"Maxim Buzdalov, Nina Bulanova","submitted_at":"2019-04-09T18:54:36Z","abstract_excerpt":"The binary value function, or BinVal, has appeared in several studies in theory of evolutionary computation as one of the extreme examples of linear pseudo-Boolean functions. Its unbiased black-box complexity was previously shown to be at most $\\lceil \\log_2 n \\rceil + 2$, where $n$ is the problem size. We augment it with an upper bound of $\\log_2 n + 2.42141558 - o(1)$, which is more precise for many values of $n$. We also present a lower bound of $\\log_2 n + 1.1186406 - o(1)$. Additionally, we prove that BinVal is an easiest function among all unimodal pseudo-Boolean functions at least for u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04867","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":"1904.04867","created_at":"2026-05-17T23:48:57.774022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04867v1","created_at":"2026-05-17T23:48:57.774022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04867","created_at":"2026-05-17T23:48:57.774022+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWMDHNZRMSKF","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWMDHNZRMSKFW757","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWMDHNZR","created_at":"2026-05-18T12:33:24.271573+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/NWMDHNZRMSKFW757OCXFT6NS4M","json":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M.json","graph_json":"https://pith.science/api/pith-number/NWMDHNZRMSKFW757OCXFT6NS4M/graph.json","events_json":"https://pith.science/api/pith-number/NWMDHNZRMSKFW757OCXFT6NS4M/events.json","paper":"https://pith.science/paper/NWMDHNZR"},"agent_actions":{"view_html":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M","download_json":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M.json","view_paper":"https://pith.science/paper/NWMDHNZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04867&json=true","fetch_graph":"https://pith.science/api/pith-number/NWMDHNZRMSKFW757OCXFT6NS4M/graph.json","fetch_events":"https://pith.science/api/pith-number/NWMDHNZRMSKFW757OCXFT6NS4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M/action/storage_attestation","attest_author":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M/action/author_attestation","sign_citation":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M/action/citation_signature","submit_replication":"https://pith.science/pith/NWMDHNZRMSKFW757OCXFT6NS4M/action/replication_record"}},"created_at":"2026-05-17T23:48:57.774022+00:00","updated_at":"2026-05-17T23:48:57.774022+00:00"}