{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6GDBCZI4MQWXMA6ELX3JU5JPZY","short_pith_number":"pith:6GDBCZI4","schema_version":"1.0","canonical_sha256":"f18611651c642d7603c45df69a752fce05685a3160e3582788b68bda2dfd711d","source":{"kind":"arxiv","id":"1703.01557","version":2},"attestation_state":"computed","paper":{"title":"Using Graphs of Classifiers to Impose Declarative Constraints on Semi-supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bhuwan Dhingra, Lidong Bing, William W. Cohen","submitted_at":"2017-03-05T04:43:41Z","abstract_excerpt":"We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In addition to representing individual SSL heuristics, we show that multiple heuristics can be automatically combined using Bayesian optimization methods. We experiment with two classes of tasks, link-based text classification and relation extraction. We show modest improvements on we"},"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":"1703.01557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-05T04:43:41Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"2774ad4b7856dcf1739ce5735a0a7432113201eb68dee7ebc052baf32f183b0d","abstract_canon_sha256":"3466971cd9c7b00ac1d5f7883a702290d6cc4bdc016f02b62c3a28dc6fec9018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.920641Z","signature_b64":"QtOpovMFtlhk4Dx2Y9e0osINXDdOFk4r+3286ItHwTkchz854eu66sJ7eIIn29I2zvv8uNe2Tk++GMNWpHu3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f18611651c642d7603c45df69a752fce05685a3160e3582788b68bda2dfd711d","last_reissued_at":"2026-05-18T00:48:04.919977Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.919977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Graphs of Classifiers to Impose Declarative Constraints on Semi-supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bhuwan Dhingra, Lidong Bing, William W. Cohen","submitted_at":"2017-03-05T04:43:41Z","abstract_excerpt":"We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, including both well-known heuristics such as co-training and novel domain-specific heuristics. In addition to representing individual SSL heuristics, we show that multiple heuristics can be automatically combined using Bayesian optimization methods. We experiment with two classes of tasks, link-based text classification and relation extraction. We show modest improvements on we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01557","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.01557","created_at":"2026-05-18T00:48:04.920074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01557v2","created_at":"2026-05-18T00:48:04.920074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01557","created_at":"2026-05-18T00:48:04.920074+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GDBCZI4MQWX","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GDBCZI4MQWXMA6E","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GDBCZI4","created_at":"2026-05-18T12:31:03.183658+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/6GDBCZI4MQWXMA6ELX3JU5JPZY","json":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY.json","graph_json":"https://pith.science/api/pith-number/6GDBCZI4MQWXMA6ELX3JU5JPZY/graph.json","events_json":"https://pith.science/api/pith-number/6GDBCZI4MQWXMA6ELX3JU5JPZY/events.json","paper":"https://pith.science/paper/6GDBCZI4"},"agent_actions":{"view_html":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY","download_json":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY.json","view_paper":"https://pith.science/paper/6GDBCZI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01557&json=true","fetch_graph":"https://pith.science/api/pith-number/6GDBCZI4MQWXMA6ELX3JU5JPZY/graph.json","fetch_events":"https://pith.science/api/pith-number/6GDBCZI4MQWXMA6ELX3JU5JPZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY/action/storage_attestation","attest_author":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY/action/author_attestation","sign_citation":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY/action/citation_signature","submit_replication":"https://pith.science/pith/6GDBCZI4MQWXMA6ELX3JU5JPZY/action/replication_record"}},"created_at":"2026-05-18T00:48:04.920074+00:00","updated_at":"2026-05-18T00:48:04.920074+00:00"}