{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5NAZBSE5YRDQOR65BCQ42HCCGM","short_pith_number":"pith:5NAZBSE5","schema_version":"1.0","canonical_sha256":"eb4190c89dc4470747dd08a1cd1c423310a1d1bdc96137a640a92887476443a4","source":{"kind":"arxiv","id":"1301.3091","version":2},"attestation_state":"computed","paper":{"title":"Strict inequalities for connective constants of transitive graphs","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-01-14T18:42:41Z","abstract_excerpt":"The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the grou"},"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":"1301.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-14T18:42:41Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"5d2325a49316b11607c6d2961779c90a7c225f0f5ef5b9c0500de7ec08f072c0","abstract_canon_sha256":"4f41271663b376045101b07d1038fc03a2b7e1bc81b0fb83150953bd71455927"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:27.210280Z","signature_b64":"20VHDEIxPmOmYQRIBY4fNz/fTpqGxLZDeuadR6MhT6PuyAcxqYoUrT8aMWIE4oT8mcEi28SHAmDBQ1KIACCcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4190c89dc4470747dd08a1cd1c423310a1d1bdc96137a640a92887476443a4","last_reissued_at":"2026-05-18T02:53:27.209555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:27.209555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strict inequalities for connective constants of transitive graphs","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-01-14T18:42:41Z","abstract_excerpt":"The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective constant decreases strictly when the graph is replaced by a non-trivial quotient graph. Secondly, the connective constant increases strictly when a quasi-transitive family of new edges is added. These results have the following implications for Cayley graphs. The connective constant of a Cayley graph decreases strictly when a new relator is added to the grou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3091","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":"1301.3091","created_at":"2026-05-18T02:53:27.209691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3091v2","created_at":"2026-05-18T02:53:27.209691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3091","created_at":"2026-05-18T02:53:27.209691+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NAZBSE5YRDQ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NAZBSE5YRDQOR65","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NAZBSE5","created_at":"2026-05-18T12:27:34.582898+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/5NAZBSE5YRDQOR65BCQ42HCCGM","json":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM.json","graph_json":"https://pith.science/api/pith-number/5NAZBSE5YRDQOR65BCQ42HCCGM/graph.json","events_json":"https://pith.science/api/pith-number/5NAZBSE5YRDQOR65BCQ42HCCGM/events.json","paper":"https://pith.science/paper/5NAZBSE5"},"agent_actions":{"view_html":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM","download_json":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM.json","view_paper":"https://pith.science/paper/5NAZBSE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3091&json=true","fetch_graph":"https://pith.science/api/pith-number/5NAZBSE5YRDQOR65BCQ42HCCGM/graph.json","fetch_events":"https://pith.science/api/pith-number/5NAZBSE5YRDQOR65BCQ42HCCGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/action/storage_attestation","attest_author":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/action/author_attestation","sign_citation":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/action/citation_signature","submit_replication":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/action/replication_record"}},"created_at":"2026-05-18T02:53:27.209691+00:00","updated_at":"2026-05-18T02:53:27.209691+00:00"}