{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:T6WGHVNST56CEQ53MUZVLOY67H","short_pith_number":"pith:T6WGHVNS","canonical_record":{"source":{"id":"1304.5100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-18T12:19:13Z","cross_cats_sorted":[],"title_canon_sha256":"4bd7574e0bdc401468d3423b4cb01d3e2acabddee3cd5dd7b0df809763d4edd9","abstract_canon_sha256":"5ed2babe25385fa17e6604936e2dba715feea54170dac3fa611215677b84656c"},"schema_version":"1.0"},"canonical_sha256":"9fac63d5b29f7c2243bb653355bb1ef9fb9af078fadff808f046debf48fdf1a2","source":{"kind":"arxiv","id":"1304.5100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5100","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5100v1","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5100","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"T6WGHVNST56C","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T6WGHVNST56CEQ53","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T6WGHVNS","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:T6WGHVNST56CEQ53MUZVLOY67H","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-18T12:19:13Z","cross_cats_sorted":[],"title_canon_sha256":"4bd7574e0bdc401468d3423b4cb01d3e2acabddee3cd5dd7b0df809763d4edd9","abstract_canon_sha256":"5ed2babe25385fa17e6604936e2dba715feea54170dac3fa611215677b84656c"},"schema_version":"1.0"},"canonical_sha256":"9fac63d5b29f7c2243bb653355bb1ef9fb9af078fadff808f046debf48fdf1a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:41.782657Z","signature_b64":"kBdkJNU5aVlo8ltJKf/nlyuDFbbMwJrY/CIfmOh4GqU63cpQKfKb4K/GZSa6wNQNwfEzjyVd6570CeiXxVy3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fac63d5b29f7c2243bb653355bb1ef9fb9af078fadff808f046debf48fdf1a2","last_reissued_at":"2026-05-18T03:27:41.782175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:41.782175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5100","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-18T03:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAMw9DtEUO6922FV1SCL81GuxgikqWbCwZ1Q0BkeZZkiJxlIzuVWcFEHC8bT+fkYAxBhNHJr0YZgE4NAuZbXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:41:09.841716Z"},"content_sha256":"50b49904c0eaa6e5c0ba2d79796a3a310e157b952bda1de4a7f1c9a2c349544d","schema_version":"1.0","event_id":"sha256:50b49904c0eaa6e5c0ba2d79796a3a310e157b952bda1de4a7f1c9a2c349544d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:T6WGHVNST56CEQ53MUZVLOY67H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Resource Location with Locally Precomputed Partial Random Walks","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":"2013-04-18T12:19:13Z","abstract_excerpt":"Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node. Resources found in each PW are registered. Searches can then jump over PWs where the resource is not located. However, we assume that perfect recording of resources may be costly, and hence, probabilistic structures like Bloom filters are used. Then, unnecessary hops may come from false positives at the Bloom filters. Two variations of this mechanism have been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5100","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-18T03:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4taqsnfShCKjxEroEUDiexEx4uEy1ANU4Mf+deojqflESxbg+3iBOKbHrKbA737tJZ1tCf08TeK6c6PbYEPCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:41:09.842053Z"},"content_sha256":"4c4d9d7ffec1b4a35ad4ab21b4ebb9d78392146503115641985b4f7af1475977","schema_version":"1.0","event_id":"sha256:4c4d9d7ffec1b4a35ad4ab21b4ebb9d78392146503115641985b4f7af1475977"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6WGHVNST56CEQ53MUZVLOY67H/bundle.json","state_url":"https://pith.science/pith/T6WGHVNST56CEQ53MUZVLOY67H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6WGHVNST56CEQ53MUZVLOY67H/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-23T15:41:09Z","links":{"resolver":"https://pith.science/pith/T6WGHVNST56CEQ53MUZVLOY67H","bundle":"https://pith.science/pith/T6WGHVNST56CEQ53MUZVLOY67H/bundle.json","state":"https://pith.science/pith/T6WGHVNST56CEQ53MUZVLOY67H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6WGHVNST56CEQ53MUZVLOY67H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:T6WGHVNST56CEQ53MUZVLOY67H","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":"5ed2babe25385fa17e6604936e2dba715feea54170dac3fa611215677b84656c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-18T12:19:13Z","title_canon_sha256":"4bd7574e0bdc401468d3423b4cb01d3e2acabddee3cd5dd7b0df809763d4edd9"},"schema_version":"1.0","source":{"id":"1304.5100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5100","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5100v1","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5100","created_at":"2026-05-18T03:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"T6WGHVNST56C","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T6WGHVNST56CEQ53","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T6WGHVNS","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4c4d9d7ffec1b4a35ad4ab21b4ebb9d78392146503115641985b4f7af1475977","target":"graph","created_at":"2026-05-18T03:27: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":"Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node. Resources found in each PW are registered. Searches can then jump over PWs where the resource is not located. However, we assume that perfect recording of resources may be costly, and hence, probabilistic structures like Bloom filters are used. Then, unnecessary hops may come from false positives at the Bloom filters. Two variations of this mechanism have been ","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":"2013-04-18T12:19:13Z","title":"Improving Resource Location with Locally Precomputed Partial Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5100","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:50b49904c0eaa6e5c0ba2d79796a3a310e157b952bda1de4a7f1c9a2c349544d","target":"record","created_at":"2026-05-18T03:27: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":"5ed2babe25385fa17e6604936e2dba715feea54170dac3fa611215677b84656c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-04-18T12:19:13Z","title_canon_sha256":"4bd7574e0bdc401468d3423b4cb01d3e2acabddee3cd5dd7b0df809763d4edd9"},"schema_version":"1.0","source":{"id":"1304.5100","kind":"arxiv","version":1}},"canonical_sha256":"9fac63d5b29f7c2243bb653355bb1ef9fb9af078fadff808f046debf48fdf1a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fac63d5b29f7c2243bb653355bb1ef9fb9af078fadff808f046debf48fdf1a2","first_computed_at":"2026-05-18T03:27:41.782175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:41.782175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kBdkJNU5aVlo8ltJKf/nlyuDFbbMwJrY/CIfmOh4GqU63cpQKfKb4K/GZSa6wNQNwfEzjyVd6570CeiXxVy3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:41.782657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50b49904c0eaa6e5c0ba2d79796a3a310e157b952bda1de4a7f1c9a2c349544d","sha256:4c4d9d7ffec1b4a35ad4ab21b4ebb9d78392146503115641985b4f7af1475977"],"state_sha256":"4f3a2f2424df3f9be885b64a2f028d79dec18d572d1e7960538cfee9887d5728"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXo4rifqTYePyERx+Rnhmu1VGsF8OfeH4WKENteU8lidFsx50b4tfmViTQWDKQMCuDhxKKq8VhX01gvK3BTBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:41:09.843962Z","bundle_sha256":"77b67aa862a31eda2c05c391a7698551ac5e14c9c6f805de680c2523e115b98b"}}