{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QY6QMDJ4LFZ3USCB5IKUILQCKP","short_pith_number":"pith:QY6QMDJ4","canonical_record":{"source":{"id":"1110.6230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T01:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"919071cb1720e6156e1561860733996c08cc910e31af64c948142d8265cd7e04","abstract_canon_sha256":"a1def5e9c7133847a3902a3e75d8eecbab2b49d5abc35cf07961f6c323678abc"},"schema_version":"1.0"},"canonical_sha256":"863d060d3c5973ba4841ea15442e0253fd232824773572e705dfbf35a07e8205","source":{"kind":"arxiv","id":"1110.6230","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6230","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6230v3","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6230","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"QY6QMDJ4LFZ3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY6QMDJ4LFZ3USCB","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY6QMDJ4","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QY6QMDJ4LFZ3USCB5IKUILQCKP","target":"record","payload":{"canonical_record":{"source":{"id":"1110.6230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T01:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"919071cb1720e6156e1561860733996c08cc910e31af64c948142d8265cd7e04","abstract_canon_sha256":"a1def5e9c7133847a3902a3e75d8eecbab2b49d5abc35cf07961f6c323678abc"},"schema_version":"1.0"},"canonical_sha256":"863d060d3c5973ba4841ea15442e0253fd232824773572e705dfbf35a07e8205","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.337403Z","signature_b64":"hY8BJK6uI82L70WEuIizAz/6AMZqjzkq3UDdY99eLxlJ2FKy4H0y353613+PUREth6fuliP1aP4tyjkCICXhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863d060d3c5973ba4841ea15442e0253fd232824773572e705dfbf35a07e8205","last_reissued_at":"2026-05-18T01:28:06.336701Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.336701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.6230","source_version":3,"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:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFO2AgR/m4VoyiCHUiutEzamlqsJiNGE/LzwT52Nn5Teaux8TTsbPc2rh0o0AxcEX41zTO84nwtq5JYylEdtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:15:46.460146Z"},"content_sha256":"b904075697f1eff8c7432951c9a8271e06afe7b0e87dc9e1e3a519e432660d8f","schema_version":"1.0","event_id":"sha256:b904075697f1eff8c7432951c9a8271e06afe7b0e87dc9e1e3a519e432660d8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QY6QMDJ4LFZ3USCB5IKUILQCKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Rumor Sources on Random Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Devavrat Shah, Tauhid Zaman","submitted_at":"2011-10-28T01:39:18Z","abstract_excerpt":"We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with\n  the rumor and with no information as to \\emph{when} these nodes became infected. In a recent work \\citep{ref:rc} this rumor source detection problem was introduced and studied. The authors proposed the graph score function {\\em rumor centrality} as an estimator for detecting the source. They establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected (SI) model with exponential spreading times for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6230","kind":"arxiv","version":3},"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:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYH4BKaccinD3XGDU7Kq7ywaeWAvqD8T6mKcU+Ifi2kuaioAzuVzMKJEjAQk8rVHq+BJgDKVbFeNNFQidDlTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:15:46.460804Z"},"content_sha256":"8c0bbaef11443b1da3512d7daa73d9bebcc9c447789316c3cb97f3b7a6e83f06","schema_version":"1.0","event_id":"sha256:8c0bbaef11443b1da3512d7daa73d9bebcc9c447789316c3cb97f3b7a6e83f06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP/bundle.json","state_url":"https://pith.science/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP/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-27T10:15:46Z","links":{"resolver":"https://pith.science/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP","bundle":"https://pith.science/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP/bundle.json","state":"https://pith.science/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY6QMDJ4LFZ3USCB5IKUILQCKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QY6QMDJ4LFZ3USCB5IKUILQCKP","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":"a1def5e9c7133847a3902a3e75d8eecbab2b49d5abc35cf07961f6c323678abc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T01:39:18Z","title_canon_sha256":"919071cb1720e6156e1561860733996c08cc910e31af64c948142d8265cd7e04"},"schema_version":"1.0","source":{"id":"1110.6230","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.6230","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1110.6230v3","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.6230","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"QY6QMDJ4LFZ3","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY6QMDJ4LFZ3USCB","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY6QMDJ4","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:8c0bbaef11443b1da3512d7daa73d9bebcc9c447789316c3cb97f3b7a6e83f06","target":"graph","created_at":"2026-05-18T01:28:06Z","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":"We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with\n  the rumor and with no information as to \\emph{when} these nodes became infected. In a recent work \\citep{ref:rc} this rumor source detection problem was introduced and studied. The authors proposed the graph score function {\\em rumor centrality} as an estimator for detecting the source. They establish it to be the maximum likelihood estimator with respect to the popular Susceptible Infected (SI) model with exponential spreading times for ","authors_text":"Devavrat Shah, Tauhid Zaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T01:39:18Z","title":"Finding Rumor Sources on Random Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.6230","kind":"arxiv","version":3},"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:b904075697f1eff8c7432951c9a8271e06afe7b0e87dc9e1e3a519e432660d8f","target":"record","created_at":"2026-05-18T01:28:06Z","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":"a1def5e9c7133847a3902a3e75d8eecbab2b49d5abc35cf07961f6c323678abc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-28T01:39:18Z","title_canon_sha256":"919071cb1720e6156e1561860733996c08cc910e31af64c948142d8265cd7e04"},"schema_version":"1.0","source":{"id":"1110.6230","kind":"arxiv","version":3}},"canonical_sha256":"863d060d3c5973ba4841ea15442e0253fd232824773572e705dfbf35a07e8205","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"863d060d3c5973ba4841ea15442e0253fd232824773572e705dfbf35a07e8205","first_computed_at":"2026-05-18T01:28:06.336701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:06.336701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hY8BJK6uI82L70WEuIizAz/6AMZqjzkq3UDdY99eLxlJ2FKy4H0y353613+PUREth6fuliP1aP4tyjkCICXhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:06.337403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.6230","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b904075697f1eff8c7432951c9a8271e06afe7b0e87dc9e1e3a519e432660d8f","sha256:8c0bbaef11443b1da3512d7daa73d9bebcc9c447789316c3cb97f3b7a6e83f06"],"state_sha256":"7d3e0b2e744ccf7261988ba8c83906adb52cb1e6ecb3715a9d0792f68f153451"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+n1hhKdpEH1q6TrWz2p8hn5YjKxtCAYjdhzxL6yMF/osA1QGl4DWOK1XiWaoWqCgQSUCgPMID7yY934ZPToDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:15:46.464078Z","bundle_sha256":"b9709ba04094a3e1566a2b6c6b7da131b31ba64bf04ace9b74b2072dc8a7c3e2"}}