{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7BU5DBB6GNH3T6Z4ANGJM3QXRI","short_pith_number":"pith:7BU5DBB6","schema_version":"1.0","canonical_sha256":"f869d1843e334fb9fb3c034c966e178a34e0ad2f5c9d6565a85412cf1eb8306b","source":{"kind":"arxiv","id":"2012.01945","version":3},"attestation_state":"computed","paper":{"title":"Budget Constrained Interactive Search for Multiple Targets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Byron Choi, Jianliang Xu, Jiaxin Jiang, Xin Huang, Xuliang Zhu, Zhaonian Zou","submitted_at":"2020-12-03T14:20:09Z","abstract_excerpt":"Interactive graph search leverages human intelligence to categorize target labels in a hierarchy, which are useful for image classification, product categorization, and database search. However, many existing studies of interactive graph search aim at identifying a single target optimally, and suffer from the limitations of asking too many questions and not being able to handle multiple targets. To address these two limitations, in this paper, we study a new problem of budget constrained interactive graph search for multiple targets called kBM-IGS-problem. Specifically, given a set of multiple"},"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":"2012.01945","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2020-12-03T14:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"4f7a41b2141a4dafb83e7f136a6f25f59de790c974f98b021fd8b1d1c033681e","abstract_canon_sha256":"7d895ed384d300050ad9f8d6a7ab76dd9e0e2716a09484a9cdd5c90babd920b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:14.397346Z","signature_b64":"21M/Fghkra4bB3hU3RhQfAK3RwsXvBxs3jF2wKEVRajNjcFyqEps9cvMlggGQgCLMt6kF1Fi5/WFUnZYC1DlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f869d1843e334fb9fb3c034c966e178a34e0ad2f5c9d6565a85412cf1eb8306b","last_reissued_at":"2026-07-05T02:00:14.396973Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:14.396973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Budget Constrained Interactive Search for Multiple Targets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Byron Choi, Jianliang Xu, Jiaxin Jiang, Xin Huang, Xuliang Zhu, Zhaonian Zou","submitted_at":"2020-12-03T14:20:09Z","abstract_excerpt":"Interactive graph search leverages human intelligence to categorize target labels in a hierarchy, which are useful for image classification, product categorization, and database search. However, many existing studies of interactive graph search aim at identifying a single target optimally, and suffer from the limitations of asking too many questions and not being able to handle multiple targets. To address these two limitations, in this paper, we study a new problem of budget constrained interactive graph search for multiple targets called kBM-IGS-problem. Specifically, given a set of multiple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01945","kind":"arxiv","version":3},"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/2012.01945/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":"2012.01945","created_at":"2026-07-05T02:00:14.397027+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.01945v3","created_at":"2026-07-05T02:00:14.397027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01945","created_at":"2026-07-05T02:00:14.397027+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BU5DBB6GNH3","created_at":"2026-07-05T02:00:14.397027+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BU5DBB6GNH3T6Z4","created_at":"2026-07-05T02:00:14.397027+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BU5DBB6","created_at":"2026-07-05T02:00:14.397027+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/7BU5DBB6GNH3T6Z4ANGJM3QXRI","json":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI.json","graph_json":"https://pith.science/api/pith-number/7BU5DBB6GNH3T6Z4ANGJM3QXRI/graph.json","events_json":"https://pith.science/api/pith-number/7BU5DBB6GNH3T6Z4ANGJM3QXRI/events.json","paper":"https://pith.science/paper/7BU5DBB6"},"agent_actions":{"view_html":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI","download_json":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI.json","view_paper":"https://pith.science/paper/7BU5DBB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.01945&json=true","fetch_graph":"https://pith.science/api/pith-number/7BU5DBB6GNH3T6Z4ANGJM3QXRI/graph.json","fetch_events":"https://pith.science/api/pith-number/7BU5DBB6GNH3T6Z4ANGJM3QXRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI/action/storage_attestation","attest_author":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI/action/author_attestation","sign_citation":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI/action/citation_signature","submit_replication":"https://pith.science/pith/7BU5DBB6GNH3T6Z4ANGJM3QXRI/action/replication_record"}},"created_at":"2026-07-05T02:00:14.397027+00:00","updated_at":"2026-07-05T02:00:14.397027+00:00"}