{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:36SODYM4BCFZY43CFDDCRNLE2S","short_pith_number":"pith:36SODYM4","canonical_record":{"source":{"id":"1608.00373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T10:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"cd9935af0f26a704ed94d468c0a9be1a9b21cccaf73455f7462a5c1d491fd981","abstract_canon_sha256":"7193d9d8ee2cae740a4e1cbee7e1685f39532c1d0271a96f4d111edc90241a9e"},"schema_version":"1.0"},"canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","source":{"kind":"arxiv","id":"1608.00373","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00373","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00373v2","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00373","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"36SODYM4BCFZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"36SODYM4BCFZY43C","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"36SODYM4","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:36SODYM4BCFZY43CFDDCRNLE2S","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T10:07:58Z","cross_cats_sorted":[],"title_canon_sha256":"cd9935af0f26a704ed94d468c0a9be1a9b21cccaf73455f7462a5c1d491fd981","abstract_canon_sha256":"7193d9d8ee2cae740a4e1cbee7e1685f39532c1d0271a96f4d111edc90241a9e"},"schema_version":"1.0"},"canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:34.488148Z","signature_b64":"7Ldss2SUCkQ7Unm1clIcnj76ycYKW1313wuVV/EprSKY4jC9t/hWze+aedalYIEnt801lyEkT6hNGru//+C9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","last_reissued_at":"2026-05-17T23:52:34.487800Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:34.487800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00373","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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3G8JubtyzoZKWysqdq3tHqmR1cshOZz61OWS9Qzmu0RNhfCruM50hnDbp92hy+70z3oy8Nb9+JgVcplrfxzDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:16:45.365188Z"},"content_sha256":"2f3cd3725e8d58dc027f0d6be553513dbb89c6249fd497c2d219a726c57029d3","schema_version":"1.0","event_id":"sha256:2f3cd3725e8d58dc027f0d6be553513dbb89c6249fd497c2d219a726c57029d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:36SODYM4BCFZY43CFDDCRNLE2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The spectral excess theorem for graphs with few eigenvalues whose distance-$2$ or distance-$1$-or-$2$ graph is strongly regular","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Dalf\\'o, J. Koolen, M.A. Fiol","submitted_at":"2016-08-01T10:07:58Z","abstract_excerpt":"We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance $d$ from every vertex, where $d+1$ is the number of different eigenvalues of $\\Gamma$. This can be seen as a another version of the so-called spectral excess theorem, which characterizes in a similar way those regular graphs that are distance-regular."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00373","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-17T23:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QHIeKdCfoH5glPZOqbvYEOHI+XAzyfXGnV62BsI08ZuS18Ny3Jk44OQryRB61wUvAUGmiC671+WpjMKBsN9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:16:45.365566Z"},"content_sha256":"09ef09625aa86f0a4b59364dc7393ec9205adb1473f4f39b2366741465ee5bd5","schema_version":"1.0","event_id":"sha256:09ef09625aa86f0a4b59364dc7393ec9205adb1473f4f39b2366741465ee5bd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/bundle.json","state_url":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36SODYM4BCFZY43CFDDCRNLE2S/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-23T02:16:45Z","links":{"resolver":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S","bundle":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/bundle.json","state":"https://pith.science/pith/36SODYM4BCFZY43CFDDCRNLE2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36SODYM4BCFZY43CFDDCRNLE2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:36SODYM4BCFZY43CFDDCRNLE2S","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":"7193d9d8ee2cae740a4e1cbee7e1685f39532c1d0271a96f4d111edc90241a9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T10:07:58Z","title_canon_sha256":"cd9935af0f26a704ed94d468c0a9be1a9b21cccaf73455f7462a5c1d491fd981"},"schema_version":"1.0","source":{"id":"1608.00373","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00373","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00373v2","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00373","created_at":"2026-05-17T23:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"36SODYM4BCFZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"36SODYM4BCFZY43C","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"36SODYM4","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:09ef09625aa86f0a4b59364dc7393ec9205adb1473f4f39b2366741465ee5bd5","target":"graph","created_at":"2026-05-17T23:52:34Z","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 regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the mean number of vertices at maximal distance $d$ from every vertex, where $d+1$ is the number of different eigenvalues of $\\Gamma$. This can be seen as a another version of the so-called spectral excess theorem, which characterizes in a similar way those regular graphs that are distance-regular.","authors_text":"C. Dalf\\'o, J. Koolen, M.A. Fiol","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T10:07:58Z","title":"The spectral excess theorem for graphs with few eigenvalues whose distance-$2$ or distance-$1$-or-$2$ graph is strongly regular"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00373","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:2f3cd3725e8d58dc027f0d6be553513dbb89c6249fd497c2d219a726c57029d3","target":"record","created_at":"2026-05-17T23:52:34Z","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":"7193d9d8ee2cae740a4e1cbee7e1685f39532c1d0271a96f4d111edc90241a9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T10:07:58Z","title_canon_sha256":"cd9935af0f26a704ed94d468c0a9be1a9b21cccaf73455f7462a5c1d491fd981"},"schema_version":"1.0","source":{"id":"1608.00373","kind":"arxiv","version":2}},"canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfa4e1e19c088b9c736228c628b564d490936b10c4b66ccf237afaa641588552","first_computed_at":"2026-05-17T23:52:34.487800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:34.487800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Ldss2SUCkQ7Unm1clIcnj76ycYKW1313wuVV/EprSKY4jC9t/hWze+aedalYIEnt801lyEkT6hNGru//+C9DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:34.488148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00373","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f3cd3725e8d58dc027f0d6be553513dbb89c6249fd497c2d219a726c57029d3","sha256:09ef09625aa86f0a4b59364dc7393ec9205adb1473f4f39b2366741465ee5bd5"],"state_sha256":"3a11435b1a15b023940b11f682503c9a13aae9841749eb2260b1f2ffdc112a04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+h6I9vaBJmd6iE7fpWDoqbFB917rrpDvDmKjDwB7nQQkH0pAMeycqm2WyFiIA+bPrMtN9b5qWUYTF/QqG4HRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:16:45.367523Z","bundle_sha256":"c08952109fed8166f3f68362598bf15349b3887af30315a392ae2b67ca7ba3a2"}}