{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6HLD3Y5TSFNGRSGR57ZANT3LTL","short_pith_number":"pith:6HLD3Y5T","canonical_record":{"source":{"id":"1702.07694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:28:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"9b42ea105cc582bf0eb100d1eae2ea84811e1e030dccc1ee7b478b3c967c75c1","abstract_canon_sha256":"569a7f03b5d379a0488fb57e786be4948644dd4512c5c7580a45a46861a2198f"},"schema_version":"1.0"},"canonical_sha256":"f1d63de3b3915a68c8d1eff206cf6b9ae7c87cd84521c77beeeed1415429132e","source":{"kind":"arxiv","id":"1702.07694","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07694","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07694v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07694","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"6HLD3Y5TSFNG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HLD3Y5TSFNGRSGR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HLD3Y5T","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6HLD3Y5TSFNGRSGR57ZANT3LTL","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07694","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:28:18Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"9b42ea105cc582bf0eb100d1eae2ea84811e1e030dccc1ee7b478b3c967c75c1","abstract_canon_sha256":"569a7f03b5d379a0488fb57e786be4948644dd4512c5c7580a45a46861a2198f"},"schema_version":"1.0"},"canonical_sha256":"f1d63de3b3915a68c8d1eff206cf6b9ae7c87cd84521c77beeeed1415429132e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.483706Z","signature_b64":"fyhJaSbctA1zL7FZwxiRNgf4AzBgL7sUxzU/jv4jYg+6Nnrwchn77VYGHG0YcW6rqq3SjvF2i18Cn6s/7FKYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1d63de3b3915a68c8d1eff206cf6b9ae7c87cd84521c77beeeed1415429132e","last_reissued_at":"2026-05-18T00:50:02.483181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.483181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07694","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8ZLC5dlghtrQArxQmqiOUgMCrQAGsnWVZsGG0yN7nOq3YLUza2ttgsgXJXx8zuSrtE2AAe9gtti+Mrg5Dl4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:24:03.398085Z"},"content_sha256":"fd8fa021bf895e6ebbfb57ed16aa23997540ffe05a3f10aa563672f165712a4f","schema_version":"1.0","event_id":"sha256:fd8fa021bf895e6ebbfb57ed16aa23997540ffe05a3f10aa563672f165712a4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6HLD3Y5TSFNGRSGR57ZANT3LTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayes-Optimal Entropy Pursuit for Active Choice-Based Preference Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Peter I. Frazier, Shane G. Henderson, Stephen N. Pallone","submitted_at":"2017-02-24T18:28:18Z","abstract_excerpt":"We analyze the problem of learning a single user's preferences in an active learning setting, sequentially and adaptively querying the user over a finite time horizon. Learning is conducted via choice-based queries, where the user selects her preferred option among a small subset of offered alternatives. These queries have been shown to be a robust and efficient way to learn an individual's preferences. We take a parametric approach and model the user's preferences through a linear classifier, using a Bayesian prior to encode our current knowledge of this classifier. The rate at which we learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07694","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08xto6Dxs56xn2p3Qcgo2tS2/CHk5beMafjG7O4NoJWqsBKghV8AGUw/fpKVNAUB8GTEYsFwgqiDEuht3XURAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:24:03.398743Z"},"content_sha256":"0c890e8b593b4c5158527525f4cd19f3b1b5a05d0a03de9abbd53b4c984ed7a0","schema_version":"1.0","event_id":"sha256:0c890e8b593b4c5158527525f4cd19f3b1b5a05d0a03de9abbd53b4c984ed7a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL/bundle.json","state_url":"https://pith.science/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T01:24:03Z","links":{"resolver":"https://pith.science/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL","bundle":"https://pith.science/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL/bundle.json","state":"https://pith.science/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HLD3Y5TSFNGRSGR57ZANT3LTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6HLD3Y5TSFNGRSGR57ZANT3LTL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"569a7f03b5d379a0488fb57e786be4948644dd4512c5c7580a45a46861a2198f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:28:18Z","title_canon_sha256":"9b42ea105cc582bf0eb100d1eae2ea84811e1e030dccc1ee7b478b3c967c75c1"},"schema_version":"1.0","source":{"id":"1702.07694","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07694","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07694v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07694","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"6HLD3Y5TSFNG","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HLD3Y5TSFNGRSGR","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HLD3Y5T","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:0c890e8b593b4c5158527525f4cd19f3b1b5a05d0a03de9abbd53b4c984ed7a0","target":"graph","created_at":"2026-05-18T00:50:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We analyze the problem of learning a single user's preferences in an active learning setting, sequentially and adaptively querying the user over a finite time horizon. Learning is conducted via choice-based queries, where the user selects her preferred option among a small subset of offered alternatives. These queries have been shown to be a robust and efficient way to learn an individual's preferences. We take a parametric approach and model the user's preferences through a linear classifier, using a Bayesian prior to encode our current knowledge of this classifier. The rate at which we learn","authors_text":"Peter I. Frazier, Shane G. Henderson, Stephen N. Pallone","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:28:18Z","title":"Bayes-Optimal Entropy Pursuit for Active Choice-Based Preference Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07694","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fd8fa021bf895e6ebbfb57ed16aa23997540ffe05a3f10aa563672f165712a4f","target":"record","created_at":"2026-05-18T00:50:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"569a7f03b5d379a0488fb57e786be4948644dd4512c5c7580a45a46861a2198f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:28:18Z","title_canon_sha256":"9b42ea105cc582bf0eb100d1eae2ea84811e1e030dccc1ee7b478b3c967c75c1"},"schema_version":"1.0","source":{"id":"1702.07694","kind":"arxiv","version":1}},"canonical_sha256":"f1d63de3b3915a68c8d1eff206cf6b9ae7c87cd84521c77beeeed1415429132e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1d63de3b3915a68c8d1eff206cf6b9ae7c87cd84521c77beeeed1415429132e","first_computed_at":"2026-05-18T00:50:02.483181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.483181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fyhJaSbctA1zL7FZwxiRNgf4AzBgL7sUxzU/jv4jYg+6Nnrwchn77VYGHG0YcW6rqq3SjvF2i18Cn6s/7FKYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.483706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07694","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd8fa021bf895e6ebbfb57ed16aa23997540ffe05a3f10aa563672f165712a4f","sha256:0c890e8b593b4c5158527525f4cd19f3b1b5a05d0a03de9abbd53b4c984ed7a0"],"state_sha256":"75c2dda9e39531e47205b9c3ed1e04f4218b60beb79f9f8ceb34c1669f330f9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSn+1ct6FCrSX8NOPbX5ajH2cEuoFLKoESmZsIL19OEav1y5wAAciyDnyzx/ugCDauCH7Gy6pI+iXlm5NTpeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:24:03.402588Z","bundle_sha256":"d2afd7c2caef7b9fb7c37f4b9e621e64ac22c56b7c1194a4013e8969189def3c"}}