{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QXW5KB64CNXYYCUNAPFRXYOZCZ","short_pith_number":"pith:QXW5KB64","schema_version":"1.0","canonical_sha256":"85edd507dc136f8c0a8d03cb1be1d91676ac99dd3c23775d5b54f8d8ef45bb49","source":{"kind":"arxiv","id":"1307.3430","version":2},"attestation_state":"computed","paper":{"title":"Characteristic times of biased random walks on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Moreno Bonaventura, Vincenzo Nicosia, Vito Latora","submitted_at":"2013-07-12T12:11:50Z","abstract_excerpt":"We consider degree-biased random walkers whose probability to move from a node to one of its neighbors of degree $k$ is proportional to $k^{\\alpha}$, where $\\alpha$ is a tuning parameter. We study both numerically and analytically three types of characteristic times, namely: i) the time the walker needs to come back to the starting node, ii) the time it takes to visit a given node for the first time, and iii) the time it takes to visit all the nodes of the network. We consider a large data set of real-world networks and we show that the value of $\\alpha$ which minimizes the three characteristi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.3430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-07-12T12:11:50Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"46f0db1706864ba195aebbb6a769a4c11bfc6e6564810959fe1f22d49ed1983a","abstract_canon_sha256":"b83934feab314c3d54168b5194c14723da39da0f288eb81e20aacfe7049b2fef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:21.851306Z","signature_b64":"jERCgb7bPw0sR0bXP8C68Jqbbn3zDQhlfmL2bFg15aD/1IUVL8encDacGWbiUWvlqpS00vu4pa5tf99gduGdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85edd507dc136f8c0a8d03cb1be1d91676ac99dd3c23775d5b54f8d8ef45bb49","last_reissued_at":"2026-05-18T02:58:21.850808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:21.850808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characteristic times of biased random walks on complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Moreno Bonaventura, Vincenzo Nicosia, Vito Latora","submitted_at":"2013-07-12T12:11:50Z","abstract_excerpt":"We consider degree-biased random walkers whose probability to move from a node to one of its neighbors of degree $k$ is proportional to $k^{\\alpha}$, where $\\alpha$ is a tuning parameter. We study both numerically and analytically three types of characteristic times, namely: i) the time the walker needs to come back to the starting node, ii) the time it takes to visit a given node for the first time, and iii) the time it takes to visit all the nodes of the network. We consider a large data set of real-world networks and we show that the value of $\\alpha$ which minimizes the three characteristi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3430","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.3430","created_at":"2026-05-18T02:58:21.850900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3430v2","created_at":"2026-05-18T02:58:21.850900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3430","created_at":"2026-05-18T02:58:21.850900+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXW5KB64CNXY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXW5KB64CNXYYCUN","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXW5KB64","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ","json":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ.json","graph_json":"https://pith.science/api/pith-number/QXW5KB64CNXYYCUNAPFRXYOZCZ/graph.json","events_json":"https://pith.science/api/pith-number/QXW5KB64CNXYYCUNAPFRXYOZCZ/events.json","paper":"https://pith.science/paper/QXW5KB64"},"agent_actions":{"view_html":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ","download_json":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ.json","view_paper":"https://pith.science/paper/QXW5KB64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3430&json=true","fetch_graph":"https://pith.science/api/pith-number/QXW5KB64CNXYYCUNAPFRXYOZCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/QXW5KB64CNXYYCUNAPFRXYOZCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ/action/storage_attestation","attest_author":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ/action/author_attestation","sign_citation":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ/action/citation_signature","submit_replication":"https://pith.science/pith/QXW5KB64CNXYYCUNAPFRXYOZCZ/action/replication_record"}},"created_at":"2026-05-18T02:58:21.850900+00:00","updated_at":"2026-05-18T02:58:21.850900+00:00"}