{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AO4GWK6F2YLA4DHNVPHR2X7G6Z","short_pith_number":"pith:AO4GWK6F","canonical_record":{"source":{"id":"1904.05300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-10T17:03:55Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ef83391a56b3055237e8b220b7d2dea94f1c7967d72bfb06c884d72852692f04","abstract_canon_sha256":"13bcabb2dc2e9cdad5ea90a57856559f09186507b0f53231fa8805eb8ff0dbff"},"schema_version":"1.0"},"canonical_sha256":"03b86b2bc5d6160e0cedabcf1d5fe6f64acbd071847042f75459cf245a958430","source":{"kind":"arxiv","id":"1904.05300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05300","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05300v1","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05300","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"AO4GWK6F2YLA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AO4GWK6F2YLA4DHN","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AO4GWK6F","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AO4GWK6F2YLA4DHNVPHR2X7G6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-10T17:03:55Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ef83391a56b3055237e8b220b7d2dea94f1c7967d72bfb06c884d72852692f04","abstract_canon_sha256":"13bcabb2dc2e9cdad5ea90a57856559f09186507b0f53231fa8805eb8ff0dbff"},"schema_version":"1.0"},"canonical_sha256":"03b86b2bc5d6160e0cedabcf1d5fe6f64acbd071847042f75459cf245a958430","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:53.558833Z","signature_b64":"oNPTkWIFgWTXp48aFMbPcaTJuIKQSICp6ypNXE915Cs1/nXGB2WHT+SsyWn+IcGxEbBGXFf4xGGSz2KYXRGHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b86b2bc5d6160e0cedabcf1d5fe6f64acbd071847042f75459cf245a958430","last_reissued_at":"2026-05-17T23:48:53.558294Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:53.558294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05300","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-17T23:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6U6eEFT3SsytQI8Dw+GCZMxujBg/a1dPkgoHpp1vMwz56Gyq0uBof4QYp5Is6eIu8ASzkicXpNExE/Lvj03UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:30:30.191178Z"},"content_sha256":"107aa5815da9d4f52b73609229d123bd57182f272deda556222a59782bd65eb4","schema_version":"1.0","event_id":"sha256:107aa5815da9d4f52b73609229d123bd57182f272deda556222a59782bd65eb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AO4GWK6F2YLA4DHNVPHR2X7G6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Arijit Khan, Leroy Lim Hong Quan, Xiangyu Ke","submitted_at":"2019-04-10T17:03:55Z","abstract_excerpt":"Uncertain, or probabilistic, graphs have been increasingly used to represent noisy linked data in many emerging applications, and have recently attracted the attention of the database research community. A fundamental problem on uncertain graphs is the s-t reliability, which measures the probability that a target node t is reachable from a source node s in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of existence.\n  Due to the inherent complexity of the s-t reliability estimation problem (#P-hard), various sampling and indexing based efficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05300","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-17T23:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgYfMnp+rCJq5nnBCZSCqu46tM74+KsSaMT1N7AtBKi3/gOx42t+/s7rHchAzfy3C+lmK+qXO9+8BdXCPnIWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:30:30.191953Z"},"content_sha256":"278cec442a28905a276c1e5efafd23460b448af3661bbc589a03d523a4e60fcd","schema_version":"1.0","event_id":"sha256:278cec442a28905a276c1e5efafd23460b448af3661bbc589a03d523a4e60fcd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z/bundle.json","state_url":"https://pith.science/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z/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-30T09:30:30Z","links":{"resolver":"https://pith.science/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z","bundle":"https://pith.science/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z/bundle.json","state":"https://pith.science/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AO4GWK6F2YLA4DHNVPHR2X7G6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AO4GWK6F2YLA4DHNVPHR2X7G6Z","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":"13bcabb2dc2e9cdad5ea90a57856559f09186507b0f53231fa8805eb8ff0dbff","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-10T17:03:55Z","title_canon_sha256":"ef83391a56b3055237e8b220b7d2dea94f1c7967d72bfb06c884d72852692f04"},"schema_version":"1.0","source":{"id":"1904.05300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05300","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05300v1","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05300","created_at":"2026-05-17T23:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"AO4GWK6F2YLA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AO4GWK6F2YLA4DHN","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AO4GWK6F","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:278cec442a28905a276c1e5efafd23460b448af3661bbc589a03d523a4e60fcd","target":"graph","created_at":"2026-05-17T23:48:53Z","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":"Uncertain, or probabilistic, graphs have been increasingly used to represent noisy linked data in many emerging applications, and have recently attracted the attention of the database research community. A fundamental problem on uncertain graphs is the s-t reliability, which measures the probability that a target node t is reachable from a source node s in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of existence.\n  Due to the inherent complexity of the s-t reliability estimation problem (#P-hard), various sampling and indexing based efficient ","authors_text":"Arijit Khan, Leroy Lim Hong Quan, Xiangyu Ke","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-10T17:03:55Z","title":"An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05300","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:107aa5815da9d4f52b73609229d123bd57182f272deda556222a59782bd65eb4","target":"record","created_at":"2026-05-17T23:48:53Z","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":"13bcabb2dc2e9cdad5ea90a57856559f09186507b0f53231fa8805eb8ff0dbff","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-10T17:03:55Z","title_canon_sha256":"ef83391a56b3055237e8b220b7d2dea94f1c7967d72bfb06c884d72852692f04"},"schema_version":"1.0","source":{"id":"1904.05300","kind":"arxiv","version":1}},"canonical_sha256":"03b86b2bc5d6160e0cedabcf1d5fe6f64acbd071847042f75459cf245a958430","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03b86b2bc5d6160e0cedabcf1d5fe6f64acbd071847042f75459cf245a958430","first_computed_at":"2026-05-17T23:48:53.558294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:53.558294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oNPTkWIFgWTXp48aFMbPcaTJuIKQSICp6ypNXE915Cs1/nXGB2WHT+SsyWn+IcGxEbBGXFf4xGGSz2KYXRGHAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:53.558833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:107aa5815da9d4f52b73609229d123bd57182f272deda556222a59782bd65eb4","sha256:278cec442a28905a276c1e5efafd23460b448af3661bbc589a03d523a4e60fcd"],"state_sha256":"6bbfe86688bffdb7bf335228282514ef06426111664d03522f073a158ba0627c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ndrLdFeh14oyEga4EOj2OWbXtRua93L/XqbtndnFUFbIuJ4gjT/r8G5Exl2Vn00M1Zi6Tw8Zq/4WinZKblrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:30:30.196076Z","bundle_sha256":"94b8ed56d629b6c6c23757f31be49871b601411c917fc1e4f2c282e238893c7d"}}