{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MQ3FQYAD7JOO5UGBJM3ODRYK7R","short_pith_number":"pith:MQ3FQYAD","schema_version":"1.0","canonical_sha256":"6436586003fa5ceed0c14b36e1c70afc7ce6c315e040650f1ea5303ef88a1d4a","source":{"kind":"arxiv","id":"1109.3240","version":1},"attestation_state":"computed","paper":{"title":"Active Learning for Node Classification in Assortative and Disassortative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","math.IT","physics.soc-ph","stat.ML"],"primary_cat":"cs.IT","authors_text":"Cristopher Moore, Jean-Baptiste Rouquier, Terran Lane, Xiaoran Yan, Yaojia Zhu","submitted_at":"2011-09-15T02:10:26Z","abstract_excerpt":"In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of all the other nodes. We develop an active learning algorithm for this problem which uses information-theoretic techniques to choose which nodes to explore. We test our algorithm on networks from three different domains: a social network, a network of English words that appear ad"},"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":"1109.3240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-15T02:10:26Z","cross_cats_sorted":["cs.LG","cs.SI","math.IT","physics.soc-ph","stat.ML"],"title_canon_sha256":"845a0e04026115473b68a89809b6369545a0e1c9c10b7a1aae2667bba899da19","abstract_canon_sha256":"bc65440ed701f9cdbe7532cd4ded1efcf437bd9a0676c6a211ddf40624aea753"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:57.198304Z","signature_b64":"i+5Mv4+9tGe/n/EhlDHOM0fthA/He7S6noDekpB31qxgZl3Y6YJ7fl1R67ExIO6H5Qcx3fxplSa9KV7I5QVvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6436586003fa5ceed0c14b36e1c70afc7ce6c315e040650f1ea5303ef88a1d4a","last_reissued_at":"2026-05-18T04:12:57.197821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:57.197821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Learning for Node Classification in Assortative and Disassortative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI","math.IT","physics.soc-ph","stat.ML"],"primary_cat":"cs.IT","authors_text":"Cristopher Moore, Jean-Baptiste Rouquier, Terran Lane, Xiaoran Yan, Yaojia Zhu","submitted_at":"2011-09-15T02:10:26Z","abstract_excerpt":"In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of all the other nodes. We develop an active learning algorithm for this problem which uses information-theoretic techniques to choose which nodes to explore. We test our algorithm on networks from three different domains: a social network, a network of English words that appear ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3240","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":"1109.3240","created_at":"2026-05-18T04:12:57.197887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3240v1","created_at":"2026-05-18T04:12:57.197887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3240","created_at":"2026-05-18T04:12:57.197887+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQ3FQYAD7JOO","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQ3FQYAD7JOO5UGB","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQ3FQYAD","created_at":"2026-05-18T12:26:34.985390+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/MQ3FQYAD7JOO5UGBJM3ODRYK7R","json":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R.json","graph_json":"https://pith.science/api/pith-number/MQ3FQYAD7JOO5UGBJM3ODRYK7R/graph.json","events_json":"https://pith.science/api/pith-number/MQ3FQYAD7JOO5UGBJM3ODRYK7R/events.json","paper":"https://pith.science/paper/MQ3FQYAD"},"agent_actions":{"view_html":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R","download_json":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R.json","view_paper":"https://pith.science/paper/MQ3FQYAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3240&json=true","fetch_graph":"https://pith.science/api/pith-number/MQ3FQYAD7JOO5UGBJM3ODRYK7R/graph.json","fetch_events":"https://pith.science/api/pith-number/MQ3FQYAD7JOO5UGBJM3ODRYK7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R/action/storage_attestation","attest_author":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R/action/author_attestation","sign_citation":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R/action/citation_signature","submit_replication":"https://pith.science/pith/MQ3FQYAD7JOO5UGBJM3ODRYK7R/action/replication_record"}},"created_at":"2026-05-18T04:12:57.197887+00:00","updated_at":"2026-05-18T04:12:57.197887+00:00"}