{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PB7T72RVQRJFTHDO6L532XSUTE","short_pith_number":"pith:PB7T72RV","schema_version":"1.0","canonical_sha256":"787f3fea358452599c6ef2fbbd5e5499329470f73570077afb68c7d5cab2c1ba","source":{"kind":"arxiv","id":"1101.3291","version":1},"attestation_state":"computed","paper":{"title":"Node Classification in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Graham Cormode, Smriti Bhagat, S. Muthukrishnan","submitted_at":"2011-01-17T19:14:46Z","abstract_excerpt":"When dealing with large graphs, such as those that arise in the context of online social networks, a subset of nodes may be labeled. These labels can indicate demographic values, interest, beliefs or other characteristics of the nodes (users). A core problem is to use this information to extend the labeling so that all nodes are assigned a label (or labels). In this chapter, we survey classification techniques that have been proposed for this problem. We consider two broad categories: methods based on iterative application of traditional classifiers using graph information as features, and met"},"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":"1101.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-01-17T19:14:46Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"390c7ed722dbce15cb71baf15137391d751479344eeeb47b0e34ae8c6007f035","abstract_canon_sha256":"2aa9111f651b5d7922ff4960735de3ce1cd89553c4dd5c5045401d03eafdcec0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:39.044588Z","signature_b64":"Q8xaR++VSyRb07vgK4xz0uoY3KAPsxaJsXBEwfDGX5oe8sge9iwX/IYJoh6fPlX/r4UqxNv6lJKY9bZKcM7SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787f3fea358452599c6ef2fbbd5e5499329470f73570077afb68c7d5cab2c1ba","last_reissued_at":"2026-05-18T02:03:39.043904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:39.043904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node Classification in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Graham Cormode, Smriti Bhagat, S. Muthukrishnan","submitted_at":"2011-01-17T19:14:46Z","abstract_excerpt":"When dealing with large graphs, such as those that arise in the context of online social networks, a subset of nodes may be labeled. These labels can indicate demographic values, interest, beliefs or other characteristics of the nodes (users). A core problem is to use this information to extend the labeling so that all nodes are assigned a label (or labels). In this chapter, we survey classification techniques that have been proposed for this problem. We consider two broad categories: methods based on iterative application of traditional classifiers using graph information as features, and met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3291","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":"1101.3291","created_at":"2026-05-18T02:03:39.044011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3291v1","created_at":"2026-05-18T02:03:39.044011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3291","created_at":"2026-05-18T02:03:39.044011+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB7T72RVQRJF","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB7T72RVQRJFTHDO","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB7T72RV","created_at":"2026-05-18T12:26:39.201973+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/PB7T72RVQRJFTHDO6L532XSUTE","json":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE.json","graph_json":"https://pith.science/api/pith-number/PB7T72RVQRJFTHDO6L532XSUTE/graph.json","events_json":"https://pith.science/api/pith-number/PB7T72RVQRJFTHDO6L532XSUTE/events.json","paper":"https://pith.science/paper/PB7T72RV"},"agent_actions":{"view_html":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE","download_json":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE.json","view_paper":"https://pith.science/paper/PB7T72RV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3291&json=true","fetch_graph":"https://pith.science/api/pith-number/PB7T72RVQRJFTHDO6L532XSUTE/graph.json","fetch_events":"https://pith.science/api/pith-number/PB7T72RVQRJFTHDO6L532XSUTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE/action/storage_attestation","attest_author":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE/action/author_attestation","sign_citation":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE/action/citation_signature","submit_replication":"https://pith.science/pith/PB7T72RVQRJFTHDO6L532XSUTE/action/replication_record"}},"created_at":"2026-05-18T02:03:39.044011+00:00","updated_at":"2026-05-18T02:03:39.044011+00:00"}