{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MSJ3T3LRHHVERQR2N6ES53VYFR","short_pith_number":"pith:MSJ3T3LR","canonical_record":{"source":{"id":"1405.5829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-22T17:13:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6344eea16f98092bd6c095db29ac6909ff2a07e9685ac2b5bd8bb0466c62fe47","abstract_canon_sha256":"66cf46f27820241000b486c06b3d10b354afaa74e83bb63f691139af36c27573"},"schema_version":"1.0"},"canonical_sha256":"6493b9ed7139ea48c23a6f892eeeb82c57271ffa9bc914356ef2f854704bab5e","source":{"kind":"arxiv","id":"1405.5829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5829","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5829v1","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5829","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"MSJ3T3LRHHVE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MSJ3T3LRHHVERQR2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MSJ3T3LR","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MSJ3T3LRHHVERQR2N6ES53VYFR","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-22T17:13:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6344eea16f98092bd6c095db29ac6909ff2a07e9685ac2b5bd8bb0466c62fe47","abstract_canon_sha256":"66cf46f27820241000b486c06b3d10b354afaa74e83bb63f691139af36c27573"},"schema_version":"1.0"},"canonical_sha256":"6493b9ed7139ea48c23a6f892eeeb82c57271ffa9bc914356ef2f854704bab5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:15.502740Z","signature_b64":"ml/j9xIRUxs+A2geLf3pas+nC9tv+HfOiHl0T1EhCYbqK9OCoCEOFrPUFJrQ8wdnijuK2YmRoGtqjVOeLdb/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6493b9ed7139ea48c23a6f892eeeb82c57271ffa9bc914356ef2f854704bab5e","last_reissued_at":"2026-05-18T02:51:15.502262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:15.502262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5829","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-18T02:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcWV3NUbP0BIjsuSw+amUETAfJPJM/GD83z4DojIZqN1bkAOVIt7RhCTpae7FhMw4O/otBPHQnba93TJ9V7BDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:20:45.885419Z"},"content_sha256":"67c654c62a71050fa135c2c4c0cd63999fe2f62923c13db7115d239d5d99c3a8","schema_version":"1.0","event_id":"sha256:67c654c62a71050fa135c2c4c0cd63999fe2f62923c13db7115d239d5d99c3a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MSJ3T3LRHHVERQR2N6ES53VYFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Classification in Uncertain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DB","authors_text":"Charu Aggarwal, Michele Dallachiesa, Themis Palpanas","submitted_at":"2014-05-22T17:13:00Z","abstract_excerpt":"In many real applications that use and analyze networked data, the links in the network graph may be erroneous, or derived from probabilistic techniques. In such cases, the node classification problem can be challenging, since the unreliability of the links may affect the final results of the classification process. If the information about link reliability is not used explicitly, the classification accuracy in the underlying network may be affected adversely. In this paper, we focus on situations that require the analysis of the uncertainty that is present in the graph structure. We study the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5829","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-18T02:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfDQ2nVopDkXjOBwUSlprNnQaJkSk7vwBOo/V5G3fruR4yJLWeXejpRoTLjmi973Sipj2nv+rfV1RBM0jPjdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:20:45.885781Z"},"content_sha256":"4401e7652cc44595140ae9ddede495f3c3519eb06e04ce224e5deabcd8ec389e","schema_version":"1.0","event_id":"sha256:4401e7652cc44595140ae9ddede495f3c3519eb06e04ce224e5deabcd8ec389e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MSJ3T3LRHHVERQR2N6ES53VYFR/bundle.json","state_url":"https://pith.science/pith/MSJ3T3LRHHVERQR2N6ES53VYFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MSJ3T3LRHHVERQR2N6ES53VYFR/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-08T11:20:45Z","links":{"resolver":"https://pith.science/pith/MSJ3T3LRHHVERQR2N6ES53VYFR","bundle":"https://pith.science/pith/MSJ3T3LRHHVERQR2N6ES53VYFR/bundle.json","state":"https://pith.science/pith/MSJ3T3LRHHVERQR2N6ES53VYFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MSJ3T3LRHHVERQR2N6ES53VYFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MSJ3T3LRHHVERQR2N6ES53VYFR","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":"66cf46f27820241000b486c06b3d10b354afaa74e83bb63f691139af36c27573","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-22T17:13:00Z","title_canon_sha256":"6344eea16f98092bd6c095db29ac6909ff2a07e9685ac2b5bd8bb0466c62fe47"},"schema_version":"1.0","source":{"id":"1405.5829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5829","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5829v1","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5829","created_at":"2026-05-18T02:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"MSJ3T3LRHHVE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MSJ3T3LRHHVERQR2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MSJ3T3LR","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:4401e7652cc44595140ae9ddede495f3c3519eb06e04ce224e5deabcd8ec389e","target":"graph","created_at":"2026-05-18T02:51:15Z","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":"In many real applications that use and analyze networked data, the links in the network graph may be erroneous, or derived from probabilistic techniques. In such cases, the node classification problem can be challenging, since the unreliability of the links may affect the final results of the classification process. If the information about link reliability is not used explicitly, the classification accuracy in the underlying network may be affected adversely. In this paper, we focus on situations that require the analysis of the uncertainty that is present in the graph structure. We study the","authors_text":"Charu Aggarwal, Michele Dallachiesa, Themis Palpanas","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-22T17:13:00Z","title":"Node Classification in Uncertain Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5829","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:67c654c62a71050fa135c2c4c0cd63999fe2f62923c13db7115d239d5d99c3a8","target":"record","created_at":"2026-05-18T02:51:15Z","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":"66cf46f27820241000b486c06b3d10b354afaa74e83bb63f691139af36c27573","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-22T17:13:00Z","title_canon_sha256":"6344eea16f98092bd6c095db29ac6909ff2a07e9685ac2b5bd8bb0466c62fe47"},"schema_version":"1.0","source":{"id":"1405.5829","kind":"arxiv","version":1}},"canonical_sha256":"6493b9ed7139ea48c23a6f892eeeb82c57271ffa9bc914356ef2f854704bab5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6493b9ed7139ea48c23a6f892eeeb82c57271ffa9bc914356ef2f854704bab5e","first_computed_at":"2026-05-18T02:51:15.502262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:15.502262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ml/j9xIRUxs+A2geLf3pas+nC9tv+HfOiHl0T1EhCYbqK9OCoCEOFrPUFJrQ8wdnijuK2YmRoGtqjVOeLdb/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:15.502740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67c654c62a71050fa135c2c4c0cd63999fe2f62923c13db7115d239d5d99c3a8","sha256:4401e7652cc44595140ae9ddede495f3c3519eb06e04ce224e5deabcd8ec389e"],"state_sha256":"bbcf75bd9bf20f30942cb211a2380abf4780c2c74e5c19e0cd27b8f1ee1c6c50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FL1ofjV6VNL/JGVzhryVhc2ksHz5l0EVzI/PUaPZMCLeuAsnfTyWVP7t1V/RnuUhCt4SJkGiBU9JTFTTSXzpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:20:45.887610Z","bundle_sha256":"eb54713741a08c00848cfa08d89b39a66b50fc4859777b859ae8843a38ba7980"}}