{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ACXV2EQKNK555OWTC3HAH5KJV6","short_pith_number":"pith:ACXV2EQK","canonical_record":{"source":{"id":"1701.03259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-01-12T07:21:14Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"7c002b249db2e1b0a0398183bbcee84fdf274645785ffddaa8b680f9ef5753b7","abstract_canon_sha256":"5106f45a6ff904c4c04a4db2d42b08ae917fe3ee0d0d219d0d222963a4a3ee09"},"schema_version":"1.0"},"canonical_sha256":"00af5d120a6abbdebad316ce03f549af86d2f281aeb55f2447c57a7716e19c17","source":{"kind":"arxiv","id":"1701.03259","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03259","created_at":"2026-05-18T00:35:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03259v3","created_at":"2026-05-18T00:35:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03259","created_at":"2026-05-18T00:35:35Z"},{"alias_kind":"pith_short_12","alias_value":"ACXV2EQKNK55","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACXV2EQKNK555OWT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACXV2EQK","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ACXV2EQKNK555OWTC3HAH5KJV6","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03259","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-01-12T07:21:14Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"7c002b249db2e1b0a0398183bbcee84fdf274645785ffddaa8b680f9ef5753b7","abstract_canon_sha256":"5106f45a6ff904c4c04a4db2d42b08ae917fe3ee0d0d219d0d222963a4a3ee09"},"schema_version":"1.0"},"canonical_sha256":"00af5d120a6abbdebad316ce03f549af86d2f281aeb55f2447c57a7716e19c17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:35.002913Z","signature_b64":"ztqK3qfiTtbXE1fWrmddtQQo1+tSgHFlzgoPX4LJoNziI/m0APvW11fBaFi9z+PWyk54nQxOQan9WwmSEcy6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00af5d120a6abbdebad316ce03f549af86d2f281aeb55f2447c57a7716e19c17","last_reissued_at":"2026-05-18T00:35:35.002217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:35.002217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03259","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-18T00:35:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Xi7HDdp+pthkxQhxO22zIvGmn6bjGPRlXfAA3BJZzera4cfi6MU7kTrSOaq5SurZUTuo2QVkcSgOR/zOmKHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:30:27.379399Z"},"content_sha256":"37f7505efb260c690d698e22ccde7805407dbeb6a23dd6d75c9f1d760f593d39","schema_version":"1.0","event_id":"sha256:37f7505efb260c690d698e22ccde7805407dbeb6a23dd6d75c9f1d760f593d39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ACXV2EQKNK555OWTC3HAH5KJV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multitarget search on complex networks: A logarithmic growth of global mean random cover time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Farshid Hassani Bijarbooneh, Jie Zhang, Ji Yang, Michael Small, Pan Hui, Tongfeng Weng","submitted_at":"2017-01-12T07:21:14Z","abstract_excerpt":"We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target number for a broad range of random search processes, including generic random walks, biased random walks, and maximal entropy random walks. We show that the logarithmic growth pattern is a universal feature o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03259","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-18T00:35:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRIRSTInAWg7ya1Ald5gNXsQY4DU5pppxDQ44D8RaeIE9yiUJRCxAN0q8luHbKfP+nl8vZWGk/5rXBjvIOMlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:30:27.380068Z"},"content_sha256":"7da69dc1d50c22438fd32c6b6031c1632d7af34a1437a037f8b7a52f43f3005e","schema_version":"1.0","event_id":"sha256:7da69dc1d50c22438fd32c6b6031c1632d7af34a1437a037f8b7a52f43f3005e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACXV2EQKNK555OWTC3HAH5KJV6/bundle.json","state_url":"https://pith.science/pith/ACXV2EQKNK555OWTC3HAH5KJV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACXV2EQKNK555OWTC3HAH5KJV6/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-23T22:30:27Z","links":{"resolver":"https://pith.science/pith/ACXV2EQKNK555OWTC3HAH5KJV6","bundle":"https://pith.science/pith/ACXV2EQKNK555OWTC3HAH5KJV6/bundle.json","state":"https://pith.science/pith/ACXV2EQKNK555OWTC3HAH5KJV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACXV2EQKNK555OWTC3HAH5KJV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ACXV2EQKNK555OWTC3HAH5KJV6","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":"5106f45a6ff904c4c04a4db2d42b08ae917fe3ee0d0d219d0d222963a4a3ee09","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-01-12T07:21:14Z","title_canon_sha256":"7c002b249db2e1b0a0398183bbcee84fdf274645785ffddaa8b680f9ef5753b7"},"schema_version":"1.0","source":{"id":"1701.03259","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03259","created_at":"2026-05-18T00:35:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03259v3","created_at":"2026-05-18T00:35:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03259","created_at":"2026-05-18T00:35:35Z"},{"alias_kind":"pith_short_12","alias_value":"ACXV2EQKNK55","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ACXV2EQKNK555OWT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ACXV2EQK","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:7da69dc1d50c22438fd32c6b6031c1632d7af34a1437a037f8b7a52f43f3005e","target":"graph","created_at":"2026-05-18T00:35:35Z","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 investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target number for a broad range of random search processes, including generic random walks, biased random walks, and maximal entropy random walks. We show that the logarithmic growth pattern is a universal feature o","authors_text":"Farshid Hassani Bijarbooneh, Jie Zhang, Ji Yang, Michael Small, Pan Hui, Tongfeng Weng","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-01-12T07:21:14Z","title":"Multitarget search on complex networks: A logarithmic growth of global mean random cover time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03259","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:37f7505efb260c690d698e22ccde7805407dbeb6a23dd6d75c9f1d760f593d39","target":"record","created_at":"2026-05-18T00:35:35Z","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":"5106f45a6ff904c4c04a4db2d42b08ae917fe3ee0d0d219d0d222963a4a3ee09","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-01-12T07:21:14Z","title_canon_sha256":"7c002b249db2e1b0a0398183bbcee84fdf274645785ffddaa8b680f9ef5753b7"},"schema_version":"1.0","source":{"id":"1701.03259","kind":"arxiv","version":3}},"canonical_sha256":"00af5d120a6abbdebad316ce03f549af86d2f281aeb55f2447c57a7716e19c17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00af5d120a6abbdebad316ce03f549af86d2f281aeb55f2447c57a7716e19c17","first_computed_at":"2026-05-18T00:35:35.002217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:35.002217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ztqK3qfiTtbXE1fWrmddtQQo1+tSgHFlzgoPX4LJoNziI/m0APvW11fBaFi9z+PWyk54nQxOQan9WwmSEcy6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:35.002913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03259","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37f7505efb260c690d698e22ccde7805407dbeb6a23dd6d75c9f1d760f593d39","sha256:7da69dc1d50c22438fd32c6b6031c1632d7af34a1437a037f8b7a52f43f3005e"],"state_sha256":"03513b78d3dc42ab437d1db6f2174b61cf2e33b0f54726d2c26b21bf2c7c7220"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOqMo6KJK/fu2tSKZaujoIoRf/9qOITOwXZSu8j+8OejdSN5XhvxhfBAhp+9U+2ROKSUFr1A3OVuqAQsWaItAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:30:27.382951Z","bundle_sha256":"a591baddb39a3758a6688924a346e89ef2322b0788d1985eb4dc91119cc2951c"}}