{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X2APBX5JONB3A3ZIDNKR6OLDGX","short_pith_number":"pith:X2APBX5J","canonical_record":{"source":{"id":"1802.00243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T11:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"c8a47ff2060650120da65975a7fcc0781ec1380e7912ff42f1aece9002168425","abstract_canon_sha256":"fafef66a0774ca30acaa17e5a1ce140ec7f7248645c475e904db7edef5807981"},"schema_version":"1.0"},"canonical_sha256":"be80f0dfa97343b06f281b551f396335e6de23881956f78f0ab1ac8ef0091010","source":{"kind":"arxiv","id":"1802.00243","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00243","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00243v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00243","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"X2APBX5JONB3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X2APBX5JONB3A3ZI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X2APBX5J","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X2APBX5JONB3A3ZIDNKR6OLDGX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T11:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"c8a47ff2060650120da65975a7fcc0781ec1380e7912ff42f1aece9002168425","abstract_canon_sha256":"fafef66a0774ca30acaa17e5a1ce140ec7f7248645c475e904db7edef5807981"},"schema_version":"1.0"},"canonical_sha256":"be80f0dfa97343b06f281b551f396335e6de23881956f78f0ab1ac8ef0091010","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.450262Z","signature_b64":"MO7bkt08UExEWmfVdvqAYVaTM5BDW+jhCxem0Qzo9F6ntOvJspNsMSdbmBYGMJcPhe8MzNE3As8r/oqjqGmzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be80f0dfa97343b06f281b551f396335e6de23881956f78f0ab1ac8ef0091010","last_reissued_at":"2026-05-18T00:24:36.449843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.449843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00243","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkSyb5a1dyXh7YIkxf1KV4HOCEoV/pDiQhRkAdMlkjpdwK2gmxKoBN9wcw+IqrMzoz2Ps84G7bsEC5P9vgLpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:26:25.193230Z"},"content_sha256":"fa3847badf2b84ccb6496381f58ea0755e0c0a619bac7f28d90bcfb63a3f7aae","schema_version":"1.0","event_id":"sha256:fa3847badf2b84ccb6496381f58ea0755e0c0a619bac7f28d90bcfb63a3f7aae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X2APBX5JONB3A3ZIDNKR6OLDGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Active Learning Algorithm for Logistic Regression Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Hsiang-Ling Hsu, Ray-Bing Chen, Yuan-chin Ivan Chang","submitted_at":"2018-02-01T11:12:14Z","abstract_excerpt":"We study a logistic model-based active learning procedure for binary classification problems, in which we adopt a batch subject selection strategy with a modified sequential experimental design method. Moreover, accompanying the proposed subject selection scheme, we simultaneously conduct a greedy variable selection procedure such that we can update the classification model with all labeled training subjects. The proposed algorithm repeatedly performs both subject and variable selection steps until a prefixed stopping criterion is reached. Our numerical results show that the proposed procedure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00243","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPzmXT1zNYJH2nq5KUtTTFnHfYDtaPZmjpG7wm/MvFIIHGQzFaBZ5/VY8G8hccfaIMXL8+KzVO+MjIrIIFgHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:26:25.193926Z"},"content_sha256":"430161f9db387038fc9b2f16fbf5df154a4b27b5e06177d9de905ca2d9e1f20e","schema_version":"1.0","event_id":"sha256:430161f9db387038fc9b2f16fbf5df154a4b27b5e06177d9de905ca2d9e1f20e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/bundle.json","state_url":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/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-25T21:26:25Z","links":{"resolver":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX","bundle":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/bundle.json","state":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X2APBX5JONB3A3ZIDNKR6OLDGX","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":"fafef66a0774ca30acaa17e5a1ce140ec7f7248645c475e904db7edef5807981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T11:12:14Z","title_canon_sha256":"c8a47ff2060650120da65975a7fcc0781ec1380e7912ff42f1aece9002168425"},"schema_version":"1.0","source":{"id":"1802.00243","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00243","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00243v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00243","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"X2APBX5JONB3","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"X2APBX5JONB3A3ZI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"X2APBX5J","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:430161f9db387038fc9b2f16fbf5df154a4b27b5e06177d9de905ca2d9e1f20e","target":"graph","created_at":"2026-05-18T00:24:36Z","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 study a logistic model-based active learning procedure for binary classification problems, in which we adopt a batch subject selection strategy with a modified sequential experimental design method. Moreover, accompanying the proposed subject selection scheme, we simultaneously conduct a greedy variable selection procedure such that we can update the classification model with all labeled training subjects. The proposed algorithm repeatedly performs both subject and variable selection steps until a prefixed stopping criterion is reached. Our numerical results show that the proposed procedure","authors_text":"Hsiang-Ling Hsu, Ray-Bing Chen, Yuan-chin Ivan Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T11:12:14Z","title":"Greedy Active Learning Algorithm for Logistic Regression Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00243","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:fa3847badf2b84ccb6496381f58ea0755e0c0a619bac7f28d90bcfb63a3f7aae","target":"record","created_at":"2026-05-18T00:24:36Z","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":"fafef66a0774ca30acaa17e5a1ce140ec7f7248645c475e904db7edef5807981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-01T11:12:14Z","title_canon_sha256":"c8a47ff2060650120da65975a7fcc0781ec1380e7912ff42f1aece9002168425"},"schema_version":"1.0","source":{"id":"1802.00243","kind":"arxiv","version":1}},"canonical_sha256":"be80f0dfa97343b06f281b551f396335e6de23881956f78f0ab1ac8ef0091010","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be80f0dfa97343b06f281b551f396335e6de23881956f78f0ab1ac8ef0091010","first_computed_at":"2026-05-18T00:24:36.449843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.449843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MO7bkt08UExEWmfVdvqAYVaTM5BDW+jhCxem0Qzo9F6ntOvJspNsMSdbmBYGMJcPhe8MzNE3As8r/oqjqGmzDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.450262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00243","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa3847badf2b84ccb6496381f58ea0755e0c0a619bac7f28d90bcfb63a3f7aae","sha256:430161f9db387038fc9b2f16fbf5df154a4b27b5e06177d9de905ca2d9e1f20e"],"state_sha256":"0d2e2afd65db41fb73e327570539b96e6f4991321c79563d72817945a5b3df48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbZ9AABvwoGp5WhgT1tnALberCrrTBJkL2Rqhd43FN5pje5sZMQVKM13RZQXyBGVGa08ZAsijx3hwS/MILVRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:26:25.197809Z","bundle_sha256":"c6cf19e5ef7bf857c4dea4038123780b1bc644ae271a319e6d42e7cc8ce98d51"}}