{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HAJP553Q3IQJ3LW6FVSKSDCTB6","short_pith_number":"pith:HAJP553Q","schema_version":"1.0","canonical_sha256":"3812fef770da209daede2d64a90c530fa5aa4d7ff1a312562f4492bf4df1f86d","source":{"kind":"arxiv","id":"1202.3704","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Target Learning With Stochastic Binary Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Malik Magdon-Ismail, Mithun Chakraborty, Sanmay Das","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We study learning in a noisy bisection model: specifically, Bayesian algorithms to learn a target value V given access only to noisy realizations of whether V is less than or greater than a threshold theta. At step t = 0, 1, 2, ..., the learner sets threshold theta t and observes a noisy realization of sign(V - theta t). After T steps, the goal is to output an estimate V^ which is within an eta-tolerance of V . This problem has been studied, predominantly in environments with a fixed error probability q < 1/2 for the noisy realization of sign(V - theta t). In practice, it is often the case tha"},"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":"1202.3704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"50799c99f5efad8c4661772621c7535c34eaa2a8ad97bec74e51f77ea95687df","abstract_canon_sha256":"d97d37ea20082f064064dbebf2bb78f8276e83b3bb34207508b8b49b013973d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.483715Z","signature_b64":"/GPG+NSC3c6XnLPIat7+5NIBpNTnuSvkbdVf2R4RknBhD9dFWsyxr4hKxsWmfdksokMU4qmFdE1lBL5/JPwDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3812fef770da209daede2d64a90c530fa5aa4d7ff1a312562f4492bf4df1f86d","last_reissued_at":"2026-05-18T04:02:03.483110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.483110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Target Learning With Stochastic Binary Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Malik Magdon-Ismail, Mithun Chakraborty, Sanmay Das","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We study learning in a noisy bisection model: specifically, Bayesian algorithms to learn a target value V given access only to noisy realizations of whether V is less than or greater than a threshold theta. At step t = 0, 1, 2, ..., the learner sets threshold theta t and observes a noisy realization of sign(V - theta t). After T steps, the goal is to output an estimate V^ which is within an eta-tolerance of V . This problem has been studied, predominantly in environments with a fixed error probability q < 1/2 for the noisy realization of sign(V - theta t). In practice, it is often the case tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3704","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":"1202.3704","created_at":"2026-05-18T04:02:03.483207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3704v1","created_at":"2026-05-18T04:02:03.483207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3704","created_at":"2026-05-18T04:02:03.483207+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAJP553Q3IQJ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAJP553Q3IQJ3LW6","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAJP553Q","created_at":"2026-05-18T12:27:09.501522+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/HAJP553Q3IQJ3LW6FVSKSDCTB6","json":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6.json","graph_json":"https://pith.science/api/pith-number/HAJP553Q3IQJ3LW6FVSKSDCTB6/graph.json","events_json":"https://pith.science/api/pith-number/HAJP553Q3IQJ3LW6FVSKSDCTB6/events.json","paper":"https://pith.science/paper/HAJP553Q"},"agent_actions":{"view_html":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6","download_json":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6.json","view_paper":"https://pith.science/paper/HAJP553Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3704&json=true","fetch_graph":"https://pith.science/api/pith-number/HAJP553Q3IQJ3LW6FVSKSDCTB6/graph.json","fetch_events":"https://pith.science/api/pith-number/HAJP553Q3IQJ3LW6FVSKSDCTB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6/action/storage_attestation","attest_author":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6/action/author_attestation","sign_citation":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6/action/citation_signature","submit_replication":"https://pith.science/pith/HAJP553Q3IQJ3LW6FVSKSDCTB6/action/replication_record"}},"created_at":"2026-05-18T04:02:03.483207+00:00","updated_at":"2026-05-18T04:02:03.483207+00:00"}