{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PTMZIE4LZNGRU4JHFCEL3FG4RD","short_pith_number":"pith:PTMZIE4L","canonical_record":{"source":{"id":"1208.3067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-15T09:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"00b50857cd23a5586adb07ed99b548152400459360297da62e93627d5138d21a","abstract_canon_sha256":"5f30bc6d5c8c3a921b7785fbbc8b5b5e9930bb93ed99dcc3cea4d35071d5fae8"},"schema_version":"1.0"},"canonical_sha256":"7cd994138bcb4d1a71272888bd94dc88c6a8ac759420686d4094a86cc4c810f0","source":{"kind":"arxiv","id":"1208.3067","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3067","created_at":"2026-05-18T03:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3067v2","created_at":"2026-05-18T03:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3067","created_at":"2026-05-18T03:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"PTMZIE4LZNGR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PTMZIE4LZNGRU4JH","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PTMZIE4L","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PTMZIE4LZNGRU4JHFCEL3FG4RD","target":"record","payload":{"canonical_record":{"source":{"id":"1208.3067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-15T09:22:43Z","cross_cats_sorted":[],"title_canon_sha256":"00b50857cd23a5586adb07ed99b548152400459360297da62e93627d5138d21a","abstract_canon_sha256":"5f30bc6d5c8c3a921b7785fbbc8b5b5e9930bb93ed99dcc3cea4d35071d5fae8"},"schema_version":"1.0"},"canonical_sha256":"7cd994138bcb4d1a71272888bd94dc88c6a8ac759420686d4094a86cc4c810f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:01.905537Z","signature_b64":"2CYHDnHeqkj2k/zTLCxMrJaYD2SsoCjpoJlR0AZ6WKo8Vz/y1RrOt4+Ncy2468mPLT5w6sKA3OLGhdFM0el3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cd994138bcb4d1a71272888bd94dc88c6a8ac759420686d4094a86cc4c810f0","last_reissued_at":"2026-05-18T03:35:01.904798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:01.904798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.3067","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-18T03:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7K+3S6bmr332BrHcDopCNgHz2H3VACo2ztO187GSwkGLNI+hDLMVOsIcKT9PPreaR5ItYjbnxN32dddqbnqBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:12:44.619928Z"},"content_sha256":"b2bd7a7776ea1aa654a38c0eee5eeee2e66a3bf68693b43136ebdc51af163258","schema_version":"1.0","event_id":"sha256:b2bd7a7776ea1aa654a38c0eee5eeee2e66a3bf68693b43136ebdc51af163258"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PTMZIE4LZNGRU4JHFCEL3FG4RD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly 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, Gholamreza Omidi","submitted_at":"2012-08-15T09:22:43Z","abstract_excerpt":"We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\\ell >1$ such that the number of walks of length $\\ell$ from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. We will show that a strongly walk-regular graph must be an empty graph, a complete graph, a strongly regular graph, a disjoint union of complete bipartite graphs of the same size and isolated vertices, or a regular graph with four eigenvalues. Graphs from the first three families in this list are indeed strongly $\\ell$-w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3067","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-18T03:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ddeNW3UlKBhqYqo4bGhrAZhjh6EXHdqDkG0xQT57NV7GmKvDPIQh/RrtNRJqDKZqrBIyTjv1cuAIWhatY0UCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:12:44.620264Z"},"content_sha256":"417f39723fe0aa7747cdcc42df692285debcdacceab7567d4ca22ea3463461a9","schema_version":"1.0","event_id":"sha256:417f39723fe0aa7747cdcc42df692285debcdacceab7567d4ca22ea3463461a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD/bundle.json","state_url":"https://pith.science/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD/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-30T08:12:44Z","links":{"resolver":"https://pith.science/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD","bundle":"https://pith.science/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD/bundle.json","state":"https://pith.science/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTMZIE4LZNGRU4JHFCEL3FG4RD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PTMZIE4LZNGRU4JHFCEL3FG4RD","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":"5f30bc6d5c8c3a921b7785fbbc8b5b5e9930bb93ed99dcc3cea4d35071d5fae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-15T09:22:43Z","title_canon_sha256":"00b50857cd23a5586adb07ed99b548152400459360297da62e93627d5138d21a"},"schema_version":"1.0","source":{"id":"1208.3067","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.3067","created_at":"2026-05-18T03:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1208.3067v2","created_at":"2026-05-18T03:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3067","created_at":"2026-05-18T03:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"PTMZIE4LZNGR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PTMZIE4LZNGRU4JH","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PTMZIE4L","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:417f39723fe0aa7747cdcc42df692285debcdacceab7567d4ca22ea3463461a9","target":"graph","created_at":"2026-05-18T03:35:01Z","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":"We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\\ell >1$ such that the number of walks of length $\\ell$ from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. We will show that a strongly walk-regular graph must be an empty graph, a complete graph, a strongly regular graph, a disjoint union of complete bipartite graphs of the same size and isolated vertices, or a regular graph with four eigenvalues. Graphs from the first three families in this list are indeed strongly $\\ell$-w","authors_text":"Edwin R. van Dam, Gholamreza Omidi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-15T09:22:43Z","title":"Strongly walk-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3067","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:b2bd7a7776ea1aa654a38c0eee5eeee2e66a3bf68693b43136ebdc51af163258","target":"record","created_at":"2026-05-18T03:35:01Z","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":"5f30bc6d5c8c3a921b7785fbbc8b5b5e9930bb93ed99dcc3cea4d35071d5fae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-15T09:22:43Z","title_canon_sha256":"00b50857cd23a5586adb07ed99b548152400459360297da62e93627d5138d21a"},"schema_version":"1.0","source":{"id":"1208.3067","kind":"arxiv","version":2}},"canonical_sha256":"7cd994138bcb4d1a71272888bd94dc88c6a8ac759420686d4094a86cc4c810f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cd994138bcb4d1a71272888bd94dc88c6a8ac759420686d4094a86cc4c810f0","first_computed_at":"2026-05-18T03:35:01.904798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:01.904798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2CYHDnHeqkj2k/zTLCxMrJaYD2SsoCjpoJlR0AZ6WKo8Vz/y1RrOt4+Ncy2468mPLT5w6sKA3OLGhdFM0el3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:01.905537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.3067","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2bd7a7776ea1aa654a38c0eee5eeee2e66a3bf68693b43136ebdc51af163258","sha256:417f39723fe0aa7747cdcc42df692285debcdacceab7567d4ca22ea3463461a9"],"state_sha256":"0f87b6bd4b9fd2f6e05b5ce92716b92c6a56af5b740df1687807319ccdabf494"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLzq6MvDKHhC36ZDKfzC4xfjtW4pkvc3scngdUH939EfICsQVjg1OsLn0o9V/Wuz28fJda4I0mB3TBdzhnT4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T08:12:44.622201Z","bundle_sha256":"72be1f0c0faa9b09bed05fd9aaac95382b9d97ed7ec58cb71e141b9b244ad7be"}}