{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:VOBCEI7VU2637XYKHHYILWMBMR","short_pith_number":"pith:VOBCEI7V","schema_version":"1.0","canonical_sha256":"ab822223f5a6bdbfdf0a39f085d98164766fce0f7898e84ee02fc3b0be9c14c3","source":{"kind":"arxiv","id":"math/0506460","version":2},"attestation_state":"computed","paper":{"title":"Damped random walks and the characteristic polynomial of the weighted Laplacian on a graph","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hariharan Narayanan, Madhav Desai","submitted_at":"2005-06-22T18:53:57Z","abstract_excerpt":"For $\\lambda>0$, we define a $\\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\\frac{\\lambda}{1+\\lambda}$, otherwise continued with probability $\\frac{1}{1+\\lambda}$. We use the Aldous-Broder algorithm (\\cite{aldous, broder}) of generating a random spanning tree and the Matrix-tree theorem to relate the values of the characteristic polynomial of the Laplacian at $\\pm \\lambda$ and the stationary measures of the sets of nodes visited by $i$ independent $\\lambda$-damped random walks for $i \\in \\N$. As a coro"},"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":"math/0506460","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2005-06-22T18:53:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1aae9a022508e16e2a98e172ec43237e965a2f366b9da2c5ed5fc0751e75dfb","abstract_canon_sha256":"ae12949804e9ea78f069ff9127552c36339d1a2b7776c9b6450cb9137a6e88fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:31.502539Z","signature_b64":"k79vaxAOtfWhd2jNNjuikqDlND6OKYbqBtSu1FqpO+bVZSfXKnw8wpiM1N2+iZO55EVYnlt+ihytRBfODV6aCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab822223f5a6bdbfdf0a39f085d98164766fce0f7898e84ee02fc3b0be9c14c3","last_reissued_at":"2026-05-18T04:04:31.501831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:31.501831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Damped random walks and the characteristic polynomial of the weighted Laplacian on a graph","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hariharan Narayanan, Madhav Desai","submitted_at":"2005-06-22T18:53:57Z","abstract_excerpt":"For $\\lambda>0$, we define a $\\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\\frac{\\lambda}{1+\\lambda}$, otherwise continued with probability $\\frac{1}{1+\\lambda}$. We use the Aldous-Broder algorithm (\\cite{aldous, broder}) of generating a random spanning tree and the Matrix-tree theorem to relate the values of the characteristic polynomial of the Laplacian at $\\pm \\lambda$ and the stationary measures of the sets of nodes visited by $i$ independent $\\lambda$-damped random walks for $i \\in \\N$. As a coro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0506460","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":"math/0506460","created_at":"2026-05-18T04:04:31.501939+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0506460v2","created_at":"2026-05-18T04:04:31.501939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0506460","created_at":"2026-05-18T04:04:31.501939+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOBCEI7VU263","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOBCEI7VU2637XYK","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOBCEI7V","created_at":"2026-05-18T12:25:53.939244+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/VOBCEI7VU2637XYKHHYILWMBMR","json":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR.json","graph_json":"https://pith.science/api/pith-number/VOBCEI7VU2637XYKHHYILWMBMR/graph.json","events_json":"https://pith.science/api/pith-number/VOBCEI7VU2637XYKHHYILWMBMR/events.json","paper":"https://pith.science/paper/VOBCEI7V"},"agent_actions":{"view_html":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR","download_json":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR.json","view_paper":"https://pith.science/paper/VOBCEI7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0506460&json=true","fetch_graph":"https://pith.science/api/pith-number/VOBCEI7VU2637XYKHHYILWMBMR/graph.json","fetch_events":"https://pith.science/api/pith-number/VOBCEI7VU2637XYKHHYILWMBMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/action/storage_attestation","attest_author":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/action/author_attestation","sign_citation":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/action/citation_signature","submit_replication":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/action/replication_record"}},"created_at":"2026-05-18T04:04:31.501939+00:00","updated_at":"2026-05-18T04:04:31.501939+00:00"}