{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L6CXW4AWK36ENGL2UWIR4LIEMQ","short_pith_number":"pith:L6CXW4AW","canonical_record":{"source":{"id":"1705.00334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-30T15:49:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d768ab10314ac2d29fa3023df715ca0f37a6a2bb7006daac6463dafe764eb85a","abstract_canon_sha256":"2295fae922bdeac899ae93b9a36af297f94ffc9dd19c0ef0164efe3efd8370b4"},"schema_version":"1.0"},"canonical_sha256":"5f857b701656fc46997aa5911e2d04640c2c613779d00c3778101855931100b2","source":{"kind":"arxiv","id":"1705.00334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00334","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00334v2","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00334","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"L6CXW4AWK36E","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6CXW4AWK36ENGL2","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6CXW4AW","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L6CXW4AWK36ENGL2UWIR4LIEMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-30T15:49:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d768ab10314ac2d29fa3023df715ca0f37a6a2bb7006daac6463dafe764eb85a","abstract_canon_sha256":"2295fae922bdeac899ae93b9a36af297f94ffc9dd19c0ef0164efe3efd8370b4"},"schema_version":"1.0"},"canonical_sha256":"5f857b701656fc46997aa5911e2d04640c2c613779d00c3778101855931100b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.972600Z","signature_b64":"F0EaH2HBBS9ToVAdPZvvOs/0fHd10fno2HWqLNVW9AcZYjGh6Bjnr2p0sGx9oHj8v2n8S7n6jtT1SU3h06pgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f857b701656fc46997aa5911e2d04640c2c613779d00c3778101855931100b2","last_reissued_at":"2026-05-18T00:37:41.971978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.971978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00334","source_version":2,"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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXIw1FFCvXy9WCOqdeqqRtJSURUdjV02x1WuPJ+R/Gw9jtKoSWFbbq05NF2jqWHCpKBBxfo8UwQQeWyxRkMVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:53:45.578395Z"},"content_sha256":"61349c7df232929d86720860f56c55c7165ad76e8ca4537636daad441a0becce","schema_version":"1.0","event_id":"sha256:61349c7df232929d86720860f56c55c7165ad76e8ca4537636daad441a0becce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L6CXW4AWK36ENGL2UWIR4LIEMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Active Search using Linear Similarity Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Artur Dubrawski, James K. Miller, Jeff Schneider, Sibi Venkatesan","submitted_at":"2017-04-30T15:49:01Z","abstract_excerpt":"Active Search has become an increasingly useful tool in information retrieval problems where the goal is to discover as many target elements as possible using only limited label queries. With the advent of big data, there is a growing emphasis on the scalability of such techniques to handle very large and very complex datasets.\n  In this paper, we consider the problem of Active Search where we are given a similarity function between data points. We look at an algorithm introduced by Wang et al. [2013] for Active Search over graphs and propose crucial modifications which allow it to scale signi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00334","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"},"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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tD9U0MKUhSLtnpqvSULUo4W3vcbaLDxHNPA73e2e5KjJG2YEQWk59PE7rdLRWGhl/AGpThrGqAoDClbjjAKPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:53:45.578746Z"},"content_sha256":"f976040c1326697127b819d245932e70076c14528b248b7047662f4da76aabef","schema_version":"1.0","event_id":"sha256:f976040c1326697127b819d245932e70076c14528b248b7047662f4da76aabef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ/bundle.json","state_url":"https://pith.science/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ/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-06-04T16:53:45Z","links":{"resolver":"https://pith.science/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ","bundle":"https://pith.science/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ/bundle.json","state":"https://pith.science/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L6CXW4AWK36ENGL2UWIR4LIEMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L6CXW4AWK36ENGL2UWIR4LIEMQ","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":"2295fae922bdeac899ae93b9a36af297f94ffc9dd19c0ef0164efe3efd8370b4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-30T15:49:01Z","title_canon_sha256":"d768ab10314ac2d29fa3023df715ca0f37a6a2bb7006daac6463dafe764eb85a"},"schema_version":"1.0","source":{"id":"1705.00334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00334","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00334v2","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00334","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"L6CXW4AWK36E","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L6CXW4AWK36ENGL2","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L6CXW4AW","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:f976040c1326697127b819d245932e70076c14528b248b7047662f4da76aabef","target":"graph","created_at":"2026-05-18T00:37:41Z","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":"Active Search has become an increasingly useful tool in information retrieval problems where the goal is to discover as many target elements as possible using only limited label queries. With the advent of big data, there is a growing emphasis on the scalability of such techniques to handle very large and very complex datasets.\n  In this paper, we consider the problem of Active Search where we are given a similarity function between data points. We look at an algorithm introduced by Wang et al. [2013] for Active Search over graphs and propose crucial modifications which allow it to scale signi","authors_text":"Artur Dubrawski, James K. Miller, Jeff Schneider, Sibi Venkatesan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-30T15:49:01Z","title":"Scaling Active Search using Linear Similarity Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00334","kind":"arxiv","version":2},"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:61349c7df232929d86720860f56c55c7165ad76e8ca4537636daad441a0becce","target":"record","created_at":"2026-05-18T00:37:41Z","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":"2295fae922bdeac899ae93b9a36af297f94ffc9dd19c0ef0164efe3efd8370b4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-30T15:49:01Z","title_canon_sha256":"d768ab10314ac2d29fa3023df715ca0f37a6a2bb7006daac6463dafe764eb85a"},"schema_version":"1.0","source":{"id":"1705.00334","kind":"arxiv","version":2}},"canonical_sha256":"5f857b701656fc46997aa5911e2d04640c2c613779d00c3778101855931100b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f857b701656fc46997aa5911e2d04640c2c613779d00c3778101855931100b2","first_computed_at":"2026-05-18T00:37:41.971978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.971978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F0EaH2HBBS9ToVAdPZvvOs/0fHd10fno2HWqLNVW9AcZYjGh6Bjnr2p0sGx9oHj8v2n8S7n6jtT1SU3h06pgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.972600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61349c7df232929d86720860f56c55c7165ad76e8ca4537636daad441a0becce","sha256:f976040c1326697127b819d245932e70076c14528b248b7047662f4da76aabef"],"state_sha256":"64ed17f2cd76a98f427c04449ad2e105fa9fd1fc1f343f417e434b6ed4c449c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6xn94OeZFwKtqFtq61LQPkrIdWj2F1TgA/jl5qc0Yf+ZT0+QbMNjQb6g0VM/hMBk62vylyIE6HsYpynG5ncDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:53:45.580790Z","bundle_sha256":"961993bbe733eddf6636d2dfd61622f62cebcf749ac54a0834802acfbefc9e5c"}}