{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RTJHH3I45O7BBNWPMNANJ7MYCP","short_pith_number":"pith:RTJHH3I4","schema_version":"1.0","canonical_sha256":"8cd273ed1cebbe10b6cf6340d4fd9813ee3f3a5def9c6bf0dff4306ba63a35ea","source":{"kind":"arxiv","id":"1410.3119","version":2},"attestation_state":"computed","paper":{"title":"Loop-weighted Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Tyler Helmuth","submitted_at":"2014-10-12T17:10:50Z","abstract_excerpt":"Loop-weighted walk with parameter $\\lambda\\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\\lambda^{k}$ if it contains $k$ loops; whether this is a reward or punishment for containing loops depends on the value of $\\lambda$. A challenging feature of loop-weighted walk is that it is not purely repulsive, meaning the weight of the future of a walk may either increase or decrease if the past is forgotten. Repulsion is typically an essential property for lace expansion arguments. This article circumvents the"},"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":"1410.3119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-12T17:10:50Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"91d605af628295d61e3b92f4d35c6e0f3bdfdfeaeb25d5771fe6ff753fb07b6d","abstract_canon_sha256":"d5c201e84ecacf9f91d989dff8a85214cc083d90f609eaa66ed1e8425ce2a77b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:28.837962Z","signature_b64":"vgAFaXyy8i39OzBg2MKvJ8fTywYimT55CsaBiKyS/VhMluM1X4kGvEN9WwZgCyOpYF4GBaSUbVt+bNNFLHRhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd273ed1cebbe10b6cf6340d4fd9813ee3f3a5def9c6bf0dff4306ba63a35ea","last_reissued_at":"2026-05-18T01:13:28.837499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:28.837499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loop-weighted Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Tyler Helmuth","submitted_at":"2014-10-12T17:10:50Z","abstract_excerpt":"Loop-weighted walk with parameter $\\lambda\\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\\lambda^{k}$ if it contains $k$ loops; whether this is a reward or punishment for containing loops depends on the value of $\\lambda$. A challenging feature of loop-weighted walk is that it is not purely repulsive, meaning the weight of the future of a walk may either increase or decrease if the past is forgotten. Repulsion is typically an essential property for lace expansion arguments. This article circumvents the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3119","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":"1410.3119","created_at":"2026-05-18T01:13:28.837567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3119v2","created_at":"2026-05-18T01:13:28.837567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3119","created_at":"2026-05-18T01:13:28.837567+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTJHH3I45O7B","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTJHH3I45O7BBNWP","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTJHH3I4","created_at":"2026-05-18T12:28:46.137349+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/RTJHH3I45O7BBNWPMNANJ7MYCP","json":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP.json","graph_json":"https://pith.science/api/pith-number/RTJHH3I45O7BBNWPMNANJ7MYCP/graph.json","events_json":"https://pith.science/api/pith-number/RTJHH3I45O7BBNWPMNANJ7MYCP/events.json","paper":"https://pith.science/paper/RTJHH3I4"},"agent_actions":{"view_html":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP","download_json":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP.json","view_paper":"https://pith.science/paper/RTJHH3I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3119&json=true","fetch_graph":"https://pith.science/api/pith-number/RTJHH3I45O7BBNWPMNANJ7MYCP/graph.json","fetch_events":"https://pith.science/api/pith-number/RTJHH3I45O7BBNWPMNANJ7MYCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP/action/storage_attestation","attest_author":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP/action/author_attestation","sign_citation":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP/action/citation_signature","submit_replication":"https://pith.science/pith/RTJHH3I45O7BBNWPMNANJ7MYCP/action/replication_record"}},"created_at":"2026-05-18T01:13:28.837567+00:00","updated_at":"2026-05-18T01:13:28.837567+00:00"}