{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LHV4FI6DCYZ4ZG6ZVQVTQOMAMH","short_pith_number":"pith:LHV4FI6D","schema_version":"1.0","canonical_sha256":"59ebc2a3c31633cc9bd9ac2b38398061e83ad86348880abfa7d1fa57a0dfdb15","source":{"kind":"arxiv","id":"1304.2905","version":3},"attestation_state":"computed","paper":{"title":"Geometric aspects of 2-walk-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edwin R. van Dam, Jack H. Koolen, Jongyook Park, Marc C\\'amara","submitted_at":"2013-04-10T10:51:28Z","abstract_excerpt":"A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular graphs and $t$-arc-transitive graphs. In this paper, we will focus on 1- and in particular 2-walk-regular graphs, and study analogues of certain results that are important for distance regular graphs. We will generalize Delsarte's clique bound to 1-walk-regular graphs, Godsil's multiplicity bound and Terwilliger's analysis of the local structure to 2-walk-r"},"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":"1304.2905","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-10T10:51:28Z","cross_cats_sorted":[],"title_canon_sha256":"b1c8bcf7513be9d03993c76bff28260f4bef06b8019520245736db061146857e","abstract_canon_sha256":"eba30a2de9de410149dad3cb873d1ade0502fafd84a098170a6f49af671db5c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.188391Z","signature_b64":"VeRQTEPE17UhcvAIEKPrW+w/IMQWBPgZeGsokZfXPFvehjuX5cXwcLs9mmczPstHh5lUkluqRYhNREVLEB6oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59ebc2a3c31633cc9bd9ac2b38398061e83ad86348880abfa7d1fa57a0dfdb15","last_reissued_at":"2026-05-18T01:26:11.187758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.187758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric aspects of 2-walk-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edwin R. van Dam, Jack H. Koolen, Jongyook Park, Marc C\\'amara","submitted_at":"2013-04-10T10:51:28Z","abstract_excerpt":"A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular graphs and $t$-arc-transitive graphs. In this paper, we will focus on 1- and in particular 2-walk-regular graphs, and study analogues of certain results that are important for distance regular graphs. We will generalize Delsarte's clique bound to 1-walk-regular graphs, Godsil's multiplicity bound and Terwilliger's analysis of the local structure to 2-walk-r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2905","kind":"arxiv","version":3},"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":"1304.2905","created_at":"2026-05-18T01:26:11.187849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2905v3","created_at":"2026-05-18T01:26:11.187849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2905","created_at":"2026-05-18T01:26:11.187849+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHV4FI6DCYZ4","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHV4FI6DCYZ4ZG6Z","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHV4FI6D","created_at":"2026-05-18T12:27:51.066281+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/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH","json":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH.json","graph_json":"https://pith.science/api/pith-number/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/graph.json","events_json":"https://pith.science/api/pith-number/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/events.json","paper":"https://pith.science/paper/LHV4FI6D"},"agent_actions":{"view_html":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH","download_json":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH.json","view_paper":"https://pith.science/paper/LHV4FI6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2905&json=true","fetch_graph":"https://pith.science/api/pith-number/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/graph.json","fetch_events":"https://pith.science/api/pith-number/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/action/storage_attestation","attest_author":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/action/author_attestation","sign_citation":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/action/citation_signature","submit_replication":"https://pith.science/pith/LHV4FI6DCYZ4ZG6ZVQVTQOMAMH/action/replication_record"}},"created_at":"2026-05-18T01:26:11.187849+00:00","updated_at":"2026-05-18T01:26:11.187849+00:00"}