{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YMYY34GA6LBGEYBIT7RBZ4NMP6","short_pith_number":"pith:YMYY34GA","schema_version":"1.0","canonical_sha256":"c3318df0c0f2c26260289fe21cf1ac7f9bb4426774382e9523f11ec555a3a3d4","source":{"kind":"arxiv","id":"1602.00354","version":2},"attestation_state":"computed","paper":{"title":"Active Learning Algorithms for Graphical Model Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Gautam Dasarathy, Jong Hyuk Park, Maria-Florina Balcan","submitted_at":"2016-02-01T01:04:34Z","abstract_excerpt":"The problem of learning the structure of a high dimensional graphical model from data has received considerable attention in recent years. In many applications such as sensor networks and proteomics it is often expensive to obtain samples from all the variables involved simultaneously. For instance, this might involve the synchronization of a large number of sensors or the tagging of a large number of proteins. To address this important issue, we initiate the study of a novel graphical model selection problem, where the goal is to optimize the total number of scalar samples obtained by allowin"},"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":"1602.00354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-01T01:04:34Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"61b3dcd4c2392432feea627d8c9330c61286df041bd1bf3cc7811f9bad0231ba","abstract_canon_sha256":"e351447f1ace25b206e9fcee4aeb86dc7b4eded0ec07aa6e34cfcb03e1fbf304"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:32.502923Z","signature_b64":"4pvOzgZV7tdO6a3iV5tZibf5GtKvgDWScFMg3m7zuEefJ+QQW6k0lnJNSgdWNu5rAnzq/N916zAxegOoUHoRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3318df0c0f2c26260289fe21cf1ac7f9bb4426774382e9523f11ec555a3a3d4","last_reissued_at":"2026-05-18T01:17:32.502198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:32.502198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Learning Algorithms for Graphical Model Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Gautam Dasarathy, Jong Hyuk Park, Maria-Florina Balcan","submitted_at":"2016-02-01T01:04:34Z","abstract_excerpt":"The problem of learning the structure of a high dimensional graphical model from data has received considerable attention in recent years. In many applications such as sensor networks and proteomics it is often expensive to obtain samples from all the variables involved simultaneously. For instance, this might involve the synchronization of a large number of sensors or the tagging of a large number of proteins. To address this important issue, we initiate the study of a novel graphical model selection problem, where the goal is to optimize the total number of scalar samples obtained by allowin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00354","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":"1602.00354","created_at":"2026-05-18T01:17:32.502301+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00354v2","created_at":"2026-05-18T01:17:32.502301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00354","created_at":"2026-05-18T01:17:32.502301+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMYY34GA6LBG","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMYY34GA6LBGEYBI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMYY34GA","created_at":"2026-05-18T12:30:53.716459+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/YMYY34GA6LBGEYBIT7RBZ4NMP6","json":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6.json","graph_json":"https://pith.science/api/pith-number/YMYY34GA6LBGEYBIT7RBZ4NMP6/graph.json","events_json":"https://pith.science/api/pith-number/YMYY34GA6LBGEYBIT7RBZ4NMP6/events.json","paper":"https://pith.science/paper/YMYY34GA"},"agent_actions":{"view_html":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6","download_json":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6.json","view_paper":"https://pith.science/paper/YMYY34GA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00354&json=true","fetch_graph":"https://pith.science/api/pith-number/YMYY34GA6LBGEYBIT7RBZ4NMP6/graph.json","fetch_events":"https://pith.science/api/pith-number/YMYY34GA6LBGEYBIT7RBZ4NMP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6/action/storage_attestation","attest_author":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6/action/author_attestation","sign_citation":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6/action/citation_signature","submit_replication":"https://pith.science/pith/YMYY34GA6LBGEYBIT7RBZ4NMP6/action/replication_record"}},"created_at":"2026-05-18T01:17:32.502301+00:00","updated_at":"2026-05-18T01:17:32.502301+00:00"}