{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JNOBGUUTURJDE2MAPYHWOQWA3H","short_pith_number":"pith:JNOBGUUT","schema_version":"1.0","canonical_sha256":"4b5c135293a4523269807e0f6742c0d9f3f8a2fffdd72d99624d1defc6df2de3","source":{"kind":"arxiv","id":"1804.03195","version":2},"attestation_state":"computed","paper":{"title":"Contextual Search via Intrinsic Volumes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.MG"],"primary_cat":"cs.DS","authors_text":"Jon Schneider, Renato Paes Leme","submitted_at":"2018-04-09T19:30:29Z","abstract_excerpt":"We study the problem of contextual search, a multidimensional generalization of binary search that captures many problems in contextual decision-making. In contextual search, a learner is trying to learn the value of a hidden vector $v \\in [0,1]^d$. Every round the learner is provided an adversarially-chosen context $u_t \\in \\mathbb{R}^d$, submits a guess $p_t$ for the value of $\\langle u_t, v\\rangle$, learns whether $p_t < \\langle u_t, v\\rangle$, and incurs loss $\\ell(\\langle u_t, v\\rangle, p_t)$ (for some loss function $\\ell$). The learner's goal is to minimize their total loss over the cour"},"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":"1804.03195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-09T19:30:29Z","cross_cats_sorted":["cs.LG","math.MG"],"title_canon_sha256":"c2abde6733608d158f665ee8aaabe41dc442d872e31f053681d4d547ca520d73","abstract_canon_sha256":"a9291e665aa52a1c89cd047dc6714e0db29b8bc38cd99cf65d2c558bb4adf030"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:46.408842Z","signature_b64":"xSpnLyR/LgE8D7/2ExqxJqLSi7bXDlHYq6stSzawS8Tf+WeQHBbK5P2HjkWtdx9Aprrjt4bRSIGpA3oOwDstBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b5c135293a4523269807e0f6742c0d9f3f8a2fffdd72d99624d1defc6df2de3","last_reissued_at":"2026-05-18T00:15:46.408117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:46.408117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contextual Search via Intrinsic Volumes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.MG"],"primary_cat":"cs.DS","authors_text":"Jon Schneider, Renato Paes Leme","submitted_at":"2018-04-09T19:30:29Z","abstract_excerpt":"We study the problem of contextual search, a multidimensional generalization of binary search that captures many problems in contextual decision-making. In contextual search, a learner is trying to learn the value of a hidden vector $v \\in [0,1]^d$. Every round the learner is provided an adversarially-chosen context $u_t \\in \\mathbb{R}^d$, submits a guess $p_t$ for the value of $\\langle u_t, v\\rangle$, learns whether $p_t < \\langle u_t, v\\rangle$, and incurs loss $\\ell(\\langle u_t, v\\rangle, p_t)$ (for some loss function $\\ell$). The learner's goal is to minimize their total loss over the cour"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03195","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":"1804.03195","created_at":"2026-05-18T00:15:46.408253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03195v2","created_at":"2026-05-18T00:15:46.408253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03195","created_at":"2026-05-18T00:15:46.408253+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNOBGUUTURJD","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNOBGUUTURJDE2MA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNOBGUUT","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09331","citing_title":"Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H","json":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H.json","graph_json":"https://pith.science/api/pith-number/JNOBGUUTURJDE2MAPYHWOQWA3H/graph.json","events_json":"https://pith.science/api/pith-number/JNOBGUUTURJDE2MAPYHWOQWA3H/events.json","paper":"https://pith.science/paper/JNOBGUUT"},"agent_actions":{"view_html":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H","download_json":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H.json","view_paper":"https://pith.science/paper/JNOBGUUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03195&json=true","fetch_graph":"https://pith.science/api/pith-number/JNOBGUUTURJDE2MAPYHWOQWA3H/graph.json","fetch_events":"https://pith.science/api/pith-number/JNOBGUUTURJDE2MAPYHWOQWA3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H/action/storage_attestation","attest_author":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H/action/author_attestation","sign_citation":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H/action/citation_signature","submit_replication":"https://pith.science/pith/JNOBGUUTURJDE2MAPYHWOQWA3H/action/replication_record"}},"created_at":"2026-05-18T00:15:46.408253+00:00","updated_at":"2026-05-18T00:15:46.408253+00:00"}