{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:43RBOGJDIHBFQD2C6XAONBB5FM","short_pith_number":"pith:43RBOGJD","schema_version":"1.0","canonical_sha256":"e6e217192341c2580f42f5c0e6843d2b1f7d47464f3d59c9297b0c46c511b971","source":{"kind":"arxiv","id":"1510.01814","version":1},"attestation_state":"computed","paper":{"title":"Source Localization in Networks: Trees and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Kai Zhu, Lei Ying","submitted_at":"2015-10-07T03:58:54Z","abstract_excerpt":"Information diffusion in networks can be used to model many real-world phenomena, including rumor spreading on online social networks, epidemics in human beings, and malware on the Internet. Informally speaking, the source localization problem is to identify a node in the network that provides the best explanation of the observed diffusion. Despite significant efforts and successes over last few years, theoretical guarantees of source localization algorithms were established only for tree networks due to the complexity of the problem. This paper presents a new source localization algorithm, ca"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.01814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-07T03:58:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ac6733daf50632a4367f2480374e0ebfd49f37446891daf7dc4d9cc2c021e6dc","abstract_canon_sha256":"89945cdf098602ead1148c38291073ab0b20d37e0b434608cb66af6c0c3a61cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:50.331363Z","signature_b64":"1meU6ry4We+4dKQirMY7QXbRUPtQ+yv4Tweb+ODBEN8Mb2qezxtpYgxA+hNRQiPLj9i6W6IAdB8cq3RBmarJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6e217192341c2580f42f5c0e6843d2b1f7d47464f3d59c9297b0c46c511b971","last_reissued_at":"2026-05-18T01:30:50.330868Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:50.330868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Source Localization in Networks: Trees and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Kai Zhu, Lei Ying","submitted_at":"2015-10-07T03:58:54Z","abstract_excerpt":"Information diffusion in networks can be used to model many real-world phenomena, including rumor spreading on online social networks, epidemics in human beings, and malware on the Internet. Informally speaking, the source localization problem is to identify a node in the network that provides the best explanation of the observed diffusion. Despite significant efforts and successes over last few years, theoretical guarantees of source localization algorithms were established only for tree networks due to the complexity of the problem. This paper presents a new source localization algorithm, ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01814","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.01814","created_at":"2026-05-18T01:30:50.330950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01814v1","created_at":"2026-05-18T01:30:50.330950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01814","created_at":"2026-05-18T01:30:50.330950+00:00"},{"alias_kind":"pith_short_12","alias_value":"43RBOGJDIHBF","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"43RBOGJDIHBFQD2C","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"43RBOGJD","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM","json":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM.json","graph_json":"https://pith.science/api/pith-number/43RBOGJDIHBFQD2C6XAONBB5FM/graph.json","events_json":"https://pith.science/api/pith-number/43RBOGJDIHBFQD2C6XAONBB5FM/events.json","paper":"https://pith.science/paper/43RBOGJD"},"agent_actions":{"view_html":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM","download_json":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM.json","view_paper":"https://pith.science/paper/43RBOGJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01814&json=true","fetch_graph":"https://pith.science/api/pith-number/43RBOGJDIHBFQD2C6XAONBB5FM/graph.json","fetch_events":"https://pith.science/api/pith-number/43RBOGJDIHBFQD2C6XAONBB5FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM/action/storage_attestation","attest_author":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM/action/author_attestation","sign_citation":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM/action/citation_signature","submit_replication":"https://pith.science/pith/43RBOGJDIHBFQD2C6XAONBB5FM/action/replication_record"}},"created_at":"2026-05-18T01:30:50.330950+00:00","updated_at":"2026-05-18T01:30:50.330950+00:00"}