{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PJ3HMB5KBL5VTGXKCO7FQNR5GV","short_pith_number":"pith:PJ3HMB5K","canonical_record":{"source":{"id":"1603.03515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:18:48Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"7fb46de5b98bee11e1efe197b90dea762d85e6ce018d3c2da3e89f3642a6393f","abstract_canon_sha256":"240f6235aa381bdceb5bf1a0c326ae82169bf4b1141165d15aa8275bcad8f491"},"schema_version":"1.0"},"canonical_sha256":"7a767607aa0afb599aea13be58363d3550fd597974966ffb71131e7e704fe234","source":{"kind":"arxiv","id":"1603.03515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03515","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03515v2","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03515","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"PJ3HMB5KBL5V","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ3HMB5KBL5VTGXK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ3HMB5K","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PJ3HMB5KBL5VTGXKCO7FQNR5GV","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:18:48Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"7fb46de5b98bee11e1efe197b90dea762d85e6ce018d3c2da3e89f3642a6393f","abstract_canon_sha256":"240f6235aa381bdceb5bf1a0c326ae82169bf4b1141165d15aa8275bcad8f491"},"schema_version":"1.0"},"canonical_sha256":"7a767607aa0afb599aea13be58363d3550fd597974966ffb71131e7e704fe234","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:25.734436Z","signature_b64":"D3iHzqsUQMALr/U7ftu4c09zCFrZalgR/2cMfO6D/SrlPqUVtT+IUZVCkzjthcVaH5CQQNpjvakG93eB3DJSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a767607aa0afb599aea13be58363d3550fd597974966ffb71131e7e704fe234","last_reissued_at":"2026-05-18T00:59:25.733663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:25.733663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03515","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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URJbw4/vKbhEaSqxSaiD7IFea6feRx7RUWijLPZfGAZY33LYwHBE0h//7901cL0uXHUnFGB1niSjx7rIEWX9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:19:26.742036Z"},"content_sha256":"805ded3a03e11fd65ce123ce3247a638f6b3281a12192a896486cf0939046025","schema_version":"1.0","event_id":"sha256:805ded3a03e11fd65ce123ce3247a638f6b3281a12192a896486cf0939046025"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PJ3HMB5KBL5VTGXKCO7FQNR5GV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.AI","authors_text":"Amin Karbasi, Hamed Hassani, Lin Chen","submitted_at":"2016-03-11T04:18:48Z","abstract_excerpt":"In this paper, we consider the problem of actively learning a linear classifier through query synthesis where the learner can construct artificial queries in order to estimate the true decision boundaries. This problem has recently gained a lot of interest in automated science and adversarial reverse engineering for which only heuristic algorithms are known. In such applications, queries can be constructed de novo to elicit information (e.g., automated science) or to evade detection with minimal cost (e.g., adversarial reverse engineering). We develop a general framework, called dimension coup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03515","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:59:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwGsJbtM31N42lKyZTU2UcT1jpizAoeYO4fLInV0qC6RuQMJOW9xOXzWJS76LwjbwL0K73M8OXeYRd1fgSAxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:19:26.742730Z"},"content_sha256":"fee2a20022c1794ac7527e888a31c6f0960adc9d9afbb5b49c1c8e8647541edb","schema_version":"1.0","event_id":"sha256:fee2a20022c1794ac7527e888a31c6f0960adc9d9afbb5b49c1c8e8647541edb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV/bundle.json","state_url":"https://pith.science/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV/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-31T20:19:26Z","links":{"resolver":"https://pith.science/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV","bundle":"https://pith.science/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV/bundle.json","state":"https://pith.science/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJ3HMB5KBL5VTGXKCO7FQNR5GV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PJ3HMB5KBL5VTGXKCO7FQNR5GV","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":"240f6235aa381bdceb5bf1a0c326ae82169bf4b1141165d15aa8275bcad8f491","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:18:48Z","title_canon_sha256":"7fb46de5b98bee11e1efe197b90dea762d85e6ce018d3c2da3e89f3642a6393f"},"schema_version":"1.0","source":{"id":"1603.03515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03515","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03515v2","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03515","created_at":"2026-05-18T00:59:25Z"},{"alias_kind":"pith_short_12","alias_value":"PJ3HMB5KBL5V","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJ3HMB5KBL5VTGXK","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJ3HMB5K","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:fee2a20022c1794ac7527e888a31c6f0960adc9d9afbb5b49c1c8e8647541edb","target":"graph","created_at":"2026-05-18T00:59:25Z","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":"In this paper, we consider the problem of actively learning a linear classifier through query synthesis where the learner can construct artificial queries in order to estimate the true decision boundaries. This problem has recently gained a lot of interest in automated science and adversarial reverse engineering for which only heuristic algorithms are known. In such applications, queries can be constructed de novo to elicit information (e.g., automated science) or to evade detection with minimal cost (e.g., adversarial reverse engineering). We develop a general framework, called dimension coup","authors_text":"Amin Karbasi, Hamed Hassani, Lin Chen","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:18:48Z","title":"Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03515","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:805ded3a03e11fd65ce123ce3247a638f6b3281a12192a896486cf0939046025","target":"record","created_at":"2026-05-18T00:59:25Z","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":"240f6235aa381bdceb5bf1a0c326ae82169bf4b1141165d15aa8275bcad8f491","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-11T04:18:48Z","title_canon_sha256":"7fb46de5b98bee11e1efe197b90dea762d85e6ce018d3c2da3e89f3642a6393f"},"schema_version":"1.0","source":{"id":"1603.03515","kind":"arxiv","version":2}},"canonical_sha256":"7a767607aa0afb599aea13be58363d3550fd597974966ffb71131e7e704fe234","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a767607aa0afb599aea13be58363d3550fd597974966ffb71131e7e704fe234","first_computed_at":"2026-05-18T00:59:25.733663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:25.733663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D3iHzqsUQMALr/U7ftu4c09zCFrZalgR/2cMfO6D/SrlPqUVtT+IUZVCkzjthcVaH5CQQNpjvakG93eB3DJSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:25.734436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:805ded3a03e11fd65ce123ce3247a638f6b3281a12192a896486cf0939046025","sha256:fee2a20022c1794ac7527e888a31c6f0960adc9d9afbb5b49c1c8e8647541edb"],"state_sha256":"6778ae24b0cf27551bc77fbd521727029152cc90e05ff1f71e6f32cd7af52b38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJ2A+t+genb4VBPVkb83Zt1yCG/6dNx29yjWLVULlaZhlcv/3yudy0upAAENQ85q5SIN42X5HANUr9XwN3sqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:19:26.746577Z","bundle_sha256":"684189fa91832fc8e36b7b3ed76a08568fd83a268a746f84e7bbcf4a7f1d60e1"}}