{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:KI7ZN5RTWYTPK6PDUCA4JWJTEB","short_pith_number":"pith:KI7ZN5RT","schema_version":"1.0","canonical_sha256":"523f96f633b626f579e3a081c4d9332064c76c9949f2807b1e19d52b748329f9","source":{"kind":"arxiv","id":"math/0204277","version":2},"attestation_state":"computed","paper":{"title":"On the scaling limit of planar self-avoiding walk","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Gregory F. Lawler, Oded Schramm, Wendelin Werner","submitted_at":"2002-04-23T15:51:23Z","abstract_excerpt":"A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and non-disconnecting Brownian motions. New heuristic derivations are given for the critical exponents for SAWs and SAPs."},"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":"math/0204277","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2002-04-23T15:51:23Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"131a69df5df1e5467d9fb78f627e34c4c6cd2d23bda582deed25326cb21dfcac","abstract_canon_sha256":"766cb51b5b7f96dd0e3765fb2b2d1541c87618456c5d1d44fd2db3ee3d6e9d81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:59.545027Z","signature_b64":"16ezO9tfeYdDW0tb51uZk1LeiLKwZ6lu5bMjqNwy4ZcveRvXpgaHMsGtjMW0JiR/Mv7gOWgjAjyJQpTL2UMFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523f96f633b626f579e3a081c4d9332064c76c9949f2807b1e19d52b748329f9","last_reissued_at":"2026-07-04T14:47:59.544690Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:59.544690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the scaling limit of planar self-avoiding walk","license":"","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Gregory F. Lawler, Oded Schramm, Wendelin Werner","submitted_at":"2002-04-23T15:51:23Z","abstract_excerpt":"A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and non-disconnecting Brownian motions. New heuristic derivations are given for the critical exponents for SAWs and SAPs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0204277","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0204277/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"math/0204277","created_at":"2026-07-04T14:47:59.544745+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0204277v2","created_at":"2026-07-04T14:47:59.544745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0204277","created_at":"2026-07-04T14:47:59.544745+00:00"},{"alias_kind":"pith_short_12","alias_value":"KI7ZN5RTWYTP","created_at":"2026-07-04T14:47:59.544745+00:00"},{"alias_kind":"pith_short_16","alias_value":"KI7ZN5RTWYTPK6PD","created_at":"2026-07-04T14:47:59.544745+00:00"},{"alias_kind":"pith_short_8","alias_value":"KI7ZN5RT","created_at":"2026-07-04T14:47:59.544745+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08881","citing_title":"Complexity and Geometry of Sampling Connected Graph Partitions","ref_index":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB","json":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB.json","graph_json":"https://pith.science/api/pith-number/KI7ZN5RTWYTPK6PDUCA4JWJTEB/graph.json","events_json":"https://pith.science/api/pith-number/KI7ZN5RTWYTPK6PDUCA4JWJTEB/events.json","paper":"https://pith.science/paper/KI7ZN5RT"},"agent_actions":{"view_html":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB","download_json":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB.json","view_paper":"https://pith.science/paper/KI7ZN5RT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0204277&json=true","fetch_graph":"https://pith.science/api/pith-number/KI7ZN5RTWYTPK6PDUCA4JWJTEB/graph.json","fetch_events":"https://pith.science/api/pith-number/KI7ZN5RTWYTPK6PDUCA4JWJTEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB/action/storage_attestation","attest_author":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB/action/author_attestation","sign_citation":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB/action/citation_signature","submit_replication":"https://pith.science/pith/KI7ZN5RTWYTPK6PDUCA4JWJTEB/action/replication_record"}},"created_at":"2026-07-04T14:47:59.544745+00:00","updated_at":"2026-07-04T14:47:59.544745+00:00"}