{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2CH4VR6VURDWKR2MOH3LTYHO4U","short_pith_number":"pith:2CH4VR6V","canonical_record":{"source":{"id":"1203.1439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2012-03-07T11:17:23Z","cross_cats_sorted":["cond-mat.dis-nn","cs.SI","physics.soc-ph"],"title_canon_sha256":"34904dc9b396cdb9aea615fd212ec2073222e809509a8e9458af6ab9588b69a2","abstract_canon_sha256":"6c32712e3e9053ca013ec137a6d11377f63c38e4957893bb49803a0308711dac"},"schema_version":"1.0"},"canonical_sha256":"d08fcac7d5a44765474c71f6b9e0eee503d9eb996347b6bbd6857502cadb45ad","source":{"kind":"arxiv","id":"1203.1439","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1439","created_at":"2026-05-18T01:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1439v2","created_at":"2026-05-18T01:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1439","created_at":"2026-05-18T01:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"2CH4VR6VURDW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2CH4VR6VURDWKR2M","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2CH4VR6V","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2CH4VR6VURDWKR2MOH3LTYHO4U","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2012-03-07T11:17:23Z","cross_cats_sorted":["cond-mat.dis-nn","cs.SI","physics.soc-ph"],"title_canon_sha256":"34904dc9b396cdb9aea615fd212ec2073222e809509a8e9458af6ab9588b69a2","abstract_canon_sha256":"6c32712e3e9053ca013ec137a6d11377f63c38e4957893bb49803a0308711dac"},"schema_version":"1.0"},"canonical_sha256":"d08fcac7d5a44765474c71f6b9e0eee503d9eb996347b6bbd6857502cadb45ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:13.809729Z","signature_b64":"mzOM0z+dv2mMRJ42EoS0pXrPoPxiPUi/EfHFLhbLgGH85rFTSMV0zHI+J7mVnH6JdQ45wyl1UzgizGp4qS2bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d08fcac7d5a44765474c71f6b9e0eee503d9eb996347b6bbd6857502cadb45ad","last_reissued_at":"2026-05-18T01:58:13.809156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:13.809156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1439","source_version":2,"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-18T01:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmzkYUboumYl8mqCfcHvwMffdkrfb5rTHTx9QaOeaK05QfbyIu30ZZLatqxspDTUNY1284V5sAcm1XtEJPwHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:14.878851Z"},"content_sha256":"c238aafdd8456829e90f265286bc0d5ac7b8c5a2b9dfe2d08fe9d36c22d234ba","schema_version":"1.0","event_id":"sha256:c238aafdd8456829e90f265286bc0d5ac7b8c5a2b9dfe2d08fe9d36c22d234ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2CH4VR6VURDWKR2MOH3LTYHO4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring complex networks by means of adaptive walkers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.SI","physics.soc-ph"],"primary_cat":"nlin.AO","authors_text":"Albert Diaz-Guilera, Luce Prignano, Yamir Moreno","submitted_at":"2012-03-07T11:17:23Z","abstract_excerpt":"Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise, no data is retrieved. Consequently, at each time step, the walkers, with some probability, have the choice to either go backward approaching their home or go farther away. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1439","kind":"arxiv","version":2},"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-18T01:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6R9Ha1yA1oQ2u99dtJmOl7Y2FDfYo5a/2EeyASbrCPvSx7n8/tdeivWT6iBJPp1T0Au+NG5lYUVkeLP93FXFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:22:14.879197Z"},"content_sha256":"1d6354754c542622dc96e4e0ad5be7c787992f53d8070e97470800fae309e72a","schema_version":"1.0","event_id":"sha256:1d6354754c542622dc96e4e0ad5be7c787992f53d8070e97470800fae309e72a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CH4VR6VURDWKR2MOH3LTYHO4U/bundle.json","state_url":"https://pith.science/pith/2CH4VR6VURDWKR2MOH3LTYHO4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CH4VR6VURDWKR2MOH3LTYHO4U/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-01T22:22:14Z","links":{"resolver":"https://pith.science/pith/2CH4VR6VURDWKR2MOH3LTYHO4U","bundle":"https://pith.science/pith/2CH4VR6VURDWKR2MOH3LTYHO4U/bundle.json","state":"https://pith.science/pith/2CH4VR6VURDWKR2MOH3LTYHO4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CH4VR6VURDWKR2MOH3LTYHO4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2CH4VR6VURDWKR2MOH3LTYHO4U","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":"6c32712e3e9053ca013ec137a6d11377f63c38e4957893bb49803a0308711dac","cross_cats_sorted":["cond-mat.dis-nn","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2012-03-07T11:17:23Z","title_canon_sha256":"34904dc9b396cdb9aea615fd212ec2073222e809509a8e9458af6ab9588b69a2"},"schema_version":"1.0","source":{"id":"1203.1439","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1439","created_at":"2026-05-18T01:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1439v2","created_at":"2026-05-18T01:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1439","created_at":"2026-05-18T01:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"2CH4VR6VURDW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2CH4VR6VURDWKR2M","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2CH4VR6V","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:1d6354754c542622dc96e4e0ad5be7c787992f53d8070e97470800fae309e72a","target":"graph","created_at":"2026-05-18T01:58:13Z","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":"Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise, no data is retrieved. Consequently, at each time step, the walkers, with some probability, have the choice to either go backward approaching their home or go farther away. We","authors_text":"Albert Diaz-Guilera, Luce Prignano, Yamir Moreno","cross_cats":["cond-mat.dis-nn","cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2012-03-07T11:17:23Z","title":"Exploring complex networks by means of adaptive walkers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1439","kind":"arxiv","version":2},"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:c238aafdd8456829e90f265286bc0d5ac7b8c5a2b9dfe2d08fe9d36c22d234ba","target":"record","created_at":"2026-05-18T01:58:13Z","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":"6c32712e3e9053ca013ec137a6d11377f63c38e4957893bb49803a0308711dac","cross_cats_sorted":["cond-mat.dis-nn","cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2012-03-07T11:17:23Z","title_canon_sha256":"34904dc9b396cdb9aea615fd212ec2073222e809509a8e9458af6ab9588b69a2"},"schema_version":"1.0","source":{"id":"1203.1439","kind":"arxiv","version":2}},"canonical_sha256":"d08fcac7d5a44765474c71f6b9e0eee503d9eb996347b6bbd6857502cadb45ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d08fcac7d5a44765474c71f6b9e0eee503d9eb996347b6bbd6857502cadb45ad","first_computed_at":"2026-05-18T01:58:13.809156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:13.809156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mzOM0z+dv2mMRJ42EoS0pXrPoPxiPUi/EfHFLhbLgGH85rFTSMV0zHI+J7mVnH6JdQ45wyl1UzgizGp4qS2bAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:13.809729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1439","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c238aafdd8456829e90f265286bc0d5ac7b8c5a2b9dfe2d08fe9d36c22d234ba","sha256:1d6354754c542622dc96e4e0ad5be7c787992f53d8070e97470800fae309e72a"],"state_sha256":"6273ac40c295d6254add60722b5d416b8af7fec526b80fe14762fe27c23ea62d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kP46NtwCfkNAUuxOl7tRavqP2SkAdM8xcVNTwAq0lqoRDyypaIYem6/2fkq/vJB00BamU1tDDSUweWgV6CkrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:22:14.881153Z","bundle_sha256":"4d3bc2fca58d99a20cdba015225487aa57166477f20096a9a712b83476028348"}}