{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RZ6T3IJSOMMBOLRYA4XOJLF3C7","short_pith_number":"pith:RZ6T3IJS","canonical_record":{"source":{"id":"1802.05563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:29:10Z","cross_cats_sorted":[],"title_canon_sha256":"26586f500caa0182a4792b098c36cfd541a0178178fde642683ce5d8a7ef8497","abstract_canon_sha256":"13be3081b695755e5d06ae8e1e9b5ecd7debdc19e1541b37faa89b3b425e73dd"},"schema_version":"1.0"},"canonical_sha256":"8e7d3da1327318172e38072ee4acbb17ef3abfd607f4de83c3e5c8ebde569256","source":{"kind":"arxiv","id":"1802.05563","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05563","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05563v2","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05563","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"RZ6T3IJSOMMB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZ6T3IJSOMMBOLRY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZ6T3IJS","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RZ6T3IJSOMMBOLRYA4XOJLF3C7","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:29:10Z","cross_cats_sorted":[],"title_canon_sha256":"26586f500caa0182a4792b098c36cfd541a0178178fde642683ce5d8a7ef8497","abstract_canon_sha256":"13be3081b695755e5d06ae8e1e9b5ecd7debdc19e1541b37faa89b3b425e73dd"},"schema_version":"1.0"},"canonical_sha256":"8e7d3da1327318172e38072ee4acbb17ef3abfd607f4de83c3e5c8ebde569256","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:28.070022Z","signature_b64":"2mxDpFzJWNsDVVeBvVkCqI7pFoDK1zfCNdsRQBMMV+Wov1vakykal0EAjyN+5uMvF9JYe2tI0GwhHdpUN2i+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e7d3da1327318172e38072ee4acbb17ef3abfd607f4de83c3e5c8ebde569256","last_reissued_at":"2026-05-18T00:15:28.069352Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:28.069352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05563","source_version":2,"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-18T00:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqr8q2qAyQCpY9r21anqxBNlkdLd2KLO8D2RnNtUXleLLfJKEhjZ+kxl0vNvqTHEHWGnamtpzCDkyZvy/ar3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:05:12.618266Z"},"content_sha256":"8ac4814d44f0125aa8e58a1bf1bae8306cc17410512727c85d82078f4ccc8eda","schema_version":"1.0","event_id":"sha256:8ac4814d44f0125aa8e58a1bf1bae8306cc17410512727c85d82078f4ccc8eda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RZ6T3IJSOMMBOLRYA4XOJLF3C7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Supervised Learning on Graphs Based on Local Label Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Evgeniy Faerman, Felix Borutta, Julian Busch, Matthias Schubert","submitted_at":"2018-02-15T14:29:10Z","abstract_excerpt":"Most approaches that tackle the problem of node classification consider nodes to be similar, if they have shared neighbors or are close to each other in the graph. Recent methods for attributed graphs additionally take attributes of neighboring nodes into account. We argue that the class labels of the neighbors bear important information and considering them helps to improve classification quality. Two nodes which are similar based on class labels in their neighborhood do not need to be close-by in the graph and may even belong to different connected components. In this work, we propose a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05563","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"},"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-18T00:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrVlTAwImXD69Qzko3ep6xNwCz/fK4PGkqlzZ2kdyj6OoHRUog8tKnzgBeNAGoAt6nTkBHT+zQrdTmTJMV97Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:05:12.618649Z"},"content_sha256":"c99a384447ae46d56e2736f22c69e7ba2d45ee88b3aa85f76d4266f70d90cabb","schema_version":"1.0","event_id":"sha256:c99a384447ae46d56e2736f22c69e7ba2d45ee88b3aa85f76d4266f70d90cabb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7/bundle.json","state_url":"https://pith.science/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7/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-06-01T12:05:12Z","links":{"resolver":"https://pith.science/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7","bundle":"https://pith.science/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7/bundle.json","state":"https://pith.science/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZ6T3IJSOMMBOLRYA4XOJLF3C7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RZ6T3IJSOMMBOLRYA4XOJLF3C7","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":"13be3081b695755e5d06ae8e1e9b5ecd7debdc19e1541b37faa89b3b425e73dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:29:10Z","title_canon_sha256":"26586f500caa0182a4792b098c36cfd541a0178178fde642683ce5d8a7ef8497"},"schema_version":"1.0","source":{"id":"1802.05563","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05563","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05563v2","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05563","created_at":"2026-05-18T00:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"RZ6T3IJSOMMB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZ6T3IJSOMMBOLRY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZ6T3IJS","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:c99a384447ae46d56e2736f22c69e7ba2d45ee88b3aa85f76d4266f70d90cabb","target":"graph","created_at":"2026-05-18T00:15:28Z","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":"Most approaches that tackle the problem of node classification consider nodes to be similar, if they have shared neighbors or are close to each other in the graph. Recent methods for attributed graphs additionally take attributes of neighboring nodes into account. We argue that the class labels of the neighbors bear important information and considering them helps to improve classification quality. Two nodes which are similar based on class labels in their neighborhood do not need to be close-by in the graph and may even belong to different connected components. In this work, we propose a nove","authors_text":"Evgeniy Faerman, Felix Borutta, Julian Busch, Matthias Schubert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:29:10Z","title":"Semi-Supervised Learning on Graphs Based on Local Label Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05563","kind":"arxiv","version":2},"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:8ac4814d44f0125aa8e58a1bf1bae8306cc17410512727c85d82078f4ccc8eda","target":"record","created_at":"2026-05-18T00:15:28Z","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":"13be3081b695755e5d06ae8e1e9b5ecd7debdc19e1541b37faa89b3b425e73dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:29:10Z","title_canon_sha256":"26586f500caa0182a4792b098c36cfd541a0178178fde642683ce5d8a7ef8497"},"schema_version":"1.0","source":{"id":"1802.05563","kind":"arxiv","version":2}},"canonical_sha256":"8e7d3da1327318172e38072ee4acbb17ef3abfd607f4de83c3e5c8ebde569256","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e7d3da1327318172e38072ee4acbb17ef3abfd607f4de83c3e5c8ebde569256","first_computed_at":"2026-05-18T00:15:28.069352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:28.069352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2mxDpFzJWNsDVVeBvVkCqI7pFoDK1zfCNdsRQBMMV+Wov1vakykal0EAjyN+5uMvF9JYe2tI0GwhHdpUN2i+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:28.070022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05563","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ac4814d44f0125aa8e58a1bf1bae8306cc17410512727c85d82078f4ccc8eda","sha256:c99a384447ae46d56e2736f22c69e7ba2d45ee88b3aa85f76d4266f70d90cabb"],"state_sha256":"ad1f3aa8bddb070b42e74b5297a2c2c36378661b73b48a0e764d1925a9f078c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrOnciIGPsINZxZPmVixHGZ+smpW07blhYjNjloot0jnIP0FIvCVoVd5YD5OutBabioCwaXXxzVkrYwGoGpOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:05:12.620623Z","bundle_sha256":"60afc9caef06bf2543235917a61adcf44465fef2cd63f13d866d3b85f9ab4d9f"}}