{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7D4RYHCXPMW5XO7727HAANOD67","short_pith_number":"pith:7D4RYHCX","canonical_record":{"source":{"id":"1008.4980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-30T01:28:31Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"c2c279b54696fe6d1894ecf4f48436091bfa05325d58190939e3ce281928ecb1","abstract_canon_sha256":"960e2df4e441f71936e36295ae48a9f70c77cd5cc453f5a218cdc8c9eab023a5"},"schema_version":"1.0"},"canonical_sha256":"f8f91c1c577b2ddbbbffd7ce0035c3f7dacb36998cf4217380b83138d3cabde9","source":{"kind":"arxiv","id":"1008.4980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4980","created_at":"2026-05-18T02:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4980v1","created_at":"2026-05-18T02:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4980","created_at":"2026-05-18T02:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"7D4RYHCXPMW5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7D4RYHCXPMW5XO77","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7D4RYHCX","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7D4RYHCXPMW5XO7727HAANOD67","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-30T01:28:31Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"c2c279b54696fe6d1894ecf4f48436091bfa05325d58190939e3ce281928ecb1","abstract_canon_sha256":"960e2df4e441f71936e36295ae48a9f70c77cd5cc453f5a218cdc8c9eab023a5"},"schema_version":"1.0"},"canonical_sha256":"f8f91c1c577b2ddbbbffd7ce0035c3f7dacb36998cf4217380b83138d3cabde9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:41.618275Z","signature_b64":"wGQnUOIUXeEc23m9PsalnnrRLEF63Z5/RU5pLMIBFLWAAQjcxpLj7xdFvibEWlm28mR51pENXc2/HAftPa2DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8f91c1c577b2ddbbbffd7ce0035c3f7dacb36998cf4217380b83138d3cabde9","last_reissued_at":"2026-05-18T02:05:41.617600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:41.617600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4980","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-18T02:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwTWxsuq8S/nGMrwWSSUefU8BkZ/rDG7eJ+ZiMpvmkrmleEUalPEZZBaC+uN1oD7JTl0DFzjrq4snCcFWN9jBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:13:42.329009Z"},"content_sha256":"7edd8ef94998928db9ded8371c9f0b10d7c44baa4090652cfea78c4d9d6127a0","schema_version":"1.0","event_id":"sha256:7edd8ef94998928db9ded8371c9f0b10d7c44baa4090652cfea78c4d9d6127a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7D4RYHCXPMW5XO7727HAANOD67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Discovery by Generalized Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"A. Asztalos, Z. Toroczkai","submitted_at":"2010-08-30T01:28:31Z","abstract_excerpt":"We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling $\\sim n^{\\lambda}$ as function of time $n$. Therefore, edge exploration on graphs with many loops is always lagging compared to site exploration, the revealed graph being sparse until almost all nodes have been"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4980","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-18T02:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgX7WPaWatCe0g8q9gejdukC2JrKJfnWGb+K2VckLuMLnFMqtBedws8EFb/LWVABQxpKTTHfP/acwdztUzhXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:13:42.329691Z"},"content_sha256":"53b88c8c863afb0f034ba85d3b0e2f587d4df2eb51b535b234d91c1b12b0f39a","schema_version":"1.0","event_id":"sha256:53b88c8c863afb0f034ba85d3b0e2f587d4df2eb51b535b234d91c1b12b0f39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7D4RYHCXPMW5XO7727HAANOD67/bundle.json","state_url":"https://pith.science/pith/7D4RYHCXPMW5XO7727HAANOD67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7D4RYHCXPMW5XO7727HAANOD67/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-08T16:13:42Z","links":{"resolver":"https://pith.science/pith/7D4RYHCXPMW5XO7727HAANOD67","bundle":"https://pith.science/pith/7D4RYHCXPMW5XO7727HAANOD67/bundle.json","state":"https://pith.science/pith/7D4RYHCXPMW5XO7727HAANOD67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7D4RYHCXPMW5XO7727HAANOD67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7D4RYHCXPMW5XO7727HAANOD67","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":"960e2df4e441f71936e36295ae48a9f70c77cd5cc453f5a218cdc8c9eab023a5","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-30T01:28:31Z","title_canon_sha256":"c2c279b54696fe6d1894ecf4f48436091bfa05325d58190939e3ce281928ecb1"},"schema_version":"1.0","source":{"id":"1008.4980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4980","created_at":"2026-05-18T02:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4980v1","created_at":"2026-05-18T02:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4980","created_at":"2026-05-18T02:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"7D4RYHCXPMW5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7D4RYHCXPMW5XO77","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7D4RYHCX","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:53b88c8c863afb0f034ba85d3b0e2f587d4df2eb51b535b234d91c1b12b0f39a","target":"graph","created_at":"2026-05-18T02:05:41Z","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 network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling $\\sim n^{\\lambda}$ as function of time $n$. Therefore, edge exploration on graphs with many loops is always lagging compared to site exploration, the revealed graph being sparse until almost all nodes have been","authors_text":"A. Asztalos, Z. Toroczkai","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-30T01:28:31Z","title":"Network Discovery by Generalized Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4980","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:7edd8ef94998928db9ded8371c9f0b10d7c44baa4090652cfea78c4d9d6127a0","target":"record","created_at":"2026-05-18T02:05:41Z","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":"960e2df4e441f71936e36295ae48a9f70c77cd5cc453f5a218cdc8c9eab023a5","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-08-30T01:28:31Z","title_canon_sha256":"c2c279b54696fe6d1894ecf4f48436091bfa05325d58190939e3ce281928ecb1"},"schema_version":"1.0","source":{"id":"1008.4980","kind":"arxiv","version":1}},"canonical_sha256":"f8f91c1c577b2ddbbbffd7ce0035c3f7dacb36998cf4217380b83138d3cabde9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8f91c1c577b2ddbbbffd7ce0035c3f7dacb36998cf4217380b83138d3cabde9","first_computed_at":"2026-05-18T02:05:41.617600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:41.617600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wGQnUOIUXeEc23m9PsalnnrRLEF63Z5/RU5pLMIBFLWAAQjcxpLj7xdFvibEWlm28mR51pENXc2/HAftPa2DAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:41.618275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7edd8ef94998928db9ded8371c9f0b10d7c44baa4090652cfea78c4d9d6127a0","sha256:53b88c8c863afb0f034ba85d3b0e2f587d4df2eb51b535b234d91c1b12b0f39a"],"state_sha256":"d5286a0425da7690e46c50c7c2dc8482c5df50d6cbcc06843d2c5155ecc60457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AoPsxihfKQ/e8lu6i0ew9aOq3eGT3bpKrwEHSGjCX30a6hOTO1f+0mEFdc5GMi05ZxvOA8SdtHrUOkPtnPrZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:13:42.333908Z","bundle_sha256":"e7a529cde9771b811fbc6d63bcb5da8e7494494db14b2cdc8be7985b553b805f"}}