{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RRWYEURX2A5EPNIL7TTAHUX5UB","short_pith_number":"pith:RRWYEURX","schema_version":"1.0","canonical_sha256":"8c6d825237d03a47b50bfce603d2fda0430d9f0788a94f471f21230d7ee37372","source":{"kind":"arxiv","id":"1505.06989","version":1},"attestation_state":"computed","paper":{"title":"A Hitting Time Formula for the Discrete Green's Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrew Beveridge","submitted_at":"2015-05-26T15:00:27Z","abstract_excerpt":"The discrete Green's function (without boundary) $\\mathbb{G}$ is a pseudo-inverse of the combinatorial Laplace operator of a graph $G=(V,E)$. We reveal the intimate connection between Green's function and the theory of exact stopping rules for random walks on graphs. We give an elementary formula for Green's function in terms of state-to-state hitting times of the underlying graph. Namely, $\\mathbb{G}(i,j) = \\pi_j \\left( \\sum_{k \\in V} \\pi_k H(k,j) - H(i,j) \\right)$ where $\\pi_i$ is the stationary distribution at vertex $i$ and $H(i,j)$ is the expected hitting time for a random walk starting f"},"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":"1505.06989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-26T15:00:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"63ea3304ad598e03690c811eaf5dc26165f43894ede8fd4575fe9dcc6f6d30da","abstract_canon_sha256":"46cab7258df04c62c82cd22b046d89f934e385c9ab30e62204b98bfa033b03c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:27.381072Z","signature_b64":"H2JAlYa3WAUjf2GXFxgyKo9FICy8vFYwjveofRMnF//OfsyP8NTF5gklvooeCH4FZbNNk6H8HCn8ZTDhc1f2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c6d825237d03a47b50bfce603d2fda0430d9f0788a94f471f21230d7ee37372","last_reissued_at":"2026-05-18T02:03:27.380569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:27.380569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hitting Time Formula for the Discrete Green's Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Andrew Beveridge","submitted_at":"2015-05-26T15:00:27Z","abstract_excerpt":"The discrete Green's function (without boundary) $\\mathbb{G}$ is a pseudo-inverse of the combinatorial Laplace operator of a graph $G=(V,E)$. We reveal the intimate connection between Green's function and the theory of exact stopping rules for random walks on graphs. We give an elementary formula for Green's function in terms of state-to-state hitting times of the underlying graph. Namely, $\\mathbb{G}(i,j) = \\pi_j \\left( \\sum_{k \\in V} \\pi_k H(k,j) - H(i,j) \\right)$ where $\\pi_i$ is the stationary distribution at vertex $i$ and $H(i,j)$ is the expected hitting time for a random walk starting f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06989","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06989","created_at":"2026-05-18T02:03:27.380643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06989v1","created_at":"2026-05-18T02:03:27.380643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06989","created_at":"2026-05-18T02:03:27.380643+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRWYEURX2A5E","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRWYEURX2A5EPNIL","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRWYEURX","created_at":"2026-05-18T12:29:39.896362+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/RRWYEURX2A5EPNIL7TTAHUX5UB","json":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB.json","graph_json":"https://pith.science/api/pith-number/RRWYEURX2A5EPNIL7TTAHUX5UB/graph.json","events_json":"https://pith.science/api/pith-number/RRWYEURX2A5EPNIL7TTAHUX5UB/events.json","paper":"https://pith.science/paper/RRWYEURX"},"agent_actions":{"view_html":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB","download_json":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB.json","view_paper":"https://pith.science/paper/RRWYEURX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06989&json=true","fetch_graph":"https://pith.science/api/pith-number/RRWYEURX2A5EPNIL7TTAHUX5UB/graph.json","fetch_events":"https://pith.science/api/pith-number/RRWYEURX2A5EPNIL7TTAHUX5UB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB/action/storage_attestation","attest_author":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB/action/author_attestation","sign_citation":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB/action/citation_signature","submit_replication":"https://pith.science/pith/RRWYEURX2A5EPNIL7TTAHUX5UB/action/replication_record"}},"created_at":"2026-05-18T02:03:27.380643+00:00","updated_at":"2026-05-18T02:03:27.380643+00:00"}