{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:VOBCEI7VU2637XYKHHYILWMBMR","short_pith_number":"pith:VOBCEI7V","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"},"canonical_sha256":"ab822223f5a6bdbfdf0a39f085d98164766fce0f7898e84ee02fc3b0be9c14c3","source":{"kind":"arxiv","id":"math/0506460","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0506460","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"math/0506460v2","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0506460","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"VOBCEI7VU263","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VOBCEI7VU2637XYK","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VOBCEI7V","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:VOBCEI7VU2637XYKHHYILWMBMR","target":"record","payload":{"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"},"canonical_sha256":"ab822223f5a6bdbfdf0a39f085d98164766fce0f7898e84ee02fc3b0be9c14c3","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"},"source_kind":"arxiv","source_id":"math/0506460","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-18T04:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnmfOQjbQjVqR9pKCPQRM4DQQXMa7F7KeCb3WVcMtSmzvJbCjDhxOD071KRehieq3m/zr4OJAErN9yeL9xYoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:14:21.738874Z"},"content_sha256":"3f2f83d0d0b8cc312e8677c6da218d2272d1a7024fc0a9765c59958e4f7c8033","schema_version":"1.0","event_id":"sha256:3f2f83d0d0b8cc312e8677c6da218d2272d1a7024fc0a9765c59958e4f7c8033"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:VOBCEI7VU2637XYKHHYILWMBMR","target":"graph","payload":{"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"},"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-18T04:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKeD4j/vw10aAPpg0nZKTw9c4jR3KKmNW++hT1DjtKfoVrRqh+zqvq7uBJ7A1KnOBOYuPgJ2oSJXgGbXvxNKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:14:21.739219Z"},"content_sha256":"278bb89bf96ad9c83a8da374bb4cffdd7b84bfebca50709efc7167b8a03d5ccb","schema_version":"1.0","event_id":"sha256:278bb89bf96ad9c83a8da374bb4cffdd7b84bfebca50709efc7167b8a03d5ccb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/bundle.json","state_url":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOBCEI7VU2637XYKHHYILWMBMR/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-02T13:14:21Z","links":{"resolver":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR","bundle":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/bundle.json","state":"https://pith.science/pith/VOBCEI7VU2637XYKHHYILWMBMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOBCEI7VU2637XYKHHYILWMBMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:VOBCEI7VU2637XYKHHYILWMBMR","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":"ae12949804e9ea78f069ff9127552c36339d1a2b7776c9b6450cb9137a6e88fc","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2005-06-22T18:53:57Z","title_canon_sha256":"d1aae9a022508e16e2a98e172ec43237e965a2f366b9da2c5ed5fc0751e75dfb"},"schema_version":"1.0","source":{"id":"math/0506460","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0506460","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"math/0506460v2","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0506460","created_at":"2026-05-18T04:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"VOBCEI7VU263","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"VOBCEI7VU2637XYK","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"VOBCEI7V","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:278bb89bf96ad9c83a8da374bb4cffdd7b84bfebca50709efc7167b8a03d5ccb","target":"graph","created_at":"2026-05-18T04:04:31Z","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":"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","authors_text":"Hariharan Narayanan, Madhav Desai","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2005-06-22T18:53:57Z","title":"Damped random walks and the characteristic polynomial of the weighted Laplacian on a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0506460","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:3f2f83d0d0b8cc312e8677c6da218d2272d1a7024fc0a9765c59958e4f7c8033","target":"record","created_at":"2026-05-18T04:04:31Z","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":"ae12949804e9ea78f069ff9127552c36339d1a2b7776c9b6450cb9137a6e88fc","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.PR","submitted_at":"2005-06-22T18:53:57Z","title_canon_sha256":"d1aae9a022508e16e2a98e172ec43237e965a2f366b9da2c5ed5fc0751e75dfb"},"schema_version":"1.0","source":{"id":"math/0506460","kind":"arxiv","version":2}},"canonical_sha256":"ab822223f5a6bdbfdf0a39f085d98164766fce0f7898e84ee02fc3b0be9c14c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab822223f5a6bdbfdf0a39f085d98164766fce0f7898e84ee02fc3b0be9c14c3","first_computed_at":"2026-05-18T04:04:31.501831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:31.501831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k79vaxAOtfWhd2jNNjuikqDlND6OKYbqBtSu1FqpO+bVZSfXKnw8wpiM1N2+iZO55EVYnlt+ihytRBfODV6aCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:31.502539Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0506460","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f2f83d0d0b8cc312e8677c6da218d2272d1a7024fc0a9765c59958e4f7c8033","sha256:278bb89bf96ad9c83a8da374bb4cffdd7b84bfebca50709efc7167b8a03d5ccb"],"state_sha256":"aa553b427aed0c9468c5d49ef26cba2e388a7076f9095bdfd6cfa191f888c205"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgKspBrZ7iLYxdphcN6bTO22auAj9e3wP+45awKAQ1o9u4i95SHhRWcRPCecG1jxp/AYkiI0CwhU0LlO1fy/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:14:21.741134Z","bundle_sha256":"871f76791c0c643fe30654be1efb21c285bc1317cec20fdc41dd9edee678ad56"}}