{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:KJCOWRB3TOAY4RJHX372TJ5FJB","short_pith_number":"pith:KJCOWRB3","canonical_record":{"source":{"id":"0902.4312","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:22:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"00ec856fe89092fb8fa401cd1cf62e7a21e4bddea501c6d4d526a8029645f903","abstract_canon_sha256":"a070337e863f046b1690b5a3088323edab138ebe7d5e6c84317aa825df59ad83"},"schema_version":"1.0"},"canonical_sha256":"5244eb443b9b818e4527beffa9a7a5487818c4efe6a69fbec066bbf79e250ada","source":{"kind":"arxiv","id":"0902.4312","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.4312","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"0902.4312v4","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4312","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KJCOWRB3TOAY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KJCOWRB3TOAY4RJH","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KJCOWRB3","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:KJCOWRB3TOAY4RJHX372TJ5FJB","target":"record","payload":{"canonical_record":{"source":{"id":"0902.4312","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:22:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"00ec856fe89092fb8fa401cd1cf62e7a21e4bddea501c6d4d526a8029645f903","abstract_canon_sha256":"a070337e863f046b1690b5a3088323edab138ebe7d5e6c84317aa825df59ad83"},"schema_version":"1.0"},"canonical_sha256":"5244eb443b9b818e4527beffa9a7a5487818c4efe6a69fbec066bbf79e250ada","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:36.088102Z","signature_b64":"iRpMdP2lxzeDD9hyQDlALs9NnfMuJSItECehYIZDsPftemFkmDRivSsb0/nwhvp029WcV4YsyrC3jZ/SGwyjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5244eb443b9b818e4527beffa9a7a5487818c4efe6a69fbec066bbf79e250ada","last_reissued_at":"2026-05-18T00:17:36.087429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:36.087429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0902.4312","source_version":4,"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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+hXuPH2LoREIooqxD9z7g5Ky/edtXkuf5/NhWtTzO8+QTzKLEn77hYpCvV4KTgzuEPOq5/O6EVpHVf5XpGKTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:13:23.501632Z"},"content_sha256":"780e1f36eb0ee74119445086b68069318ba36cde05c0a80e1f4ef008c0aceb59","schema_version":"1.0","event_id":"sha256:780e1f36eb0ee74119445086b68069318ba36cde05c0a80e1f4ef008c0aceb59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:KJCOWRB3TOAY4RJHX372TJ5FJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Limit of the Prudent Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"S. Friedli, V. Beffara, Y. Velenik","submitted_at":"2009-02-25T08:22:08Z","abstract_excerpt":"We describe the scaling limit of the nearest neighbour prudent walk on the square lattice, which performs steps uniformly in directions in which it does not see sites already visited. We show that the scaling limit is given by the process Z(u) = s_1 theta^+(3u/7) e_1 + s_2 theta^-(3u/7) e_2, where e_1, e_2 is the canonical basis, theta^+(t), resp. theta^-(t), is the time spent by a one-dimensional Brownian motion above, resp. below, 0 up to time t, and s_1, s_2 are two random signs. In particular, the asymptotic speed of the walk is well-defined in the L^1-norm and equals 3/7."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4312","kind":"arxiv","version":4},"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-18T00:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xz4HXY7HVl4/LwTbUQj5UVkbfMK7mYK/rH7gFQ6286nsldSOtMNX77hcMQWvbupz8xHJVYyHO4jXsTNaRxDSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:13:23.501978Z"},"content_sha256":"40c64383dcfb48bae97b5b8fdb0203f9581e8c562d65b2d0c23fdf179e333a40","schema_version":"1.0","event_id":"sha256:40c64383dcfb48bae97b5b8fdb0203f9581e8c562d65b2d0c23fdf179e333a40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJCOWRB3TOAY4RJHX372TJ5FJB/bundle.json","state_url":"https://pith.science/pith/KJCOWRB3TOAY4RJHX372TJ5FJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJCOWRB3TOAY4RJHX372TJ5FJB/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-23T13:13:23Z","links":{"resolver":"https://pith.science/pith/KJCOWRB3TOAY4RJHX372TJ5FJB","bundle":"https://pith.science/pith/KJCOWRB3TOAY4RJHX372TJ5FJB/bundle.json","state":"https://pith.science/pith/KJCOWRB3TOAY4RJHX372TJ5FJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJCOWRB3TOAY4RJHX372TJ5FJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KJCOWRB3TOAY4RJHX372TJ5FJB","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":"a070337e863f046b1690b5a3088323edab138ebe7d5e6c84317aa825df59ad83","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:22:08Z","title_canon_sha256":"00ec856fe89092fb8fa401cd1cf62e7a21e4bddea501c6d4d526a8029645f903"},"schema_version":"1.0","source":{"id":"0902.4312","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.4312","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"0902.4312v4","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.4312","created_at":"2026-05-18T00:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KJCOWRB3TOAY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KJCOWRB3TOAY4RJH","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KJCOWRB3","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:40c64383dcfb48bae97b5b8fdb0203f9581e8c562d65b2d0c23fdf179e333a40","target":"graph","created_at":"2026-05-18T00:17:36Z","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 describe the scaling limit of the nearest neighbour prudent walk on the square lattice, which performs steps uniformly in directions in which it does not see sites already visited. We show that the scaling limit is given by the process Z(u) = s_1 theta^+(3u/7) e_1 + s_2 theta^-(3u/7) e_2, where e_1, e_2 is the canonical basis, theta^+(t), resp. theta^-(t), is the time spent by a one-dimensional Brownian motion above, resp. below, 0 up to time t, and s_1, s_2 are two random signs. In particular, the asymptotic speed of the walk is well-defined in the L^1-norm and equals 3/7.","authors_text":"S. Friedli, V. Beffara, Y. Velenik","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:22:08Z","title":"Scaling Limit of the Prudent Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.4312","kind":"arxiv","version":4},"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:780e1f36eb0ee74119445086b68069318ba36cde05c0a80e1f4ef008c0aceb59","target":"record","created_at":"2026-05-18T00:17:36Z","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":"a070337e863f046b1690b5a3088323edab138ebe7d5e6c84317aa825df59ad83","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-02-25T08:22:08Z","title_canon_sha256":"00ec856fe89092fb8fa401cd1cf62e7a21e4bddea501c6d4d526a8029645f903"},"schema_version":"1.0","source":{"id":"0902.4312","kind":"arxiv","version":4}},"canonical_sha256":"5244eb443b9b818e4527beffa9a7a5487818c4efe6a69fbec066bbf79e250ada","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5244eb443b9b818e4527beffa9a7a5487818c4efe6a69fbec066bbf79e250ada","first_computed_at":"2026-05-18T00:17:36.087429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:36.087429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iRpMdP2lxzeDD9hyQDlALs9NnfMuJSItECehYIZDsPftemFkmDRivSsb0/nwhvp029WcV4YsyrC3jZ/SGwyjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:36.088102Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.4312","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:780e1f36eb0ee74119445086b68069318ba36cde05c0a80e1f4ef008c0aceb59","sha256:40c64383dcfb48bae97b5b8fdb0203f9581e8c562d65b2d0c23fdf179e333a40"],"state_sha256":"9906041f1b7895e96a7817e67307a74c679f8e85082d6498565292c15b9fd275"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxaoVCmitLFIkXdkQHroEzLFPLqNntS3eNYaUDNQGcnjfA15OZebMVGRF4VpvqZ4mwRv+w2N5ac4phGT3H11BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:13:23.504138Z","bundle_sha256":"9b974c8f70864f2dabc9772f612bbafcfd721482034d9eb4450b86f03b26160d"}}