{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:BU4CTAGLRPT5YLBTN4FEAYCAZD","short_pith_number":"pith:BU4CTAGL","schema_version":"1.0","canonical_sha256":"0d382980cb8be7dc2c336f0a406040c8e3b4e96c2699afe2b10599fd18cfdb1b","source":{"kind":"arxiv","id":"0903.3892","version":2},"attestation_state":"computed","paper":{"title":"Exit time for anchored expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C. Rau, T. Delmotte","submitted_at":"2009-03-23T16:36:16Z","abstract_excerpt":"Let $(X_n)_{n\\geq 0}$ be a reversible random walk on a graph $G$ satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. As an application, we consider random environments of $\\Z^d$."},"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":"0903.3892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-03-23T16:36:16Z","cross_cats_sorted":[],"title_canon_sha256":"3088833cee092ed0b04be22d979aba3dc25b386dab206e52ffb4363d86fe6363","abstract_canon_sha256":"1b92622626f5799b2881307ef24ec31d3fd7120635bc53dd415a28fbd5c55fed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:29.134057Z","signature_b64":"V4DzGZCX4JtpP+WE8s7Tj8Cri2aktdVpQiAjKQqi+jPVzteVRAsktJ/fIUlNuleuKMdj8/CWsohgekChhZLKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d382980cb8be7dc2c336f0a406040c8e3b4e96c2699afe2b10599fd18cfdb1b","last_reissued_at":"2026-05-18T01:37:29.133425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:29.133425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exit time for anchored expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"C. Rau, T. Delmotte","submitted_at":"2009-03-23T16:36:16Z","abstract_excerpt":"Let $(X_n)_{n\\geq 0}$ be a reversible random walk on a graph $G$ satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. As an application, we consider random environments of $\\Z^d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3892","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":"0903.3892","created_at":"2026-05-18T01:37:29.133526+00:00"},{"alias_kind":"arxiv_version","alias_value":"0903.3892v2","created_at":"2026-05-18T01:37:29.133526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3892","created_at":"2026-05-18T01:37:29.133526+00:00"},{"alias_kind":"pith_short_12","alias_value":"BU4CTAGLRPT5","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"BU4CTAGLRPT5YLBT","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"BU4CTAGL","created_at":"2026-05-18T12:25:58.837520+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/BU4CTAGLRPT5YLBTN4FEAYCAZD","json":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD.json","graph_json":"https://pith.science/api/pith-number/BU4CTAGLRPT5YLBTN4FEAYCAZD/graph.json","events_json":"https://pith.science/api/pith-number/BU4CTAGLRPT5YLBTN4FEAYCAZD/events.json","paper":"https://pith.science/paper/BU4CTAGL"},"agent_actions":{"view_html":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD","download_json":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD.json","view_paper":"https://pith.science/paper/BU4CTAGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0903.3892&json=true","fetch_graph":"https://pith.science/api/pith-number/BU4CTAGLRPT5YLBTN4FEAYCAZD/graph.json","fetch_events":"https://pith.science/api/pith-number/BU4CTAGLRPT5YLBTN4FEAYCAZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD/action/storage_attestation","attest_author":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD/action/author_attestation","sign_citation":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD/action/citation_signature","submit_replication":"https://pith.science/pith/BU4CTAGLRPT5YLBTN4FEAYCAZD/action/replication_record"}},"created_at":"2026-05-18T01:37:29.133526+00:00","updated_at":"2026-05-18T01:37:29.133526+00:00"}