{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LB47DLF4RMCV5WJOYSCRLPGI2J","short_pith_number":"pith:LB47DLF4","canonical_record":{"source":{"id":"1812.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-12-12T17:55:56Z","cross_cats_sorted":["cs.NE","cs.SI"],"title_canon_sha256":"507d4ad7ecfa2c4671c3be7fedcd8dbde82d74cf7e9cd512335bf4e31e19890f","abstract_canon_sha256":"0945894dbd01267ef347553f80c2d5822dc0b41b2472f368c262646270b13539"},"schema_version":"1.0"},"canonical_sha256":"5879f1acbc8b055ed92ec48515bcc8d2717c6f15564beb22ff40fa85d4589608","source":{"kind":"arxiv","id":"1812.05058","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05058","created_at":"2026-05-17T23:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05058v1","created_at":"2026-05-17T23:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05058","created_at":"2026-05-17T23:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"LB47DLF4RMCV","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LB47DLF4RMCV5WJO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LB47DLF4","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LB47DLF4RMCV5WJOYSCRLPGI2J","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-12-12T17:55:56Z","cross_cats_sorted":["cs.NE","cs.SI"],"title_canon_sha256":"507d4ad7ecfa2c4671c3be7fedcd8dbde82d74cf7e9cd512335bf4e31e19890f","abstract_canon_sha256":"0945894dbd01267ef347553f80c2d5822dc0b41b2472f368c262646270b13539"},"schema_version":"1.0"},"canonical_sha256":"5879f1acbc8b055ed92ec48515bcc8d2717c6f15564beb22ff40fa85d4589608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:26.535915Z","signature_b64":"BRhcL+krfZTCYg+zlGGahTMCHlt6lZHNPj6gGtdrM4P8Lwl0tFzIksE9ekhdyujeNO2UU5mYdPwZSzz3YJtDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5879f1acbc8b055ed92ec48515bcc8d2717c6f15564beb22ff40fa85d4589608","last_reissued_at":"2026-05-17T23:58:26.535253Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:26.535253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05058","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:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZg+5Um59qfI6m2iEGFTT6TnrjY17n/DcnRnhunVB2PTq6MD8ejwG1yFTXBB0IUGYk1SnL/e5P0ql5fbs81pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:59:28.912341Z"},"content_sha256":"9e6f3d1dec626035c4d2d86f58d901b38a1d2d8c0d8705ecc544fcf6c3e40ebf","schema_version":"1.0","event_id":"sha256:9e6f3d1dec626035c4d2d86f58d901b38a1d2d8c0d8705ecc544fcf6c3e40ebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LB47DLF4RMCV5WJOYSCRLPGI2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selection of Random Walkers that Optimizes the Global Mean First-Passage Time for Search in Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Kwok Yip Szeto, Mucong Ding","submitted_at":"2018-12-12T17:55:56Z","abstract_excerpt":"We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace transformed formula of the GMFPT, we can equivalently minimize the overlap between the probability distribution of sites visited by the random walkers. We employ a mutation only genetic algorithm to solve this optimization problem using a population of walkers with different starting positions and a corresponding mutation matrix to modify them. The numerical experimen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05058","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:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ozntLezDq/ZOhqRUPjVR9KfQw+YWJSpiSRRdtc9uSM6jjxLo8Z7FGZMAJsWSsX62GNwnTZ/2//2ogdp6FKsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:59:28.912692Z"},"content_sha256":"3925e0b34f7a261bc5df6801f0aaa2b5d6c3d00b0ee57b8192a87cbaa59c5009","schema_version":"1.0","event_id":"sha256:3925e0b34f7a261bc5df6801f0aaa2b5d6c3d00b0ee57b8192a87cbaa59c5009"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LB47DLF4RMCV5WJOYSCRLPGI2J/bundle.json","state_url":"https://pith.science/pith/LB47DLF4RMCV5WJOYSCRLPGI2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LB47DLF4RMCV5WJOYSCRLPGI2J/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-06T18:59:28Z","links":{"resolver":"https://pith.science/pith/LB47DLF4RMCV5WJOYSCRLPGI2J","bundle":"https://pith.science/pith/LB47DLF4RMCV5WJOYSCRLPGI2J/bundle.json","state":"https://pith.science/pith/LB47DLF4RMCV5WJOYSCRLPGI2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LB47DLF4RMCV5WJOYSCRLPGI2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LB47DLF4RMCV5WJOYSCRLPGI2J","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":"0945894dbd01267ef347553f80c2d5822dc0b41b2472f368c262646270b13539","cross_cats_sorted":["cs.NE","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-12-12T17:55:56Z","title_canon_sha256":"507d4ad7ecfa2c4671c3be7fedcd8dbde82d74cf7e9cd512335bf4e31e19890f"},"schema_version":"1.0","source":{"id":"1812.05058","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05058","created_at":"2026-05-17T23:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05058v1","created_at":"2026-05-17T23:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05058","created_at":"2026-05-17T23:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"LB47DLF4RMCV","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"LB47DLF4RMCV5WJO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"LB47DLF4","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:3925e0b34f7a261bc5df6801f0aaa2b5d6c3d00b0ee57b8192a87cbaa59c5009","target":"graph","created_at":"2026-05-17T23:58:26Z","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 design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace transformed formula of the GMFPT, we can equivalently minimize the overlap between the probability distribution of sites visited by the random walkers. We employ a mutation only genetic algorithm to solve this optimization problem using a population of walkers with different starting positions and a corresponding mutation matrix to modify them. The numerical experimen","authors_text":"Kwok Yip Szeto, Mucong Ding","cross_cats":["cs.NE","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-12-12T17:55:56Z","title":"Selection of Random Walkers that Optimizes the Global Mean First-Passage Time for Search in Complex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05058","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:9e6f3d1dec626035c4d2d86f58d901b38a1d2d8c0d8705ecc544fcf6c3e40ebf","target":"record","created_at":"2026-05-17T23:58:26Z","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":"0945894dbd01267ef347553f80c2d5822dc0b41b2472f368c262646270b13539","cross_cats_sorted":["cs.NE","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-12-12T17:55:56Z","title_canon_sha256":"507d4ad7ecfa2c4671c3be7fedcd8dbde82d74cf7e9cd512335bf4e31e19890f"},"schema_version":"1.0","source":{"id":"1812.05058","kind":"arxiv","version":1}},"canonical_sha256":"5879f1acbc8b055ed92ec48515bcc8d2717c6f15564beb22ff40fa85d4589608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5879f1acbc8b055ed92ec48515bcc8d2717c6f15564beb22ff40fa85d4589608","first_computed_at":"2026-05-17T23:58:26.535253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:26.535253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BRhcL+krfZTCYg+zlGGahTMCHlt6lZHNPj6gGtdrM4P8Lwl0tFzIksE9ekhdyujeNO2UU5mYdPwZSzz3YJtDDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:26.535915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05058","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e6f3d1dec626035c4d2d86f58d901b38a1d2d8c0d8705ecc544fcf6c3e40ebf","sha256:3925e0b34f7a261bc5df6801f0aaa2b5d6c3d00b0ee57b8192a87cbaa59c5009"],"state_sha256":"77b3755119d5f4ac9726aa63a95426cb0e3203ac43466076cf75c784db00f661"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JgoAIVVqe0aP/eiQLjStxxxvZfj/3+RbKXtFQLVQgFUFjy2QaVI8F/V1MWpyPcM3/JXA7/wKe2rKg69JSNOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:59:28.914787Z","bundle_sha256":"a7f4a85a86b689a7a6485da891a211c3c622fa32a4c3eaf2e5865b2c7f571f09"}}