{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z4PPMGKZIEWFSKXM3NBRCBZFFI","short_pith_number":"pith:Z4PPMGKZ","canonical_record":{"source":{"id":"1809.08222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-09-21T17:38:42Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"146af411865fb1fa4b4b3dfa9cc5943adf64917dcb48c2b8ba4b010fa3fc9bc8","abstract_canon_sha256":"a6200bf7a9cc3986feaa47f21bb429e5a24cbb2bea9b2f7b51fe3c8f68b5307d"},"schema_version":"1.0"},"canonical_sha256":"cf1ef61959412c592aecdb431107252a2d2253775f21cfbd79b602b17fd20966","source":{"kind":"arxiv","id":"1809.08222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08222","created_at":"2026-05-17T23:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08222v1","created_at":"2026-05-17T23:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08222","created_at":"2026-05-17T23:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"Z4PPMGKZIEWF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4PPMGKZIEWFSKXM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4PPMGKZ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z4PPMGKZIEWFSKXM3NBRCBZFFI","target":"record","payload":{"canonical_record":{"source":{"id":"1809.08222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-09-21T17:38:42Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"146af411865fb1fa4b4b3dfa9cc5943adf64917dcb48c2b8ba4b010fa3fc9bc8","abstract_canon_sha256":"a6200bf7a9cc3986feaa47f21bb429e5a24cbb2bea9b2f7b51fe3c8f68b5307d"},"schema_version":"1.0"},"canonical_sha256":"cf1ef61959412c592aecdb431107252a2d2253775f21cfbd79b602b17fd20966","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:26.701813Z","signature_b64":"y9axcFAaM2LqUe5T42qWTqQUEdkDU8j8bHvFRQWh0P+LC+i3tptq3aZi4b0bfupBW1abPe++tzxYeWRpIwkLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf1ef61959412c592aecdb431107252a2d2253775f21cfbd79b602b17fd20966","last_reissued_at":"2026-05-17T23:53:26.700930Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:26.700930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.08222","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:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlTwUjy71qapvrh4a1FSqkFAj2wtVYnkJvr8LaVATd3N9w8fFE0/Wnv6bMvIgUaaPiaB+hsDYbVAVdq67Qd9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:57:33.750759Z"},"content_sha256":"469d999e63649628213794d9e3e8f358860b5a7a25a05b5fd695c574c17c8c29","schema_version":"1.0","event_id":"sha256:469d999e63649628213794d9e3e8f358860b5a7a25a05b5fd695c574c17c8c29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z4PPMGKZIEWFSKXM3NBRCBZFFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Random Walk Perspective on Hide-and-Seek Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"physics.soc-ph","authors_text":"Reimer Kuehn, Shubham Pandey","submitted_at":"2018-09-21T17:38:42Z","abstract_excerpt":"We investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of vertices of a random graph. Vertices at which items are hidden in the network are chosen at random as well, though with probabilities that may depend on degree. We pitch various hide and seek strategies against each other, and determine the efficiency of search strategies by computing the average number of hidden items that a searcher will uncover in a rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08222","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:53:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/czRWt6SUw310UyBvUI5msAoe/R4XUklJZY/nDOpQoW+IDWWToDDSrT0/CvrzmjVY60vgVAlyL6jDxeKDGkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:57:33.751104Z"},"content_sha256":"7b3f9ff5ae233bdbb23b1152c8c75d1b8f16516402370e4feb2797785bfd2273","schema_version":"1.0","event_id":"sha256:7b3f9ff5ae233bdbb23b1152c8c75d1b8f16516402370e4feb2797785bfd2273"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI/bundle.json","state_url":"https://pith.science/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI/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-22T12:57:33Z","links":{"resolver":"https://pith.science/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI","bundle":"https://pith.science/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI/bundle.json","state":"https://pith.science/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4PPMGKZIEWFSKXM3NBRCBZFFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z4PPMGKZIEWFSKXM3NBRCBZFFI","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":"a6200bf7a9cc3986feaa47f21bb429e5a24cbb2bea9b2f7b51fe3c8f68b5307d","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-09-21T17:38:42Z","title_canon_sha256":"146af411865fb1fa4b4b3dfa9cc5943adf64917dcb48c2b8ba4b010fa3fc9bc8"},"schema_version":"1.0","source":{"id":"1809.08222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.08222","created_at":"2026-05-17T23:53:26Z"},{"alias_kind":"arxiv_version","alias_value":"1809.08222v1","created_at":"2026-05-17T23:53:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08222","created_at":"2026-05-17T23:53:26Z"},{"alias_kind":"pith_short_12","alias_value":"Z4PPMGKZIEWF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4PPMGKZIEWFSKXM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4PPMGKZ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:7b3f9ff5ae233bdbb23b1152c8c75d1b8f16516402370e4feb2797785bfd2273","target":"graph","created_at":"2026-05-17T23:53: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 investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of vertices of a random graph. Vertices at which items are hidden in the network are chosen at random as well, though with probabilities that may depend on degree. We pitch various hide and seek strategies against each other, and determine the efficiency of search strategies by computing the average number of hidden items that a searcher will uncover in a rand","authors_text":"Reimer Kuehn, Shubham Pandey","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-09-21T17:38:42Z","title":"A Random Walk Perspective on Hide-and-Seek Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08222","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:469d999e63649628213794d9e3e8f358860b5a7a25a05b5fd695c574c17c8c29","target":"record","created_at":"2026-05-17T23:53: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":"a6200bf7a9cc3986feaa47f21bb429e5a24cbb2bea9b2f7b51fe3c8f68b5307d","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-09-21T17:38:42Z","title_canon_sha256":"146af411865fb1fa4b4b3dfa9cc5943adf64917dcb48c2b8ba4b010fa3fc9bc8"},"schema_version":"1.0","source":{"id":"1809.08222","kind":"arxiv","version":1}},"canonical_sha256":"cf1ef61959412c592aecdb431107252a2d2253775f21cfbd79b602b17fd20966","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf1ef61959412c592aecdb431107252a2d2253775f21cfbd79b602b17fd20966","first_computed_at":"2026-05-17T23:53:26.700930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:26.700930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9axcFAaM2LqUe5T42qWTqQUEdkDU8j8bHvFRQWh0P+LC+i3tptq3aZi4b0bfupBW1abPe++tzxYeWRpIwkLDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:26.701813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.08222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:469d999e63649628213794d9e3e8f358860b5a7a25a05b5fd695c574c17c8c29","sha256:7b3f9ff5ae233bdbb23b1152c8c75d1b8f16516402370e4feb2797785bfd2273"],"state_sha256":"a890f58fdd3c705552bbbb0422736f43544ae3e29b1bc930288c5d7318bc3d8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYwcwamyJ5pSlj5SrFMl1mkRs9UG0mlxQZILjE+56v80K+8/2F/61UTbEZNBySLv8Tc5IQb0rYUTPszty+K0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:57:33.753117Z","bundle_sha256":"da514b5acc9d8c07af4457fa3d845b8856d796fe4db8632b0148d64339093dad"}}