{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DNITOB4T5VGXZKURO7TUSWDVGF","short_pith_number":"pith:DNITOB4T","canonical_record":{"source":{"id":"1305.7006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-30T05:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"42d7991e904f6d458abcf4cc7968db75b155e59f09f82c9f998323b6b1924a0d","abstract_canon_sha256":"6d1cf1df799cc2e55b9c885b70fc85116133b3390aacdd896fd1f7f3c9176984"},"schema_version":"1.0"},"canonical_sha256":"1b51370793ed4d7caa9177e749587531530022dc1d74c497a5ed84db52c6a7dc","source":{"kind":"arxiv","id":"1305.7006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7006","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7006v1","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7006","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"DNITOB4T5VGX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNITOB4T5VGXZKUR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNITOB4T","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DNITOB4T5VGXZKURO7TUSWDVGF","target":"record","payload":{"canonical_record":{"source":{"id":"1305.7006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-30T05:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"42d7991e904f6d458abcf4cc7968db75b155e59f09f82c9f998323b6b1924a0d","abstract_canon_sha256":"6d1cf1df799cc2e55b9c885b70fc85116133b3390aacdd896fd1f7f3c9176984"},"schema_version":"1.0"},"canonical_sha256":"1b51370793ed4d7caa9177e749587531530022dc1d74c497a5ed84db52c6a7dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:16.640885Z","signature_b64":"anjHc4JNSzaKlXAaeheloLthTjGKC3I/j7SWdUQ8qimHgFrsXkRFEBLSsGyNaZC2tVapmgGbINnrxplXO4pmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b51370793ed4d7caa9177e749587531530022dc1d74c497a5ed84db52c6a7dc","last_reissued_at":"2026-05-18T03:22:16.640274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:16.640274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.7006","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-18T03:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nt27PPgrGus+hmRukaDvcgbswEWw/8MNtv/bsSYjGmI4g7oP24m/7+KqnzKq/nYFp4a6Ukh73et4F/tw90uLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:42:05.238719Z"},"content_sha256":"aee0b3a0185323dfa6a17bf6c1a115866a9868f01b2300ca46bd20b8bf33ff59","schema_version":"1.0","event_id":"sha256:aee0b3a0185323dfa6a17bf6c1a115866a9868f01b2300ca46bd20b8bf33ff59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DNITOB4T5VGXZKURO7TUSWDVGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraph Pattern Matching over Uncertain Graphs with Identity Linkage Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Angelika Kimmig, Lise Getoor, Walaa Eldin Moustafa","submitted_at":"2013-05-30T05:27:23Z","abstract_excerpt":"There is a growing need for methods which can capture uncertainties and answer queries over graph-structured data. Two common types of uncertainty are uncertainty over the attribute values of nodes and uncertainty over the existence of edges. In this paper, we combine those with identity uncertainty. Identity uncertainty represents uncertainty over the mapping from objects mentioned in the data, or references, to the underlying real-world entities. We propose the notion of a probabilistic entity graph (PEG), a probabilistic graph model that defines a distribution over possible graphs at the en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7006","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-18T03:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8InHLjHtPxI6FEHnTp9K4Fp7VxchnoRQgrmJmEZ0kZxQE3EpW98n+CXoWf0oCYfXsMwrsIA6gqEN7df4zZtpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:42:05.239269Z"},"content_sha256":"052fc0c750bd62d08ac79afcb96600cfdd8dde18e0fdebe503930853f472d34a","schema_version":"1.0","event_id":"sha256:052fc0c750bd62d08ac79afcb96600cfdd8dde18e0fdebe503930853f472d34a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNITOB4T5VGXZKURO7TUSWDVGF/bundle.json","state_url":"https://pith.science/pith/DNITOB4T5VGXZKURO7TUSWDVGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNITOB4T5VGXZKURO7TUSWDVGF/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-05T19:42:05Z","links":{"resolver":"https://pith.science/pith/DNITOB4T5VGXZKURO7TUSWDVGF","bundle":"https://pith.science/pith/DNITOB4T5VGXZKURO7TUSWDVGF/bundle.json","state":"https://pith.science/pith/DNITOB4T5VGXZKURO7TUSWDVGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNITOB4T5VGXZKURO7TUSWDVGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DNITOB4T5VGXZKURO7TUSWDVGF","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":"6d1cf1df799cc2e55b9c885b70fc85116133b3390aacdd896fd1f7f3c9176984","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-30T05:27:23Z","title_canon_sha256":"42d7991e904f6d458abcf4cc7968db75b155e59f09f82c9f998323b6b1924a0d"},"schema_version":"1.0","source":{"id":"1305.7006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7006","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7006v1","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7006","created_at":"2026-05-18T03:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"DNITOB4T5VGX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNITOB4T5VGXZKUR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNITOB4T","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:052fc0c750bd62d08ac79afcb96600cfdd8dde18e0fdebe503930853f472d34a","target":"graph","created_at":"2026-05-18T03:22:16Z","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":"There is a growing need for methods which can capture uncertainties and answer queries over graph-structured data. Two common types of uncertainty are uncertainty over the attribute values of nodes and uncertainty over the existence of edges. In this paper, we combine those with identity uncertainty. Identity uncertainty represents uncertainty over the mapping from objects mentioned in the data, or references, to the underlying real-world entities. We propose the notion of a probabilistic entity graph (PEG), a probabilistic graph model that defines a distribution over possible graphs at the en","authors_text":"Amol Deshpande, Angelika Kimmig, Lise Getoor, Walaa Eldin Moustafa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-30T05:27:23Z","title":"Subgraph Pattern Matching over Uncertain Graphs with Identity Linkage Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7006","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:aee0b3a0185323dfa6a17bf6c1a115866a9868f01b2300ca46bd20b8bf33ff59","target":"record","created_at":"2026-05-18T03:22:16Z","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":"6d1cf1df799cc2e55b9c885b70fc85116133b3390aacdd896fd1f7f3c9176984","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-05-30T05:27:23Z","title_canon_sha256":"42d7991e904f6d458abcf4cc7968db75b155e59f09f82c9f998323b6b1924a0d"},"schema_version":"1.0","source":{"id":"1305.7006","kind":"arxiv","version":1}},"canonical_sha256":"1b51370793ed4d7caa9177e749587531530022dc1d74c497a5ed84db52c6a7dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b51370793ed4d7caa9177e749587531530022dc1d74c497a5ed84db52c6a7dc","first_computed_at":"2026-05-18T03:22:16.640274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:16.640274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"anjHc4JNSzaKlXAaeheloLthTjGKC3I/j7SWdUQ8qimHgFrsXkRFEBLSsGyNaZC2tVapmgGbINnrxplXO4pmCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:16.640885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.7006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aee0b3a0185323dfa6a17bf6c1a115866a9868f01b2300ca46bd20b8bf33ff59","sha256:052fc0c750bd62d08ac79afcb96600cfdd8dde18e0fdebe503930853f472d34a"],"state_sha256":"c4c847f98a12b1604d07aeae545472a638fcbf485dd7f130885aa09ec6fc7f93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4p3M790FGdvhMCFK6IdFgPR1pQBCWGaIAoFa5a4dM06Dk6+tNtM/imHSCdsWIkKJVp43+mXcBvi8FL5HkAUBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:42:05.242731Z","bundle_sha256":"d3cb1e1514f5a9040ac8fc203a561dfb21c665474f9882f54c679564a1be4080"}}