{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NKWNFA47OP6GXBZXFI7PH23FAF","short_pith_number":"pith:NKWNFA47","schema_version":"1.0","canonical_sha256":"6aacd2839f73fc6b87372a3ef3eb65015bfd7a6362f3db4dbfaf5b46da776671","source":{"kind":"arxiv","id":"1304.7216","version":2},"attestation_state":"computed","paper":{"title":"Counting self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","submitted_at":"2013-04-26T16:15:22Z","abstract_excerpt":"The connective constant $\\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph $G$. Firstly, when $G$ is cubic, we study the effect on $\\mu(G)$ of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss upper and lower bounds for $\\mu(G)$ when $G$ is regular. Thirdly, we present strict inequalities for the connective constants $\\mu(G)$ of vertex-transitive graphs $G$, as $G$ varies. As a"},"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":"1304.7216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-26T16:15:22Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"81fbc34e62b5b3667e5c2818e0fbc1617a3c1a5b5e3b0fe2a08b661e4e084106","abstract_canon_sha256":"9db0308a8937bab1ecc74e5ae173fcf3008fe7e609906282fcaf42953ab8f0d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:18.503283Z","signature_b64":"KQ6a31j5o6RnuMv5wnq/kbvu6/fgkOmeBxsWdms3BjCktbuRrak/0XLjfw7dTmddXUw7/Nki0GIrZ5HSwjHBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aacd2839f73fc6b87372a3ef3eb65015bfd7a6362f3db4dbfaf5b46da776671","last_reissued_at":"2026-05-18T02:20:18.502697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:18.502697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting self-avoiding walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","submitted_at":"2013-04-26T16:15:22Z","abstract_excerpt":"The connective constant $\\mu(G)$ of a graph $G$ is the asymptotic growth rate of the number of self-avoiding walks on $G$ from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph $G$. Firstly, when $G$ is cubic, we study the effect on $\\mu(G)$ of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss upper and lower bounds for $\\mu(G)$ when $G$ is regular. Thirdly, we present strict inequalities for the connective constants $\\mu(G)$ of vertex-transitive graphs $G$, as $G$ varies. As a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7216","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":"1304.7216","created_at":"2026-05-18T02:20:18.502881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7216v2","created_at":"2026-05-18T02:20:18.502881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7216","created_at":"2026-05-18T02:20:18.502881+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKWNFA47OP6G","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKWNFA47OP6GXBZX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKWNFA47","created_at":"2026-05-18T12:27:52.871228+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/NKWNFA47OP6GXBZXFI7PH23FAF","json":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF.json","graph_json":"https://pith.science/api/pith-number/NKWNFA47OP6GXBZXFI7PH23FAF/graph.json","events_json":"https://pith.science/api/pith-number/NKWNFA47OP6GXBZXFI7PH23FAF/events.json","paper":"https://pith.science/paper/NKWNFA47"},"agent_actions":{"view_html":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF","download_json":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF.json","view_paper":"https://pith.science/paper/NKWNFA47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7216&json=true","fetch_graph":"https://pith.science/api/pith-number/NKWNFA47OP6GXBZXFI7PH23FAF/graph.json","fetch_events":"https://pith.science/api/pith-number/NKWNFA47OP6GXBZXFI7PH23FAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/action/storage_attestation","attest_author":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/action/author_attestation","sign_citation":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/action/citation_signature","submit_replication":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/action/replication_record"}},"created_at":"2026-05-18T02:20:18.502881+00:00","updated_at":"2026-05-18T02:20:18.502881+00:00"}