{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X2APBX5JONB3A3ZIDNKR6OLDGX","short_pith_number":"pith:X2APBX5J","schema_version":"1.0","canonical_sha256":"be80f0dfa97343b06f281b551f396335e6de23881956f78f0ab1ac8ef0091010","source":{"kind":"arxiv","id":"1802.00243","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.00243","created_at":"2026-05-18T00:24:36.449910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00243v1","created_at":"2026-05-18T00:24:36.449910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00243","created_at":"2026-05-18T00:24:36.449910+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2APBX5JONB3","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2APBX5JONB3A3ZI","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2APBX5J","created_at":"2026-05-18T12:33:01.666342+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/X2APBX5JONB3A3ZIDNKR6OLDGX","json":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX.json","graph_json":"https://pith.science/api/pith-number/X2APBX5JONB3A3ZIDNKR6OLDGX/graph.json","events_json":"https://pith.science/api/pith-number/X2APBX5JONB3A3ZIDNKR6OLDGX/events.json","paper":"https://pith.science/paper/X2APBX5J"},"agent_actions":{"view_html":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX","download_json":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX.json","view_paper":"https://pith.science/paper/X2APBX5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00243&json=true","fetch_graph":"https://pith.science/api/pith-number/X2APBX5JONB3A3ZIDNKR6OLDGX/graph.json","fetch_events":"https://pith.science/api/pith-number/X2APBX5JONB3A3ZIDNKR6OLDGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/action/storage_attestation","attest_author":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/action/author_attestation","sign_citation":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/action/citation_signature","submit_replication":"https://pith.science/pith/X2APBX5JONB3A3ZIDNKR6OLDGX/action/replication_record"}},"created_at":"2026-05-18T00:24:36.449910+00:00","updated_at":"2026-05-18T00:24:36.449910+00:00"}