{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5NAZBSE5YRDQOR65BCQ42HCCGM","short_pith_number":"pith:5NAZBSE5","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"},"canonical_sha256":"eb4190c89dc4470747dd08a1cd1c423310a1d1bdc96137a640a92887476443a4","source":{"kind":"arxiv","id":"1301.3091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3091","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3091v2","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3091","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"5NAZBSE5YRDQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5NAZBSE5YRDQOR65","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5NAZBSE5","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5NAZBSE5YRDQOR65BCQ42HCCGM","target":"record","payload":{"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"},"canonical_sha256":"eb4190c89dc4470747dd08a1cd1c423310a1d1bdc96137a640a92887476443a4","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"},"source_kind":"arxiv","source_id":"1301.3091","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:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LemFfXm0i4APTy1u6yFNtfzYpAPGdD/1sQbDlBI18D3O0msp3d9t2LTQ+eXB45FsmAAdpiJdIpU41x/J0wU1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:14:37.717357Z"},"content_sha256":"4f5bd90eddd3ff623a06a36fed997e1cce2813d43d969c3c57672faff4ef3645","schema_version":"1.0","event_id":"sha256:4f5bd90eddd3ff623a06a36fed997e1cce2813d43d969c3c57672faff4ef3645"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5NAZBSE5YRDQOR65BCQ42HCCGM","target":"graph","payload":{"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"},"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:53:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgIZqVeV3or67JfbRUpjTL2xZY1atFKmHwo5cKcVuJJpi7962tuFcFBE2BtxyslOEI90gqub/PnbOM2TvdUbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:14:37.717714Z"},"content_sha256":"3cfd082f7740bcc70a6acec301c09965d1e7acdf426b1ab84d91ff2781bf93b5","schema_version":"1.0","event_id":"sha256:3cfd082f7740bcc70a6acec301c09965d1e7acdf426b1ab84d91ff2781bf93b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/bundle.json","state_url":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/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-06-01T18:14:37Z","links":{"resolver":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM","bundle":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/bundle.json","state":"https://pith.science/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NAZBSE5YRDQOR65BCQ42HCCGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5NAZBSE5YRDQOR65BCQ42HCCGM","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":"4f41271663b376045101b07d1038fc03a2b7e1bc81b0fb83150953bd71455927","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-01-14T18:42:41Z","title_canon_sha256":"5d2325a49316b11607c6d2961779c90a7c225f0f5ef5b9c0500de7ec08f072c0"},"schema_version":"1.0","source":{"id":"1301.3091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3091","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3091v2","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3091","created_at":"2026-05-18T02:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"5NAZBSE5YRDQ","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5NAZBSE5YRDQOR65","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5NAZBSE5","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:3cfd082f7740bcc70a6acec301c09965d1e7acdf426b1ab84d91ff2781bf93b5","target":"graph","created_at":"2026-05-18T02:53:27Z","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 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","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-01-14T18:42:41Z","title":"Strict inequalities for connective constants of transitive graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3091","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:4f5bd90eddd3ff623a06a36fed997e1cce2813d43d969c3c57672faff4ef3645","target":"record","created_at":"2026-05-18T02:53:27Z","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":"4f41271663b376045101b07d1038fc03a2b7e1bc81b0fb83150953bd71455927","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-01-14T18:42:41Z","title_canon_sha256":"5d2325a49316b11607c6d2961779c90a7c225f0f5ef5b9c0500de7ec08f072c0"},"schema_version":"1.0","source":{"id":"1301.3091","kind":"arxiv","version":2}},"canonical_sha256":"eb4190c89dc4470747dd08a1cd1c423310a1d1bdc96137a640a92887476443a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb4190c89dc4470747dd08a1cd1c423310a1d1bdc96137a640a92887476443a4","first_computed_at":"2026-05-18T02:53:27.209555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:27.209555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"20VHDEIxPmOmYQRIBY4fNz/fTpqGxLZDeuadR6MhT6PuyAcxqYoUrT8aMWIE4oT8mcEi28SHAmDBQ1KIACCcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:27.210280Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f5bd90eddd3ff623a06a36fed997e1cce2813d43d969c3c57672faff4ef3645","sha256:3cfd082f7740bcc70a6acec301c09965d1e7acdf426b1ab84d91ff2781bf93b5"],"state_sha256":"e5ecdcc47a796cb01512ea319dd3ca58a9665b32e13f559a5cb7d65114df7657"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jE1xAo1XniZKvtlWymDohH15XMeY1RFbkjk4xZA86KT/xlO96c6ZusIS3KqMBqAoArFsGrh+e/ML6WeykcpWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:14:37.719642Z","bundle_sha256":"c4e47e05c3498663d97cc400a162154c118d59ac9fc511e653dfab0937735e7a"}}