{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NKWNFA47OP6GXBZXFI7PH23FAF","short_pith_number":"pith:NKWNFA47","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"},"canonical_sha256":"6aacd2839f73fc6b87372a3ef3eb65015bfd7a6362f3db4dbfaf5b46da776671","source":{"kind":"arxiv","id":"1304.7216","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7216","created_at":"2026-05-18T02:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7216v2","created_at":"2026-05-18T02:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7216","created_at":"2026-05-18T02:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"NKWNFA47OP6G","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NKWNFA47OP6GXBZX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NKWNFA47","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NKWNFA47OP6GXBZXFI7PH23FAF","target":"record","payload":{"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"},"canonical_sha256":"6aacd2839f73fc6b87372a3ef3eb65015bfd7a6362f3db4dbfaf5b46da776671","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"},"source_kind":"arxiv","source_id":"1304.7216","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vx1Qb9er/QmCRjasG0gRVE95WH0ZCyArLQN8MID8C0FwM283Wvk4B4HtxY42kxKlFW9G1OaFX3+d55fJ/MMfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:06:12.951728Z"},"content_sha256":"5b4b98c5c78bc77c8211a887d680afc95a8d5b1a238f698e6ced177106daaee5","schema_version":"1.0","event_id":"sha256:5b4b98c5c78bc77c8211a887d680afc95a8d5b1a238f698e6ced177106daaee5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NKWNFA47OP6GXBZXFI7PH23FAF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs7OXtL/8UEHg1orsnirMTt/IVK2SyrvoLw9VV4uGkS7G15OUbct4vFW5tkF6chsCCCk/Rb83piB4UvTU031DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:06:12.952473Z"},"content_sha256":"458020182cfd8e89481e68ccaa2dc42d151855266cca8fbb9163406e6b30d76e","schema_version":"1.0","event_id":"sha256:458020182cfd8e89481e68ccaa2dc42d151855266cca8fbb9163406e6b30d76e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/bundle.json","state_url":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKWNFA47OP6GXBZXFI7PH23FAF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T21:06:12Z","links":{"resolver":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF","bundle":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/bundle.json","state":"https://pith.science/pith/NKWNFA47OP6GXBZXFI7PH23FAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKWNFA47OP6GXBZXFI7PH23FAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NKWNFA47OP6GXBZXFI7PH23FAF","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":"9db0308a8937bab1ecc74e5ae173fcf3008fe7e609906282fcaf42953ab8f0d6","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-26T16:15:22Z","title_canon_sha256":"81fbc34e62b5b3667e5c2818e0fbc1617a3c1a5b5e3b0fe2a08b661e4e084106"},"schema_version":"1.0","source":{"id":"1304.7216","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7216","created_at":"2026-05-18T02:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7216v2","created_at":"2026-05-18T02:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7216","created_at":"2026-05-18T02:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"NKWNFA47OP6G","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NKWNFA47OP6GXBZX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NKWNFA47","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:458020182cfd8e89481e68ccaa2dc42d151855266cca8fbb9163406e6b30d76e","target":"graph","created_at":"2026-05-18T02:20:18Z","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 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","authors_text":"Geoffrey R. Grimmett, Zhongyang Li","cross_cats":["math-ph","math.MP","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-26T16:15:22Z","title":"Counting self-avoiding walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7216","kind":"arxiv","version":2},"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:5b4b98c5c78bc77c8211a887d680afc95a8d5b1a238f698e6ced177106daaee5","target":"record","created_at":"2026-05-18T02:20:18Z","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":"9db0308a8937bab1ecc74e5ae173fcf3008fe7e609906282fcaf42953ab8f0d6","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-26T16:15:22Z","title_canon_sha256":"81fbc34e62b5b3667e5c2818e0fbc1617a3c1a5b5e3b0fe2a08b661e4e084106"},"schema_version":"1.0","source":{"id":"1304.7216","kind":"arxiv","version":2}},"canonical_sha256":"6aacd2839f73fc6b87372a3ef3eb65015bfd7a6362f3db4dbfaf5b46da776671","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aacd2839f73fc6b87372a3ef3eb65015bfd7a6362f3db4dbfaf5b46da776671","first_computed_at":"2026-05-18T02:20:18.502697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:18.502697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQ6a31j5o6RnuMv5wnq/kbvu6/fgkOmeBxsWdms3BjCktbuRrak/0XLjfw7dTmddXUw7/Nki0GIrZ5HSwjHBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:18.503283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7216","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b4b98c5c78bc77c8211a887d680afc95a8d5b1a238f698e6ced177106daaee5","sha256:458020182cfd8e89481e68ccaa2dc42d151855266cca8fbb9163406e6b30d76e"],"state_sha256":"6cb71b400365f4aaa250a5b39793ea18fda2f41f8b6451d754c662b28f024bc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6u6H7fmlt3434NKar1aey9RIQ5vkWUv1+1H52txyrngtCRh1f8ic+76q2SIl9Jq4dvwZnLlNETGP/wzAHNwtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:06:12.956634Z","bundle_sha256":"a55dab89cb1725a14fa914a462ed37930d10b522c8237ed6475742b5ab43def5"}}