{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B3TI4KQA3ZK6MOY4KX27LSGZMD","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":"a920682f8a52360c66f0b350a4e88a6ab02764a1a2adfc3110bf1554f12494e8","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-30T20:34:20Z","title_canon_sha256":"f09c19d9f9d714004d73bb847eafef27a1cac3bcfff90db6c5f1a287cde43fc4"},"schema_version":"1.0","source":{"id":"1708.09460","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09460","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09460v3","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09460","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"B3TI4KQA3ZK6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B3TI4KQA3ZK6MOY4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B3TI4KQA","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:59209011d35d8fa8072e15d20409e0d0b81da7fb4280d290ca9703e04ffdba85","target":"graph","created_at":"2026-05-18T00:29:51Z","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":"The Hammersley-Welsh bound (1962) states that the number $c_n$ of length $n$ self-avoiding walks on $\\mathbb{Z}^d$ satisfies \\[ c_n \\leq \\exp \\left[ O(n^{1/2}) \\right] \\mu_c^n, \\] where $\\mu_c=\\mu_c(d)$ is the connective constant of $\\mathbb{Z}^d$. While stronger estimates have subsequently been proven for $d\\geq 3$, for $d=2$ this has remained the best rigorous, unconditional bound available. In this note, we give a new, simplified proof of this bound, which does not rely on the combinatorial analysis of unfolding. We also prove a small, non-quantitative improvement to the bound, namely \\[ c_","authors_text":"Tom Hutchcroft","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-30T20:34:20Z","title":"The Hammersley-Welsh bound for self-avoiding walk revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09460","kind":"arxiv","version":3},"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:3da373119c90c75fbbd0c021d8daf5afa216a3098ba50af55c1a93c54c84bff7","target":"record","created_at":"2026-05-18T00:29:51Z","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":"a920682f8a52360c66f0b350a4e88a6ab02764a1a2adfc3110bf1554f12494e8","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-30T20:34:20Z","title_canon_sha256":"f09c19d9f9d714004d73bb847eafef27a1cac3bcfff90db6c5f1a287cde43fc4"},"schema_version":"1.0","source":{"id":"1708.09460","kind":"arxiv","version":3}},"canonical_sha256":"0ee68e2a00de55e63b1c55f5f5c8d960d0d2c323a63f68a35fa5a63521d2942d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ee68e2a00de55e63b1c55f5f5c8d960d0d2c323a63f68a35fa5a63521d2942d","first_computed_at":"2026-05-18T00:29:51.368913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.368913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"358xyQai1Ewe/Fbm2GodwUVh7Zkx/MpBRNDeiNJd746W1JD/xt4E+D38yA1PhdsQpnvkUOJ9cn7PTm/HoIfsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.369521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09460","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3da373119c90c75fbbd0c021d8daf5afa216a3098ba50af55c1a93c54c84bff7","sha256:59209011d35d8fa8072e15d20409e0d0b81da7fb4280d290ca9703e04ffdba85"],"state_sha256":"fbdc7d4d68e613514fd48e9a0595b9bb8fbb0cba58e2057b69a5bca39800d9ce"}