{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WQKWMNXKMNL6QIQONRPIY6VLL4","short_pith_number":"pith:WQKWMNXK","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"},"canonical_sha256":"b4156636ea6357e8220e6c5e8c7aab5f3be7cc5e956846857a42d3040a40f34d","source":{"kind":"arxiv","id":"1509.01349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01349","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01349v1","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01349","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"WQKWMNXKMNL6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WQKWMNXKMNL6QIQO","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WQKWMNXK","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WQKWMNXKMNL6QIQONRPIY6VLL4","target":"record","payload":{"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"},"canonical_sha256":"b4156636ea6357e8220e6c5e8c7aab5f3be7cc5e956846857a42d3040a40f34d","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"},"source_kind":"arxiv","source_id":"1509.01349","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A//vwOzkOwtxIz7+jW/JSuVd6Ny95i0rZsuCYqafHPlyuzzDiidXUlgsa5We5NeY+nyxQgd6blUKcZJHplA5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:10:53.240918Z"},"content_sha256":"b18d74b80cb89a58b0ed31bbe11cc59119ee0e4eb243919ba3c9dcf0b2f3c425","schema_version":"1.0","event_id":"sha256:b18d74b80cb89a58b0ed31bbe11cc59119ee0e4eb243919ba3c9dcf0b2f3c425"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WQKWMNXKMNL6QIQONRPIY6VLL4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zz/9xq0PHt8r4rGG1g5e1Grc4j8Q6T1mod6fkGHfQ/zebgZZFHvjGQkl4cmHi9MVLKLo9IboGDcWy7dhSPjMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:10:53.241298Z"},"content_sha256":"fac094c32b1e1c534a31d4a926506b86a91d424325a61c7fdf3a0c2e7448a638","schema_version":"1.0","event_id":"sha256:fac094c32b1e1c534a31d4a926506b86a91d424325a61c7fdf3a0c2e7448a638"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/bundle.json","state_url":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T09:10:53Z","links":{"resolver":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4","bundle":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/bundle.json","state":"https://pith.science/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQKWMNXKMNL6QIQONRPIY6VLL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WQKWMNXKMNL6QIQONRPIY6VLL4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1b5441f986c05c487f42d42cef3c0babb2001959e95b04f900df1e43d95f257c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T06:35:55Z","title_canon_sha256":"a45ec3b37dcc9852f2a8a0e6ac1c4504670d7b412fe259829bba2f49acdc98eb"},"schema_version":"1.0","source":{"id":"1509.01349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01349","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01349v1","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01349","created_at":"2026-05-18T01:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"WQKWMNXKMNL6","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WQKWMNXKMNL6QIQO","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WQKWMNXK","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:fac094c32b1e1c534a31d4a926506b86a91d424325a61c7fdf3a0c2e7448a638","target":"graph","created_at":"2026-05-18T01:33:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Konstantin Avrachenkov (MAESTRO), Krishnakant Saboo, Vivek Borkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T06:35:55Z","title":"Parallel and Distributed Approaches for Graph Based Semi-supervised Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01349","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b18d74b80cb89a58b0ed31bbe11cc59119ee0e4eb243919ba3c9dcf0b2f3c425","target":"record","created_at":"2026-05-18T01:33:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1b5441f986c05c487f42d42cef3c0babb2001959e95b04f900df1e43d95f257c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-04T06:35:55Z","title_canon_sha256":"a45ec3b37dcc9852f2a8a0e6ac1c4504670d7b412fe259829bba2f49acdc98eb"},"schema_version":"1.0","source":{"id":"1509.01349","kind":"arxiv","version":1}},"canonical_sha256":"b4156636ea6357e8220e6c5e8c7aab5f3be7cc5e956846857a42d3040a40f34d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4156636ea6357e8220e6c5e8c7aab5f3be7cc5e956846857a42d3040a40f34d","first_computed_at":"2026-05-18T01:33:57.914964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:57.914964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mhHLZMOSmf5kp4S7hExXEqDWqsY7cJXkEq5M0WyMce9TbO+DXOTl14Xy2vvZ453HsxCVHJevgK82v3YlYDQ3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:57.915469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b18d74b80cb89a58b0ed31bbe11cc59119ee0e4eb243919ba3c9dcf0b2f3c425","sha256:fac094c32b1e1c534a31d4a926506b86a91d424325a61c7fdf3a0c2e7448a638"],"state_sha256":"6557f720943998b9e47775057241647f4a2a1a9373e0f03d6578e83f62534825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3B5duZTUHBGuKvvfZAYh/NRTfKeKOLBLLloSpin3lkob0uvW3uDVUgruSjmmNhJSPlcbp/Mw/1bb2BuS10ctDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:10:53.244297Z","bundle_sha256":"000dcc56542cc1ed151190f8bc8fa5c2ab7af094747a375946c6e58b4e17e04c"}}