{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KQ2VN5DCWYGXRL724AWEGPBE2C","short_pith_number":"pith:KQ2VN5DC","schema_version":"1.0","canonical_sha256":"543556f462b60d78affae02c433c24d09b60af80dfd17ca6e43d8eb6dfb08fd3","source":{"kind":"arxiv","id":"1508.03835","version":1},"attestation_state":"computed","paper":{"title":"Distance mean-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M.A. Fiol, V. Diego","submitted_at":"2015-08-16T15:13:18Z","abstract_excerpt":"We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and adjacency algebra ${\\cal A}$. Then, $\\Gamma$ is $distance$ $mean$-$regular$ when, for a given $u\\in V$, the averages of the intersection numbers $p_{ij}^h(u,v)=|\\Gamma_i(u)\\cap \\Gamma_j(v)|$ (number of vertices at distance $i$ from $u$ and distance $j$ from $v$) computed over all vertices $v$ at a given distance $h\\in \\{0,1,\\ldots,D\\}$ from $u$, do not depend on "},"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":"1508.03835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-16T15:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"72486b134fb048d1b0ab699566af6278ad9d250eb1d5ed4c5d743e399bb3431d","abstract_canon_sha256":"6be057c93e23dd2d6277ed597da8fd090b89c3f96e1aa3dd860759f3edcdb2ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.119981Z","signature_b64":"15ZP4YSXUKVm5bLiMmihRFlxbGVdk0/Rg50cJB92l5B4IUF8jNT6k4SzTN41nOPTr+1SdUXeePaKxbbgocybCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543556f462b60d78affae02c433c24d09b60af80dfd17ca6e43d8eb6dfb08fd3","last_reissued_at":"2026-05-18T01:35:15.119451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.119451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance mean-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M.A. Fiol, V. Diego","submitted_at":"2015-08-16T15:13:18Z","abstract_excerpt":"We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and adjacency algebra ${\\cal A}$. Then, $\\Gamma$ is $distance$ $mean$-$regular$ when, for a given $u\\in V$, the averages of the intersection numbers $p_{ij}^h(u,v)=|\\Gamma_i(u)\\cap \\Gamma_j(v)|$ (number of vertices at distance $i$ from $u$ and distance $j$ from $v$) computed over all vertices $v$ at a given distance $h\\in \\{0,1,\\ldots,D\\}$ from $u$, do not depend on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03835","kind":"arxiv","version":1},"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":"1508.03835","created_at":"2026-05-18T01:35:15.119550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03835v1","created_at":"2026-05-18T01:35:15.119550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03835","created_at":"2026-05-18T01:35:15.119550+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQ2VN5DCWYGX","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQ2VN5DCWYGXRL72","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQ2VN5DC","created_at":"2026-05-18T12:29:29.992203+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/KQ2VN5DCWYGXRL724AWEGPBE2C","json":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C.json","graph_json":"https://pith.science/api/pith-number/KQ2VN5DCWYGXRL724AWEGPBE2C/graph.json","events_json":"https://pith.science/api/pith-number/KQ2VN5DCWYGXRL724AWEGPBE2C/events.json","paper":"https://pith.science/paper/KQ2VN5DC"},"agent_actions":{"view_html":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C","download_json":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C.json","view_paper":"https://pith.science/paper/KQ2VN5DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03835&json=true","fetch_graph":"https://pith.science/api/pith-number/KQ2VN5DCWYGXRL724AWEGPBE2C/graph.json","fetch_events":"https://pith.science/api/pith-number/KQ2VN5DCWYGXRL724AWEGPBE2C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C/action/storage_attestation","attest_author":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C/action/author_attestation","sign_citation":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C/action/citation_signature","submit_replication":"https://pith.science/pith/KQ2VN5DCWYGXRL724AWEGPBE2C/action/replication_record"}},"created_at":"2026-05-18T01:35:15.119550+00:00","updated_at":"2026-05-18T01:35:15.119550+00:00"}