{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6S3FQZQIJK4ALJF6LNTV2AVJEC","short_pith_number":"pith:6S3FQZQI","schema_version":"1.0","canonical_sha256":"f4b65866084ab805a4be5b675d02a920aca515cae61fc10e862f9d95dfd654df","source":{"kind":"arxiv","id":"2006.03963","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial Black-Box Optimization with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hamid Dadkhahi, Jesus Rios, Karthikeyan Shanmugam, Payel Das, Samuel Hoffman, Subramanian Sankaranarayanan, Troy David Loeffler","submitted_at":"2020-06-06T20:26:19Z","abstract_excerpt":"We consider the problem of black-box function optimization over the boolean hypercube. Despite the vast literature on black-box function optimization over continuous domains, not much attention has been paid to learning models for optimization over combinatorial domains until recently. However, the computational complexity of the recently devised algorithms are prohibitive even for moderate numbers of variables; drawing one sample using the existing algorithms is more expensive than a function evaluation for many black-box functions of interest. To address this problem, we propose a computatio"},"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":"2006.03963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-06T20:26:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6fd65f23706936f39b2ee357bdce9162f86b6efd8db73f97e6a955cd46e94727","abstract_canon_sha256":"af7e8d2c7431ec74b6e34373d583975a97f335e77d2be2cc0ce10a8728cc538e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:54.697198Z","signature_b64":"F8ftd59rLxfW5izYWHrTdlvp1wz4g/2tf2d2jjGeqZINi+ecS+iGm4toqUQll042rGNxCoW2Id4SgTSUQFzkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4b65866084ab805a4be5b675d02a920aca515cae61fc10e862f9d95dfd654df","last_reissued_at":"2026-07-05T01:42:54.696779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:54.696779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Black-Box Optimization with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hamid Dadkhahi, Jesus Rios, Karthikeyan Shanmugam, Payel Das, Samuel Hoffman, Subramanian Sankaranarayanan, Troy David Loeffler","submitted_at":"2020-06-06T20:26:19Z","abstract_excerpt":"We consider the problem of black-box function optimization over the boolean hypercube. Despite the vast literature on black-box function optimization over continuous domains, not much attention has been paid to learning models for optimization over combinatorial domains until recently. However, the computational complexity of the recently devised algorithms are prohibitive even for moderate numbers of variables; drawing one sample using the existing algorithms is more expensive than a function evaluation for many black-box functions of interest. To address this problem, we propose a computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.03963","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.03963/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.03963","created_at":"2026-07-05T01:42:54.696833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.03963v2","created_at":"2026-07-05T01:42:54.696833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.03963","created_at":"2026-07-05T01:42:54.696833+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S3FQZQIJK4A","created_at":"2026-07-05T01:42:54.696833+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S3FQZQIJK4ALJF6","created_at":"2026-07-05T01:42:54.696833+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S3FQZQI","created_at":"2026-07-05T01:42:54.696833+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/6S3FQZQIJK4ALJF6LNTV2AVJEC","json":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC.json","graph_json":"https://pith.science/api/pith-number/6S3FQZQIJK4ALJF6LNTV2AVJEC/graph.json","events_json":"https://pith.science/api/pith-number/6S3FQZQIJK4ALJF6LNTV2AVJEC/events.json","paper":"https://pith.science/paper/6S3FQZQI"},"agent_actions":{"view_html":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC","download_json":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC.json","view_paper":"https://pith.science/paper/6S3FQZQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.03963&json=true","fetch_graph":"https://pith.science/api/pith-number/6S3FQZQIJK4ALJF6LNTV2AVJEC/graph.json","fetch_events":"https://pith.science/api/pith-number/6S3FQZQIJK4ALJF6LNTV2AVJEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC/action/storage_attestation","attest_author":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC/action/author_attestation","sign_citation":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC/action/citation_signature","submit_replication":"https://pith.science/pith/6S3FQZQIJK4ALJF6LNTV2AVJEC/action/replication_record"}},"created_at":"2026-07-05T01:42:54.696833+00:00","updated_at":"2026-07-05T01:42:54.696833+00:00"}