{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WQKWMNXKMNL6QIQONRPIY6VLL4","short_pith_number":"pith:WQKWMNXK","schema_version":"1.0","canonical_sha256":"b4156636ea6357e8220e6c5e8c7aab5f3be7cc5e956846857a42d3040a40f34d","source":{"kind":"arxiv","id":"1509.01349","version":1},"attestation_state":"computed","paper":{"title":"Parallel and Distributed Approaches for Graph Based Semi-supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Konstantin Avrachenkov (MAESTRO), Krishnakant Saboo, Vivek Borkar","submitted_at":"2015-09-04T06:35:55Z","abstract_excerpt":"Two approaches for graph based semi-supervised learning are proposed. The firstapproach is based on iteration of an affine map. A key element of the affine map iteration is sparsematrix-vector multiplication, which has several very efficient parallel implementations. The secondapproach belongs to the class of Markov Chain Monte Carlo (MCMC) algorithms. It is based onsampling of nodes by performing a random walk on the graph. The latter approach is distributedby its nature and can be easily implemented on several processors or over the network. Boththeoretical and practical evaluations are prov"},"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":"1509.01349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T06:35:55Z","cross_cats_sorted":[],"title_canon_sha256":"a45ec3b37dcc9852f2a8a0e6ac1c4504670d7b412fe259829bba2f49acdc98eb","abstract_canon_sha256":"1b5441f986c05c487f42d42cef3c0babb2001959e95b04f900df1e43d95f257c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:57.915469Z","signature_b64":"mhHLZMOSmf5kp4S7hExXEqDWqsY7cJXkEq5M0WyMce9TbO+DXOTl14Xy2vvZ453HsxCVHJevgK82v3YlYDQ3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4156636ea6357e8220e6c5e8c7aab5f3be7cc5e956846857a42d3040a40f34d","last_reissued_at":"2026-05-18T01:33:57.914964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:57.914964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel and Distributed Approaches for Graph Based Semi-supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Konstantin Avrachenkov (MAESTRO), Krishnakant Saboo, Vivek Borkar","submitted_at":"2015-09-04T06:35:55Z","abstract_excerpt":"Two approaches for graph based semi-supervised learning are proposed. The firstapproach is based on iteration of an affine map. A key element of the affine map iteration is sparsematrix-vector multiplication, which has several very efficient parallel implementations. The secondapproach belongs to the class of Markov Chain Monte Carlo (MCMC) algorithms. It is based onsampling of nodes by performing a random walk on the graph. The latter approach is distributedby its nature and can be easily implemented on several processors or over the network. Boththeoretical and practical evaluations are prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01349","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":"1509.01349","created_at":"2026-05-18T01:33:57.915037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01349v1","created_at":"2026-05-18T01:33:57.915037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01349","created_at":"2026-05-18T01:33:57.915037+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQKWMNXKMNL6","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQKWMNXKMNL6QIQO","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQKWMNXK","created_at":"2026-05-18T12:29:47.479230+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/WQKWMNXKMNL6QIQONRPIY6VLL4","json":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4.json","graph_json":"https://pith.science/api/pith-number/WQKWMNXKMNL6QIQONRPIY6VLL4/graph.json","events_json":"https://pith.science/api/pith-number/WQKWMNXKMNL6QIQONRPIY6VLL4/events.json","paper":"https://pith.science/paper/WQKWMNXK"},"agent_actions":{"view_html":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4","download_json":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4.json","view_paper":"https://pith.science/paper/WQKWMNXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01349&json=true","fetch_graph":"https://pith.science/api/pith-number/WQKWMNXKMNL6QIQONRPIY6VLL4/graph.json","fetch_events":"https://pith.science/api/pith-number/WQKWMNXKMNL6QIQONRPIY6VLL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/action/storage_attestation","attest_author":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/action/author_attestation","sign_citation":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/action/citation_signature","submit_replication":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/action/replication_record"}},"created_at":"2026-05-18T01:33:57.915037+00:00","updated_at":"2026-05-18T01:33:57.915037+00:00"}