{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5ZO3ZLIXAQENWOLD7NSLQR3SR5","short_pith_number":"pith:5ZO3ZLIX","canonical_record":{"source":{"id":"1210.5649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T19:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"d13ea00cb16b861f95cb25fecfbd0c850bce7b42b03de0f6b78e41113b8303ec","abstract_canon_sha256":"29bcb90a1d45ef473b1658a7ab02db638b168cec5e276aabe296bd47f9db6772"},"schema_version":"1.0"},"canonical_sha256":"ee5dbcad170408db3963fb64b847728f77ff9fc78ca074622a4bcd0857e91b8f","source":{"kind":"arxiv","id":"1210.5649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5649","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5649v1","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5649","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"5ZO3ZLIXAQEN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5ZO3ZLIXAQENWOLD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5ZO3ZLIX","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5ZO3ZLIXAQENWOLD7NSLQR3SR5","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T19:39:34Z","cross_cats_sorted":[],"title_canon_sha256":"d13ea00cb16b861f95cb25fecfbd0c850bce7b42b03de0f6b78e41113b8303ec","abstract_canon_sha256":"29bcb90a1d45ef473b1658a7ab02db638b168cec5e276aabe296bd47f9db6772"},"schema_version":"1.0"},"canonical_sha256":"ee5dbcad170408db3963fb64b847728f77ff9fc78ca074622a4bcd0857e91b8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:43.449121Z","signature_b64":"2panLgnk/40AqvFn9HNyPeaBj9gXcx7vZXhoMEllEzeIAhK0OTyhGbc4YDCjOew9W8P/f9kUjBit4kot6HkTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5dbcad170408db3963fb64b847728f77ff9fc78ca074622a4bcd0857e91b8f","last_reissued_at":"2026-05-18T03:42:43.448506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:43.448506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5649","source_version":1,"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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdHffRQ+Df5JUGGt5cLHSJ9A+9m9xRdUosTcuc9hzK9VkFecrZWu7Hbv+3VOVwcF1Xhnj9OAfrsPO2RL4BpnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:37:03.841459Z"},"content_sha256":"c07ff07c813f8160e183604daa2ab1223d057de86fe4cbca62e5f45f920a13de","schema_version":"1.0","event_id":"sha256:c07ff07c813f8160e183604daa2ab1223d057de86fe4cbca62e5f45f920a13de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5ZO3ZLIXAQENWOLD7NSLQR3SR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-distance-regular graphs are distance-regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Dalf\\'o, C. Delorme, H. Suzuki, M.A. Fiol, M. C\\'amara","submitted_at":"2012-10-20T19:39:34Z","abstract_excerpt":"A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph $\\G$ is distance-regular and homogeneous. More precisely, $\\G$ is edge-distance-regular if and only if it is bipartite distance-regular or a generalized odd graph. Also, we obtain the relationships between some of their corresponding parameters, mainly, the distance polynomials and the intersection numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5649","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"},"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:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0chMrUCsQFvgTDAUiQE9HpR5yjWwKPUwvMutFjYCLdZxiK7VmU+jVL+fY1AEmPCfbKreMsOKt5+S98zXE2TCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:37:03.841812Z"},"content_sha256":"ed440028e0314059d33ba21af9159d4dd13dc3071949d0e837ba20f44fda6935","schema_version":"1.0","event_id":"sha256:ed440028e0314059d33ba21af9159d4dd13dc3071949d0e837ba20f44fda6935"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5/bundle.json","state_url":"https://pith.science/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5/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-23T00:37:03Z","links":{"resolver":"https://pith.science/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5","bundle":"https://pith.science/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5/bundle.json","state":"https://pith.science/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZO3ZLIXAQENWOLD7NSLQR3SR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5ZO3ZLIXAQENWOLD7NSLQR3SR5","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":"29bcb90a1d45ef473b1658a7ab02db638b168cec5e276aabe296bd47f9db6772","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T19:39:34Z","title_canon_sha256":"d13ea00cb16b861f95cb25fecfbd0c850bce7b42b03de0f6b78e41113b8303ec"},"schema_version":"1.0","source":{"id":"1210.5649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5649","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5649v1","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5649","created_at":"2026-05-18T03:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"5ZO3ZLIXAQEN","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5ZO3ZLIXAQENWOLD","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5ZO3ZLIX","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ed440028e0314059d33ba21af9159d4dd13dc3071949d0e837ba20f44fda6935","target":"graph","created_at":"2026-05-18T03:42:43Z","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":"A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph $\\G$ is distance-regular and homogeneous. More precisely, $\\G$ is edge-distance-regular if and only if it is bipartite distance-regular or a generalized odd graph. Also, we obtain the relationships between some of their corresponding parameters, mainly, the distance polynomials and the intersection numbers.","authors_text":"C. Dalf\\'o, C. Delorme, H. Suzuki, M.A. Fiol, M. C\\'amara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T19:39:34Z","title":"Edge-distance-regular graphs are distance-regular"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5649","kind":"arxiv","version":1},"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:c07ff07c813f8160e183604daa2ab1223d057de86fe4cbca62e5f45f920a13de","target":"record","created_at":"2026-05-18T03:42:43Z","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":"29bcb90a1d45ef473b1658a7ab02db638b168cec5e276aabe296bd47f9db6772","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-20T19:39:34Z","title_canon_sha256":"d13ea00cb16b861f95cb25fecfbd0c850bce7b42b03de0f6b78e41113b8303ec"},"schema_version":"1.0","source":{"id":"1210.5649","kind":"arxiv","version":1}},"canonical_sha256":"ee5dbcad170408db3963fb64b847728f77ff9fc78ca074622a4bcd0857e91b8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee5dbcad170408db3963fb64b847728f77ff9fc78ca074622a4bcd0857e91b8f","first_computed_at":"2026-05-18T03:42:43.448506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:43.448506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2panLgnk/40AqvFn9HNyPeaBj9gXcx7vZXhoMEllEzeIAhK0OTyhGbc4YDCjOew9W8P/f9kUjBit4kot6HkTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:43.449121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c07ff07c813f8160e183604daa2ab1223d057de86fe4cbca62e5f45f920a13de","sha256:ed440028e0314059d33ba21af9159d4dd13dc3071949d0e837ba20f44fda6935"],"state_sha256":"6813408a5ae41db79d2204b0701d07228aedca011c23bdf9f04889bb7f25765a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYEMGd9uMW9/4TuFnMJjcPqw4RG6AieiJvJIl5X+vzoKKJcTFHYnnC3VJlg5kvaYug1rylnurvs0ICa+jIunAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:37:03.843843Z","bundle_sha256":"b9a2271335f33f359aa483c508d9abe265e5a69b0c418d6d6eacd537af28953b"}}