{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RHKWZY3SGN44NWYYKUVQ5NZWDU","short_pith_number":"pith:RHKWZY3S","canonical_record":{"source":{"id":"1507.08476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-30T12:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"50e2115ac01c9253b2fe42218a8cfb3575f3db0a48ba87433e2c86d69a83a612","abstract_canon_sha256":"a1ed28052afacd58b7f8d5691d9aeb0f16e1f3863aa362a9c5e23606acfeb6da"},"schema_version":"1.0"},"canonical_sha256":"89d56ce3723379c6db18552b0eb7361d08c12dfad16d037198a1a9e4efd952b6","source":{"kind":"arxiv","id":"1507.08476","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08476","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08476v2","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08476","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"RHKWZY3SGN44","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RHKWZY3SGN44NWYY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RHKWZY3S","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RHKWZY3SGN44NWYYKUVQ5NZWDU","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08476","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-30T12:27:17Z","cross_cats_sorted":[],"title_canon_sha256":"50e2115ac01c9253b2fe42218a8cfb3575f3db0a48ba87433e2c86d69a83a612","abstract_canon_sha256":"a1ed28052afacd58b7f8d5691d9aeb0f16e1f3863aa362a9c5e23606acfeb6da"},"schema_version":"1.0"},"canonical_sha256":"89d56ce3723379c6db18552b0eb7361d08c12dfad16d037198a1a9e4efd952b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:11.920904Z","signature_b64":"F3ORp5rqzgv2vu96iYddh0GHizCD8p395POTbT/FqjZX8myLs8wGHDhbGV2kaj1gv9rP61toWUeOzdPb2/lTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89d56ce3723379c6db18552b0eb7361d08c12dfad16d037198a1a9e4efd952b6","last_reissued_at":"2026-05-18T01:19:11.920272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:11.920272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08476","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:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVyQwXCMXbFf9RW5a/pnBunPCbDzrT4QD5Mv4hvFe4Nn61mq3CF0xCnBEv7AgEQWsb6/Wv/CqMqUFvG7QSkNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:59:25.432454Z"},"content_sha256":"4c312183199c4f161e40e9980f8e79440a29e03184ac9156d79f0bbb20c66255","schema_version":"1.0","event_id":"sha256:4c312183199c4f161e40e9980f8e79440a29e03184ac9156d79f0bbb20c66255"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RHKWZY3SGN44NWYYKUVQ5NZWDU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource location based on precomputed partial random walks in dynamic networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Antonio Fern\\'andez Anta, Luis L\\'opez, Vicent Cholvi, V\\'ictor M. L\\'opez Mill\\'an","submitted_at":"2015-07-30T12:27:17Z","abstract_excerpt":"The problem of finding a resource residing in a network node (the \\emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially difficult if no requirements on the resource placement strategy or the network structure are to be imposed, assuming of course that keeping centralized resource information is not feasible or appropriate. Under these conditions, random algorithms are useful to search the network. A possible strategy for static networks, proposed in previous work, uses short"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08476","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:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTrpDtm8CnjgjVaNTk2wpq6bwG0tarziDydxpi00WM8N3tcbyxA8lINtGQ360wz+vycRuflErpbqjbs7B5soAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:59:25.432800Z"},"content_sha256":"bf42cb9b25f73a846478bbbf5d362dd69a6e0a64fb90e3296dea6bc92409e361","schema_version":"1.0","event_id":"sha256:bf42cb9b25f73a846478bbbf5d362dd69a6e0a64fb90e3296dea6bc92409e361"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU/bundle.json","state_url":"https://pith.science/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU/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-23T22:59:25Z","links":{"resolver":"https://pith.science/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU","bundle":"https://pith.science/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU/bundle.json","state":"https://pith.science/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RHKWZY3SGN44NWYYKUVQ5NZWDU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RHKWZY3SGN44NWYYKUVQ5NZWDU","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":"a1ed28052afacd58b7f8d5691d9aeb0f16e1f3863aa362a9c5e23606acfeb6da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-30T12:27:17Z","title_canon_sha256":"50e2115ac01c9253b2fe42218a8cfb3575f3db0a48ba87433e2c86d69a83a612"},"schema_version":"1.0","source":{"id":"1507.08476","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08476","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08476v2","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08476","created_at":"2026-05-18T01:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"RHKWZY3SGN44","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RHKWZY3SGN44NWYY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RHKWZY3S","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:bf42cb9b25f73a846478bbbf5d362dd69a6e0a64fb90e3296dea6bc92409e361","target":"graph","created_at":"2026-05-18T01:19:11Z","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":"The problem of finding a resource residing in a network node (the \\emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially difficult if no requirements on the resource placement strategy or the network structure are to be imposed, assuming of course that keeping centralized resource information is not feasible or appropriate. Under these conditions, random algorithms are useful to search the network. A possible strategy for static networks, proposed in previous work, uses short","authors_text":"Antonio Fern\\'andez Anta, Luis L\\'opez, Vicent Cholvi, V\\'ictor M. L\\'opez Mill\\'an","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-30T12:27:17Z","title":"Resource location based on precomputed partial random walks in dynamic networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08476","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:4c312183199c4f161e40e9980f8e79440a29e03184ac9156d79f0bbb20c66255","target":"record","created_at":"2026-05-18T01:19:11Z","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":"a1ed28052afacd58b7f8d5691d9aeb0f16e1f3863aa362a9c5e23606acfeb6da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-30T12:27:17Z","title_canon_sha256":"50e2115ac01c9253b2fe42218a8cfb3575f3db0a48ba87433e2c86d69a83a612"},"schema_version":"1.0","source":{"id":"1507.08476","kind":"arxiv","version":2}},"canonical_sha256":"89d56ce3723379c6db18552b0eb7361d08c12dfad16d037198a1a9e4efd952b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89d56ce3723379c6db18552b0eb7361d08c12dfad16d037198a1a9e4efd952b6","first_computed_at":"2026-05-18T01:19:11.920272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:11.920272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F3ORp5rqzgv2vu96iYddh0GHizCD8p395POTbT/FqjZX8myLs8wGHDhbGV2kaj1gv9rP61toWUeOzdPb2/lTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:11.920904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08476","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c312183199c4f161e40e9980f8e79440a29e03184ac9156d79f0bbb20c66255","sha256:bf42cb9b25f73a846478bbbf5d362dd69a6e0a64fb90e3296dea6bc92409e361"],"state_sha256":"eb2d148f86b48673e519a51c105ced94c4012f2bf0269b157d1812435b1060c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKC6wCLupLSmFLLq3lQ1UOaurWAaOZ89Sh34JoHsSss4Lvr1x+XSIGZtYHMp9K1PzFJuCqc+6VFZh5resco1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:59:25.434757Z","bundle_sha256":"87c56f00c5173846a98bae16ade92721cfdacb1ba26584702a74fbf69100d0bd"}}