{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:U5CTHPXD27PCBWIXKRZDZDBEYJ","short_pith_number":"pith:U5CTHPXD","schema_version":"1.0","canonical_sha256":"a74533bee3d7de20d91754723c8c24c25963b9f165f717780ce9b8e945c062b0","source":{"kind":"arxiv","id":"1007.4936","version":2},"attestation_state":"computed","paper":{"title":"Maximal-entropy random walks in complex networks with limited information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph","physics.data-an","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Jes\\'us G\\'omez-Garde\\~nes, Renaud Lambiotte, Roberta Sinatra, Vincenzo Nicosia, Vito Latora","submitted_at":"2010-07-28T12:10:55Z","abstract_excerpt":"Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph structure. In particular, we show that an almost maximal-entropy random walk is obtained when the step probabilities are proportional to a power of the degree of the target node, with an exponent $\\alpha$ that depends on the degree-degree correlations, and is equal to 1 in uncorrelated graphs."},"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":"1007.4936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2010-07-28T12:10:55Z","cross_cats_sorted":["physics.comp-ph","physics.data-an","physics.soc-ph"],"title_canon_sha256":"a95f8349df03c384ce1849e19423ab16489fe516e14fb61029645c09ca9f74f2","abstract_canon_sha256":"b8a2ede6addfa6cf34cf21573c31dace2f3a72e7053f1647f426a657c0e51c69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:56.502426Z","signature_b64":"Wcb8bwTL9zU/hg6iw1G7Jy+yASFDj/RsfrZLtU0Zvw3nSoIgwvOmIxWOet7AfrgP1ePaNdiuRGbXmux/L+BiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74533bee3d7de20d91754723c8c24c25963b9f165f717780ce9b8e945c062b0","last_reissued_at":"2026-05-18T04:26:56.501893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:56.501893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal-entropy random walks in complex networks with limited information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph","physics.data-an","physics.soc-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Jes\\'us G\\'omez-Garde\\~nes, Renaud Lambiotte, Roberta Sinatra, Vincenzo Nicosia, Vito Latora","submitted_at":"2010-07-28T12:10:55Z","abstract_excerpt":"Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph structure. In particular, we show that an almost maximal-entropy random walk is obtained when the step probabilities are proportional to a power of the degree of the target node, with an exponent $\\alpha$ that depends on the degree-degree correlations, and is equal to 1 in uncorrelated graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4936","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":"1007.4936","created_at":"2026-05-18T04:26:56.501983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4936v2","created_at":"2026-05-18T04:26:56.501983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4936","created_at":"2026-05-18T04:26:56.501983+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5CTHPXD27PC","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5CTHPXD27PCBWIX","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5CTHPXD","created_at":"2026-05-18T12:26:15.391820+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/U5CTHPXD27PCBWIXKRZDZDBEYJ","json":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ.json","graph_json":"https://pith.science/api/pith-number/U5CTHPXD27PCBWIXKRZDZDBEYJ/graph.json","events_json":"https://pith.science/api/pith-number/U5CTHPXD27PCBWIXKRZDZDBEYJ/events.json","paper":"https://pith.science/paper/U5CTHPXD"},"agent_actions":{"view_html":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ","download_json":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ.json","view_paper":"https://pith.science/paper/U5CTHPXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4936&json=true","fetch_graph":"https://pith.science/api/pith-number/U5CTHPXD27PCBWIXKRZDZDBEYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U5CTHPXD27PCBWIXKRZDZDBEYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ/action/storage_attestation","attest_author":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ/action/author_attestation","sign_citation":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ/action/citation_signature","submit_replication":"https://pith.science/pith/U5CTHPXD27PCBWIXKRZDZDBEYJ/action/replication_record"}},"created_at":"2026-05-18T04:26:56.501983+00:00","updated_at":"2026-05-18T04:26:56.501983+00:00"}