{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DNSFOANTYC3MC2AYEOWPQLNUGJ","short_pith_number":"pith:DNSFOANT","schema_version":"1.0","canonical_sha256":"1b645701b3c0b6c1681823acf82db4325aa5a35ba2ee7b2888378c6339601861","source":{"kind":"arxiv","id":"0905.3440","version":1},"attestation_state":"computed","paper":{"title":"Scaling of loop-erased walks in 2 to 4 dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Peter Grassberger","submitted_at":"2009-05-21T05:50:05Z","abstract_excerpt":"We simulate loop-erased random walks on simple (hyper-)cubic lattices of dimensions 2,3, and 4. These simulations were mainly motivated to test recent two loop renormalization group predictions for logarithmic corrections in $d=4$, simulations in lower dimensions were done for completeness and in order to test the algorithm. In $d=2$, we verify with high precision the prediction $D=5/4$, where the number of steps $n$ after erasure scales with the number $N$ of steps before erasure as $n\\sim N^{D/2}$. In $d=3$ we again find a power law, but with an exponent different from the one found in the m"},"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":"0905.3440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2009-05-21T05:50:05Z","cross_cats_sorted":[],"title_canon_sha256":"07600b047469d76837ecd3f29d85ecfb83281eb74e876b8074c7d5f0b2e9e68a","abstract_canon_sha256":"6d1319c8451e97ac7456c54257955953e4f539269b5532e6c1e18ed3d2ada306"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:38.255112Z","signature_b64":"700vyJonTWAKyysC+UOphSxJ4kWWyqbIbwnwMvGCl6DTBxeW28nUQFf0NTI8TH84u9Kg7BoRCjsXtD1zUzpDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b645701b3c0b6c1681823acf82db4325aa5a35ba2ee7b2888378c6339601861","last_reissued_at":"2026-05-18T02:13:38.254539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:38.254539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling of loop-erased walks in 2 to 4 dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Peter Grassberger","submitted_at":"2009-05-21T05:50:05Z","abstract_excerpt":"We simulate loop-erased random walks on simple (hyper-)cubic lattices of dimensions 2,3, and 4. These simulations were mainly motivated to test recent two loop renormalization group predictions for logarithmic corrections in $d=4$, simulations in lower dimensions were done for completeness and in order to test the algorithm. In $d=2$, we verify with high precision the prediction $D=5/4$, where the number of steps $n$ after erasure scales with the number $N$ of steps before erasure as $n\\sim N^{D/2}$. In $d=3$ we again find a power law, but with an exponent different from the one found in the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3440","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":"0905.3440","created_at":"2026-05-18T02:13:38.254619+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.3440v1","created_at":"2026-05-18T02:13:38.254619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3440","created_at":"2026-05-18T02:13:38.254619+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNSFOANTYC3M","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNSFOANTYC3MC2AY","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNSFOANT","created_at":"2026-05-18T12:25:59.703012+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/DNSFOANTYC3MC2AYEOWPQLNUGJ","json":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ.json","graph_json":"https://pith.science/api/pith-number/DNSFOANTYC3MC2AYEOWPQLNUGJ/graph.json","events_json":"https://pith.science/api/pith-number/DNSFOANTYC3MC2AYEOWPQLNUGJ/events.json","paper":"https://pith.science/paper/DNSFOANT"},"agent_actions":{"view_html":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ","download_json":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ.json","view_paper":"https://pith.science/paper/DNSFOANT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.3440&json=true","fetch_graph":"https://pith.science/api/pith-number/DNSFOANTYC3MC2AYEOWPQLNUGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/DNSFOANTYC3MC2AYEOWPQLNUGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ/action/storage_attestation","attest_author":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ/action/author_attestation","sign_citation":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ/action/citation_signature","submit_replication":"https://pith.science/pith/DNSFOANTYC3MC2AYEOWPQLNUGJ/action/replication_record"}},"created_at":"2026-05-18T02:13:38.254619+00:00","updated_at":"2026-05-18T02:13:38.254619+00:00"}