{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GICX5Q2MRNGPXYLQIKAVJDXI3J","short_pith_number":"pith:GICX5Q2M","schema_version":"1.0","canonical_sha256":"32057ec34c8b4cfbe1704281548ee8da467443bfa68df611981d33d93b978acd","source":{"kind":"arxiv","id":"1605.07144","version":2},"attestation_state":"computed","paper":{"title":"Actively Learning Hemimetrics with Applications to Eliciting User Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Adish Singla, Andreas Krause, Sebastian Tschiatschek","submitted_at":"2016-05-23T19:21:35Z","abstract_excerpt":"Motivated by an application of eliciting users' preferences, we investigate the problem of learning hemimetrics, i.e., pairwise distances among a set of $n$ items that satisfy triangle inequalities and non-negativity constraints. In our application, the (asymmetric) distances quantify private costs a user incurs when substituting one item by another. We aim to learn these distances (costs) by asking the users whether they are willing to switch from one item to another for a given incentive offer. Without exploiting structural constraints of the hemimetric polytope, learning the distances betwe"},"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":"1605.07144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-23T19:21:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b7582e727842ec30b1930e9d4f4d564793fdeacac97e3fc03c3f7335a7896a75","abstract_canon_sha256":"a4f033a6a9238bc3aab945e801f80c9c446fb42a0cd76cea60ef15d4aa714bb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.145370Z","signature_b64":"qM52reC4LqF26MlNTqLPxuMcLX/n4XbyyR1B7ZJypsY5N3UMmRxsrkUmBtGKSSdxt1qdKgOBoes79RcL18OlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32057ec34c8b4cfbe1704281548ee8da467443bfa68df611981d33d93b978acd","last_reissued_at":"2026-05-18T01:13:30.144626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.144626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Actively Learning Hemimetrics with Applications to Eliciting User Preferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Adish Singla, Andreas Krause, Sebastian Tschiatschek","submitted_at":"2016-05-23T19:21:35Z","abstract_excerpt":"Motivated by an application of eliciting users' preferences, we investigate the problem of learning hemimetrics, i.e., pairwise distances among a set of $n$ items that satisfy triangle inequalities and non-negativity constraints. In our application, the (asymmetric) distances quantify private costs a user incurs when substituting one item by another. We aim to learn these distances (costs) by asking the users whether they are willing to switch from one item to another for a given incentive offer. Without exploiting structural constraints of the hemimetric polytope, learning the distances betwe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07144","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":"1605.07144","created_at":"2026-05-18T01:13:30.144734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07144v2","created_at":"2026-05-18T01:13:30.144734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07144","created_at":"2026-05-18T01:13:30.144734+00:00"},{"alias_kind":"pith_short_12","alias_value":"GICX5Q2MRNGP","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GICX5Q2MRNGPXYLQ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GICX5Q2M","created_at":"2026-05-18T12:30:19.053100+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/GICX5Q2MRNGPXYLQIKAVJDXI3J","json":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J.json","graph_json":"https://pith.science/api/pith-number/GICX5Q2MRNGPXYLQIKAVJDXI3J/graph.json","events_json":"https://pith.science/api/pith-number/GICX5Q2MRNGPXYLQIKAVJDXI3J/events.json","paper":"https://pith.science/paper/GICX5Q2M"},"agent_actions":{"view_html":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J","download_json":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J.json","view_paper":"https://pith.science/paper/GICX5Q2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07144&json=true","fetch_graph":"https://pith.science/api/pith-number/GICX5Q2MRNGPXYLQIKAVJDXI3J/graph.json","fetch_events":"https://pith.science/api/pith-number/GICX5Q2MRNGPXYLQIKAVJDXI3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J/action/storage_attestation","attest_author":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J/action/author_attestation","sign_citation":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J/action/citation_signature","submit_replication":"https://pith.science/pith/GICX5Q2MRNGPXYLQIKAVJDXI3J/action/replication_record"}},"created_at":"2026-05-18T01:13:30.144734+00:00","updated_at":"2026-05-18T01:13:30.144734+00:00"}