{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VP5NBVQB5D2JMPIBD3NHNAY46R","short_pith_number":"pith:VP5NBVQB","canonical_record":{"source":{"id":"1704.05884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T18:24:29Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"3838146dfd0de0b40ddebe8544cb5e1580d7a8126cb2baec37f19c7bd8cc2bab","abstract_canon_sha256":"1819f368b43b136818c04fd2604883c81aece1829d68a5c5fb85636a4f026aad"},"schema_version":"1.0"},"canonical_sha256":"abfad0d601e8f4963d011eda76831cf45eb467d82fe1156be7c8a5946d8108c2","source":{"kind":"arxiv","id":"1704.05884","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05884","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05884v2","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05884","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"VP5NBVQB5D2J","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VP5NBVQB5D2JMPIB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VP5NBVQB","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VP5NBVQB5D2JMPIBD3NHNAY46R","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05884","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T18:24:29Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"3838146dfd0de0b40ddebe8544cb5e1580d7a8126cb2baec37f19c7bd8cc2bab","abstract_canon_sha256":"1819f368b43b136818c04fd2604883c81aece1829d68a5c5fb85636a4f026aad"},"schema_version":"1.0"},"canonical_sha256":"abfad0d601e8f4963d011eda76831cf45eb467d82fe1156be7c8a5946d8108c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:49.914047Z","signature_b64":"N8V0jjDs926DgB/A23aZmBCryF1/m0YD437jsMb951zEk+wwDNl2p409EXgLtxzIxbL3TioPr/7NB+2Dgfh2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abfad0d601e8f4963d011eda76831cf45eb467d82fe1156be7c8a5946d8108c2","last_reissued_at":"2026-05-17T23:40:49.913381Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:49.913381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05884","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-17T23:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxzmOXBevd8huL3xiKFH5wflNSCt2ug+HQDlu6KC0Ya17ocBF7p6hbGCMHGn+8CQ5urYh37C+vbG6gR82YWECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:16.251505Z"},"content_sha256":"c4d528e2e95953f334cc8ef88cd925c78813cb9014c7a6e7db727c0a0808ce1c","schema_version":"1.0","event_id":"sha256:c4d528e2e95953f334cc8ef88cd925c78813cb9014c7a6e7db727c0a0808ce1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VP5NBVQB5D2JMPIBD3NHNAY46R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-avoiding walks and connective constants","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":"2017-04-19T18:24:29Z","abstract_excerpt":"The connective constant $\\mu(G)$ of a quasi-transitive graph $G$ is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on $G$ from a given starting vertex. We survey several aspects of the relationship between the connective constant and the underlying graph $G$.\n  $\\bullet$ We present upper and lower bounds for $\\mu$ in terms of the vertex-degree and girth of a transitive graph.\n  $\\bullet$ We discuss the question of whether $\\mu\\ge\\phi$ for transitive cubic graphs (where $\\phi$ denotes the golden mean), and we introduce the Fisher transformation for SAWs (that is, the rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05884","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-17T23:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CFmZXT37O0h0D4mTAvQrkGLCk/B0/3r/Eux+d2mEtx9FqDyNPVZWklhBppDXIT/jYKGgnVWg3gDlsBdCSHvMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:16.252159Z"},"content_sha256":"33cf010176a56a7703798b46bde0b0c14b5b6c8d6574e181abb62fe58a39de45","schema_version":"1.0","event_id":"sha256:33cf010176a56a7703798b46bde0b0c14b5b6c8d6574e181abb62fe58a39de45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VP5NBVQB5D2JMPIBD3NHNAY46R/bundle.json","state_url":"https://pith.science/pith/VP5NBVQB5D2JMPIBD3NHNAY46R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VP5NBVQB5D2JMPIBD3NHNAY46R/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-28T16:49:16Z","links":{"resolver":"https://pith.science/pith/VP5NBVQB5D2JMPIBD3NHNAY46R","bundle":"https://pith.science/pith/VP5NBVQB5D2JMPIBD3NHNAY46R/bundle.json","state":"https://pith.science/pith/VP5NBVQB5D2JMPIBD3NHNAY46R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VP5NBVQB5D2JMPIBD3NHNAY46R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VP5NBVQB5D2JMPIBD3NHNAY46R","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":"1819f368b43b136818c04fd2604883c81aece1829d68a5c5fb85636a4f026aad","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T18:24:29Z","title_canon_sha256":"3838146dfd0de0b40ddebe8544cb5e1580d7a8126cb2baec37f19c7bd8cc2bab"},"schema_version":"1.0","source":{"id":"1704.05884","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05884","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05884v2","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05884","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"VP5NBVQB5D2J","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VP5NBVQB5D2JMPIB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VP5NBVQB","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:33cf010176a56a7703798b46bde0b0c14b5b6c8d6574e181abb62fe58a39de45","target":"graph","created_at":"2026-05-17T23:40:49Z","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 quasi-transitive graph $G$ is the asymptotic growth rate of the number of self-avoiding walks (SAWs) on $G$ from a given starting vertex. We survey several aspects of the relationship between the connective constant and the underlying graph $G$.\n  $\\bullet$ We present upper and lower bounds for $\\mu$ in terms of the vertex-degree and girth of a transitive graph.\n  $\\bullet$ We discuss the question of whether $\\mu\\ge\\phi$ for transitive cubic graphs (where $\\phi$ denotes the golden mean), and we introduce the Fisher transformation for SAWs (that is, the rep","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":"2017-04-19T18:24:29Z","title":"Self-avoiding walks and connective constants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05884","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:c4d528e2e95953f334cc8ef88cd925c78813cb9014c7a6e7db727c0a0808ce1c","target":"record","created_at":"2026-05-17T23:40:49Z","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":"1819f368b43b136818c04fd2604883c81aece1829d68a5c5fb85636a4f026aad","cross_cats_sorted":["math-ph","math.MP","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-19T18:24:29Z","title_canon_sha256":"3838146dfd0de0b40ddebe8544cb5e1580d7a8126cb2baec37f19c7bd8cc2bab"},"schema_version":"1.0","source":{"id":"1704.05884","kind":"arxiv","version":2}},"canonical_sha256":"abfad0d601e8f4963d011eda76831cf45eb467d82fe1156be7c8a5946d8108c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abfad0d601e8f4963d011eda76831cf45eb467d82fe1156be7c8a5946d8108c2","first_computed_at":"2026-05-17T23:40:49.913381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:49.913381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N8V0jjDs926DgB/A23aZmBCryF1/m0YD437jsMb951zEk+wwDNl2p409EXgLtxzIxbL3TioPr/7NB+2Dgfh2DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:49.914047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05884","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4d528e2e95953f334cc8ef88cd925c78813cb9014c7a6e7db727c0a0808ce1c","sha256:33cf010176a56a7703798b46bde0b0c14b5b6c8d6574e181abb62fe58a39de45"],"state_sha256":"52ef7583cff729631f349cc971a8d7f89cfbcb793e85d28dcb2a1b1ebbe3c651"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jl4mTCLRNKkENvm2OZ2iRH9DzkJINGfo2Sw/0e3U8nH3tjNaA9a9VE+6MIdQoFzh74Bk+xwH395ToXqIllfaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:49:16.255536Z","bundle_sha256":"5bcb29509e75b94ed48d9de5b54945581486a9c1946ae7b940435e3b6c843e81"}}