{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5UNZY6UH53NFBLYGWFNXVSOFTU","short_pith_number":"pith:5UNZY6UH","schema_version":"1.0","canonical_sha256":"ed1b9c7a87eeda50af06b15b7ac9c59d23bc615af199cc849b826cd8e3342e14","source":{"kind":"arxiv","id":"1712.07673","version":2},"attestation_state":"computed","paper":{"title":"Self-attracting self-avoiding walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alan Hammond, Tyler Helmuth","submitted_at":"2017-12-20T19:08:55Z","abstract_excerpt":"This article is concerned with self-avoiding walks (SAW) on $\\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary SAW. Ueltschi has shown how to overcome these difficulties for sufficiently regular infinite-range step distributions and weak self-attractions. This article considers the case of bounded step distributions. For weak self-attractions we show that the connective constant exists, and, in $d\\geq 5$, carry out a lace expansion analysis to prove the mean-field b"},"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":"1712.07673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-12-20T19:08:55Z","cross_cats_sorted":[],"title_canon_sha256":"92ff457927623dbb179bdf6491cacb021fbda291285fb772fab794a22979fa12","abstract_canon_sha256":"6446f80eb78955229c710767596d86ec4423794d6d09897af678e06235ceb8df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:48.426872Z","signature_b64":"SlGM5UqLMHXrYgaCC7J8Fx8AuY4ptHPD7fdUV35nyOzOtlu1DKJWWOVwCqpv57pPDJu5PAqH96lV+iyQvhaEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed1b9c7a87eeda50af06b15b7ac9c59d23bc615af199cc849b826cd8e3342e14","last_reissued_at":"2026-05-17T23:58:48.426392Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:48.426392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-attracting self-avoiding walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Alan Hammond, Tyler Helmuth","submitted_at":"2017-12-20T19:08:55Z","abstract_excerpt":"This article is concerned with self-avoiding walks (SAW) on $\\mathbb{Z}^{d}$ that are subject to a self-attraction. The attraction, which rewards instances of adjacent parallel edges, introduces difficulties that are not present in ordinary SAW. Ueltschi has shown how to overcome these difficulties for sufficiently regular infinite-range step distributions and weak self-attractions. This article considers the case of bounded step distributions. For weak self-attractions we show that the connective constant exists, and, in $d\\geq 5$, carry out a lace expansion analysis to prove the mean-field b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07673","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":"1712.07673","created_at":"2026-05-17T23:58:48.426471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07673v2","created_at":"2026-05-17T23:58:48.426471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07673","created_at":"2026-05-17T23:58:48.426471+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UNZY6UH53NF","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UNZY6UH53NFBLYG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UNZY6UH","created_at":"2026-05-18T12:31:00.734936+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/5UNZY6UH53NFBLYGWFNXVSOFTU","json":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU.json","graph_json":"https://pith.science/api/pith-number/5UNZY6UH53NFBLYGWFNXVSOFTU/graph.json","events_json":"https://pith.science/api/pith-number/5UNZY6UH53NFBLYGWFNXVSOFTU/events.json","paper":"https://pith.science/paper/5UNZY6UH"},"agent_actions":{"view_html":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU","download_json":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU.json","view_paper":"https://pith.science/paper/5UNZY6UH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07673&json=true","fetch_graph":"https://pith.science/api/pith-number/5UNZY6UH53NFBLYGWFNXVSOFTU/graph.json","fetch_events":"https://pith.science/api/pith-number/5UNZY6UH53NFBLYGWFNXVSOFTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU/action/storage_attestation","attest_author":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU/action/author_attestation","sign_citation":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU/action/citation_signature","submit_replication":"https://pith.science/pith/5UNZY6UH53NFBLYGWFNXVSOFTU/action/replication_record"}},"created_at":"2026-05-17T23:58:48.426471+00:00","updated_at":"2026-05-17T23:58:48.426471+00:00"}