{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OB7RW63ESDGPDLO4A2BZUTMSFQ","short_pith_number":"pith:OB7RW63E","canonical_record":{"source":{"id":"1611.06963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-21T19:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"76329932c53df2fc83ceb2835d9f5e3d6ca4c0acd656c83d6ed993855ea58768","abstract_canon_sha256":"9d42b369f57ce69996b511bbbd8dc1b431ecb5de326084d7c1bbb9bd162eca3d"},"schema_version":"1.0"},"canonical_sha256":"707f1b7b6490ccf1addc06839a4d922c166eb6070ca6da8902badb8917427f9f","source":{"kind":"arxiv","id":"1611.06963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06963","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06963v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06963","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"OB7RW63ESDGP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OB7RW63ESDGPDLO4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OB7RW63E","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OB7RW63ESDGPDLO4A2BZUTMSFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-21T19:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"76329932c53df2fc83ceb2835d9f5e3d6ca4c0acd656c83d6ed993855ea58768","abstract_canon_sha256":"9d42b369f57ce69996b511bbbd8dc1b431ecb5de326084d7c1bbb9bd162eca3d"},"schema_version":"1.0"},"canonical_sha256":"707f1b7b6490ccf1addc06839a4d922c166eb6070ca6da8902badb8917427f9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:32.433219Z","signature_b64":"+Y4VxGFAayQVYlnBHTeEtJ2x/7hZaAs87SgIfuU1dSxVvFDv3/KVc900BnwfmdgsQNPQVC9IjlclqWwYD2T1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"707f1b7b6490ccf1addc06839a4d922c166eb6070ca6da8902badb8917427f9f","last_reissued_at":"2026-05-18T00:57:32.432776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:32.432776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06963","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-18T00:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B94TeJGYjrSM/lIm+y0r7ttIaEFbM7bQhzGoPAJwD6AdTmONClEYWItnmM3o2BLrU/C6blxHKcek9AuAEjQACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:14:14.158482Z"},"content_sha256":"bf6a1e01c40ea3252134ead5ab31ac888c3201ce8f86698c56007542afeef92a","schema_version":"1.0","event_id":"sha256:bf6a1e01c40ea3252134ead5ab31ac888c3201ce8f86698c56007542afeef92a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OB7RW63ESDGPDLO4A2BZUTMSFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Catch'Em All: Locating Multiple Diffusion Sources in Networks with Partial Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Kai Zhu, Lei Ying, Zhen Chen","submitted_at":"2016-11-21T19:25:12Z","abstract_excerpt":"This paper studies the problem of locating multiple diffusion sources in networks with partial observations. We propose a new source localization algorithm, named Optimal-Jordan-Cover (OJC). The algorithm first extracts a subgraph using a candidate selection algorithm that selects source candidates based on the number of observed infected nodes in their neighborhoods. Then, in the extracted subgraph, OJC finds a set of nodes that \"cover\" all observed infected nodes with the minimum radius. The set of nodes is called the Jordan cover, and is regarded as the set of diffusion sources. Considering"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06963","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-18T00:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23xIKpSVMBCxHJhGKxWAExCx2fVVh9heg3oaU7c2iJk3QVMYuZjrip8FOVknlkC2i2G7pd5v+nNWXeuqVMldCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:14:14.158938Z"},"content_sha256":"ad81bdf75d7699d475043f7676d9b4f80a88d0d0ddf8d5657efaf4b3e754cadb","schema_version":"1.0","event_id":"sha256:ad81bdf75d7699d475043f7676d9b4f80a88d0d0ddf8d5657efaf4b3e754cadb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ/bundle.json","state_url":"https://pith.science/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ/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-02T04:14:14Z","links":{"resolver":"https://pith.science/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ","bundle":"https://pith.science/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ/bundle.json","state":"https://pith.science/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OB7RW63ESDGPDLO4A2BZUTMSFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OB7RW63ESDGPDLO4A2BZUTMSFQ","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":"9d42b369f57ce69996b511bbbd8dc1b431ecb5de326084d7c1bbb9bd162eca3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-21T19:25:12Z","title_canon_sha256":"76329932c53df2fc83ceb2835d9f5e3d6ca4c0acd656c83d6ed993855ea58768"},"schema_version":"1.0","source":{"id":"1611.06963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06963","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06963v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06963","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"OB7RW63ESDGP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OB7RW63ESDGPDLO4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OB7RW63E","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ad81bdf75d7699d475043f7676d9b4f80a88d0d0ddf8d5657efaf4b3e754cadb","target":"graph","created_at":"2026-05-18T00:57:32Z","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":"This paper studies the problem of locating multiple diffusion sources in networks with partial observations. We propose a new source localization algorithm, named Optimal-Jordan-Cover (OJC). The algorithm first extracts a subgraph using a candidate selection algorithm that selects source candidates based on the number of observed infected nodes in their neighborhoods. Then, in the extracted subgraph, OJC finds a set of nodes that \"cover\" all observed infected nodes with the minimum radius. The set of nodes is called the Jordan cover, and is regarded as the set of diffusion sources. Considering","authors_text":"Kai Zhu, Lei Ying, Zhen Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-21T19:25:12Z","title":"Catch'Em All: Locating Multiple Diffusion Sources in Networks with Partial Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06963","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:bf6a1e01c40ea3252134ead5ab31ac888c3201ce8f86698c56007542afeef92a","target":"record","created_at":"2026-05-18T00:57:32Z","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":"9d42b369f57ce69996b511bbbd8dc1b431ecb5de326084d7c1bbb9bd162eca3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-11-21T19:25:12Z","title_canon_sha256":"76329932c53df2fc83ceb2835d9f5e3d6ca4c0acd656c83d6ed993855ea58768"},"schema_version":"1.0","source":{"id":"1611.06963","kind":"arxiv","version":1}},"canonical_sha256":"707f1b7b6490ccf1addc06839a4d922c166eb6070ca6da8902badb8917427f9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"707f1b7b6490ccf1addc06839a4d922c166eb6070ca6da8902badb8917427f9f","first_computed_at":"2026-05-18T00:57:32.432776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:32.432776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Y4VxGFAayQVYlnBHTeEtJ2x/7hZaAs87SgIfuU1dSxVvFDv3/KVc900BnwfmdgsQNPQVC9IjlclqWwYD2T1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:32.433219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf6a1e01c40ea3252134ead5ab31ac888c3201ce8f86698c56007542afeef92a","sha256:ad81bdf75d7699d475043f7676d9b4f80a88d0d0ddf8d5657efaf4b3e754cadb"],"state_sha256":"9477c2a031072c30cebab8b1c2d0ffc2c1061bebdc2bb944c6449456e03a03a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wcc3q+f1JmLVF2TA0MyDdu9Ik9Vkj2BNoWu/1TR0z2HbZrEuv1zpveQpMfiEJDOGv+Py/X/hX+PDssguJ+EBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:14:14.161025Z","bundle_sha256":"5045b2f1214658941f76cd2da893e0090168ff6928aaa4410e964729c583522c"}}