{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YB3QM5JXRHO65AHX7AUVQVI63C","short_pith_number":"pith:YB3QM5JX","canonical_record":{"source":{"id":"1203.4010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-19T00:15:48Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"60feeca7f38d9d6f44e414dd3f2f5aba3a743feeb893a3cd38309664a6c7d156","abstract_canon_sha256":"fd1e6db54a75b55bc907fdf757b5cf9cd1999faa66b5cca8e3e7532c96b06b9f"},"schema_version":"1.0"},"canonical_sha256":"c07706753789ddee80f7f82958551ed8af8b59533a6905342ea551752d817b65","source":{"kind":"arxiv","id":"1203.4010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4010","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4010v1","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4010","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"YB3QM5JXRHO6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YB3QM5JXRHO65AHX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YB3QM5JX","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YB3QM5JXRHO65AHX7AUVQVI63C","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-19T00:15:48Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"60feeca7f38d9d6f44e414dd3f2f5aba3a743feeb893a3cd38309664a6c7d156","abstract_canon_sha256":"fd1e6db54a75b55bc907fdf757b5cf9cd1999faa66b5cca8e3e7532c96b06b9f"},"schema_version":"1.0"},"canonical_sha256":"c07706753789ddee80f7f82958551ed8af8b59533a6905342ea551752d817b65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.672952Z","signature_b64":"D1GHcs9xE/RXzq6Gzohl2t+0iblR5Mxdh3SoE0fVodm6WL9ci8ZsGTNio010kRqh32iQ2dF+qE4B/bhEjnFPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c07706753789ddee80f7f82958551ed8af8b59533a6905342ea551752d817b65","last_reissued_at":"2026-05-18T02:52:32.672260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.672260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4010","source_version":1,"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-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DTzR5xIxlk2CFHXZ6K0T+z3gWOPP7IWiLE2gAOAYE5psUEJkcL9hIJbdkJBr/E1clmJuk5icpj/fuPkSYf1lDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:23:49.060563Z"},"content_sha256":"56f6b0b2a6c50179b59e432518db03e7e5503c5d92a0547347e69f99c2ab7cc1","schema_version":"1.0","event_id":"sha256:56f6b0b2a6c50179b59e432518db03e7e5503c5d92a0547347e69f99c2ab7cc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YB3QM5JXRHO65AHX7AUVQVI63C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Localization for Linearly Edge Reinforced Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Gady Kozma, Nicholas Crawford, Omer Angel","submitted_at":"2012-03-19T00:15:48Z","abstract_excerpt":"We prove that the linearly edge reinforced random walk (LRRW) on any graph with bounded degrees is recurrent for sufficiently small initial weights. In contrast, we show that for non-amenable graphs the LRRW is transient for sufficiently large initial weights, thereby establishing a phase transition for the LRRW on non-amenable graphs. While we rely on the description of the LRRW as a mixture of Markov chains, the proof does not use the magic formula. We also derive analogous results for the vertex reinforced jump process."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4010","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"},"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-18T02:52:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKgY+iiKt5I/k9dJ4zmnqW2a0AjDsKTCzsQT6621rrVKlS/BwJ+kOmmb59C6zUEIOChXvCO/w/ZVGxYg81UEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:23:49.060983Z"},"content_sha256":"59fe3d00081c2f8d4a18f28738eb55e23bc0e192f29430e106fbf6c0e94be479","schema_version":"1.0","event_id":"sha256:59fe3d00081c2f8d4a18f28738eb55e23bc0e192f29430e106fbf6c0e94be479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YB3QM5JXRHO65AHX7AUVQVI63C/bundle.json","state_url":"https://pith.science/pith/YB3QM5JXRHO65AHX7AUVQVI63C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YB3QM5JXRHO65AHX7AUVQVI63C/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-05-30T18:23:49Z","links":{"resolver":"https://pith.science/pith/YB3QM5JXRHO65AHX7AUVQVI63C","bundle":"https://pith.science/pith/YB3QM5JXRHO65AHX7AUVQVI63C/bundle.json","state":"https://pith.science/pith/YB3QM5JXRHO65AHX7AUVQVI63C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YB3QM5JXRHO65AHX7AUVQVI63C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YB3QM5JXRHO65AHX7AUVQVI63C","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":"fd1e6db54a75b55bc907fdf757b5cf9cd1999faa66b5cca8e3e7532c96b06b9f","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-19T00:15:48Z","title_canon_sha256":"60feeca7f38d9d6f44e414dd3f2f5aba3a743feeb893a3cd38309664a6c7d156"},"schema_version":"1.0","source":{"id":"1203.4010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4010","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4010v1","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4010","created_at":"2026-05-18T02:52:32Z"},{"alias_kind":"pith_short_12","alias_value":"YB3QM5JXRHO6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YB3QM5JXRHO65AHX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YB3QM5JX","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:59fe3d00081c2f8d4a18f28738eb55e23bc0e192f29430e106fbf6c0e94be479","target":"graph","created_at":"2026-05-18T02:52:32Z","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":"We prove that the linearly edge reinforced random walk (LRRW) on any graph with bounded degrees is recurrent for sufficiently small initial weights. In contrast, we show that for non-amenable graphs the LRRW is transient for sufficiently large initial weights, thereby establishing a phase transition for the LRRW on non-amenable graphs. While we rely on the description of the LRRW as a mixture of Markov chains, the proof does not use the magic formula. We also derive analogous results for the vertex reinforced jump process.","authors_text":"Gady Kozma, Nicholas Crawford, Omer Angel","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-19T00:15:48Z","title":"Localization for Linearly Edge Reinforced Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4010","kind":"arxiv","version":1},"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:56f6b0b2a6c50179b59e432518db03e7e5503c5d92a0547347e69f99c2ab7cc1","target":"record","created_at":"2026-05-18T02:52:32Z","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":"fd1e6db54a75b55bc907fdf757b5cf9cd1999faa66b5cca8e3e7532c96b06b9f","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-03-19T00:15:48Z","title_canon_sha256":"60feeca7f38d9d6f44e414dd3f2f5aba3a743feeb893a3cd38309664a6c7d156"},"schema_version":"1.0","source":{"id":"1203.4010","kind":"arxiv","version":1}},"canonical_sha256":"c07706753789ddee80f7f82958551ed8af8b59533a6905342ea551752d817b65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c07706753789ddee80f7f82958551ed8af8b59533a6905342ea551752d817b65","first_computed_at":"2026-05-18T02:52:32.672260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:32.672260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D1GHcs9xE/RXzq6Gzohl2t+0iblR5Mxdh3SoE0fVodm6WL9ci8ZsGTNio010kRqh32iQ2dF+qE4B/bhEjnFPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:32.672952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56f6b0b2a6c50179b59e432518db03e7e5503c5d92a0547347e69f99c2ab7cc1","sha256:59fe3d00081c2f8d4a18f28738eb55e23bc0e192f29430e106fbf6c0e94be479"],"state_sha256":"c6863ef7b9252f53d00742be484dc2548356ceec2b05a91b5e1ac185da4fc357"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYBxpMO2+dSrxqEpNhbEC7PngUASp5Zvqb1Zb5dUN0povbsxyVeN1eACMw9M9pKySf4IF4SOE7r3j94yQ2ZvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:23:49.064513Z","bundle_sha256":"aeebaad7fa201d5f5f65e22ecbd90019c165c438bacc3a226efbfb1b92f5b765"}}