{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2ISFBJT3IXDX6QMESYGRYNEBCS","short_pith_number":"pith:2ISFBJT3","schema_version":"1.0","canonical_sha256":"d22450a67b45c77f4184960d1c34811487d6bddf4b2e1abc4dc7fb5aa2dd7134","source":{"kind":"arxiv","id":"1210.6277","version":2},"attestation_state":"computed","paper":{"title":"Bounds on connective constants of regular 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":"2012-10-23T16:05:33Z","abstract_excerpt":"Bounds are proved for the connective constant \\mu\\ of an infinite, connected, \\Delta-regular graph G. The main result is that \\mu\\ \\ge \\sqrt{\\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker conditions under which it is sharp."},"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":"1210.6277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-23T16:05:33Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"73cac46b173e073cb90b4356c7c6eeab0bf237c5ea2eb69785ef44e22ef94e51","abstract_canon_sha256":"d03372662dc8c9fde2dfb219e58f509339d450466243203cf7dc94974ae40b55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:42.760631Z","signature_b64":"aAqn7sfyAI/nkygI1yFi1e15BcxQD0c65apKT5Nr3H2M8W5TaKMsJicCJd1embI2AN9XUqlr0fmFVWnrZQm+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d22450a67b45c77f4184960d1c34811487d6bddf4b2e1abc4dc7fb5aa2dd7134","last_reissued_at":"2026-05-18T03:26:42.759957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:42.759957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on connective constants of regular 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":"2012-10-23T16:05:33Z","abstract_excerpt":"Bounds are proved for the connective constant \\mu\\ of an infinite, connected, \\Delta-regular graph G. The main result is that \\mu\\ \\ge \\sqrt{\\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker conditions under which it is sharp."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6277","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":"1210.6277","created_at":"2026-05-18T03:26:42.760064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.6277v2","created_at":"2026-05-18T03:26:42.760064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6277","created_at":"2026-05-18T03:26:42.760064+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ISFBJT3IXDX","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ISFBJT3IXDX6QME","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ISFBJT3","created_at":"2026-05-18T12:26:50.516681+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/2ISFBJT3IXDX6QMESYGRYNEBCS","json":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS.json","graph_json":"https://pith.science/api/pith-number/2ISFBJT3IXDX6QMESYGRYNEBCS/graph.json","events_json":"https://pith.science/api/pith-number/2ISFBJT3IXDX6QMESYGRYNEBCS/events.json","paper":"https://pith.science/paper/2ISFBJT3"},"agent_actions":{"view_html":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS","download_json":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS.json","view_paper":"https://pith.science/paper/2ISFBJT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.6277&json=true","fetch_graph":"https://pith.science/api/pith-number/2ISFBJT3IXDX6QMESYGRYNEBCS/graph.json","fetch_events":"https://pith.science/api/pith-number/2ISFBJT3IXDX6QMESYGRYNEBCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS/action/storage_attestation","attest_author":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS/action/author_attestation","sign_citation":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS/action/citation_signature","submit_replication":"https://pith.science/pith/2ISFBJT3IXDX6QMESYGRYNEBCS/action/replication_record"}},"created_at":"2026-05-18T03:26:42.760064+00:00","updated_at":"2026-05-18T03:26:42.760064+00:00"}