{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SLDLN52G54HEYBCKSOBI3EUFYX","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":"d69a6d2cabc44a107d561111f6208a19890975c7bed1e6ee94d8fcf9cb8d4403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-26T14:42:14Z","title_canon_sha256":"80ce920e7dfa6f1e09de0adc1066b4bf0a905e2761ac8b8c07b855ce4a75f138"},"schema_version":"1.0","source":{"id":"1708.07979","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07979","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07979v1","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07979","created_at":"2026-05-18T00:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"SLDLN52G54HE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SLDLN52G54HEYBCK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SLDLN52G","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7ebfe0aa9cb98ce8dcea19f14de231616ff06849d14d688fcb4d93450d3cacee","target":"graph","created_at":"2026-05-18T00:36:37Z","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":"Let $G$ be a connected graph on $n$ vertices, and let $D(G)$ be the distance matrix of $G$. Let $\\partial_1(G)\\ge\\partial_2(G)\\ge\\cdots\\ge\\partial_n(G)$ denote the eigenvalues of $D(G)$. In this paper, we characterize all connected graphs with $\\partial_{3}(G)\\leq -1$ and $\\partial_{n-1}(G)\\geq -2$. By the way, we determine all connected graphs with at most three distance eigenvalues different from $-1$ and $-2$.","authors_text":"Lu Lu, Qiongxiang Huang, Xueyi Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-26T14:42:14Z","title":"Graphs with at most three distance eigenvalues different from $-1$ and $-2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07979","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:9527a9ef15986f3f02a5ba4fd1ac859e188eaf63bcde7f86808d3ca0c5bc4a95","target":"record","created_at":"2026-05-18T00:36:37Z","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":"d69a6d2cabc44a107d561111f6208a19890975c7bed1e6ee94d8fcf9cb8d4403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-26T14:42:14Z","title_canon_sha256":"80ce920e7dfa6f1e09de0adc1066b4bf0a905e2761ac8b8c07b855ce4a75f138"},"schema_version":"1.0","source":{"id":"1708.07979","kind":"arxiv","version":1}},"canonical_sha256":"92c6b6f746ef0e4c044a93828d9285c5ff60e20313a78461b62eac0dca88fd22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92c6b6f746ef0e4c044a93828d9285c5ff60e20313a78461b62eac0dca88fd22","first_computed_at":"2026-05-18T00:36:37.413138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:37.413138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SpILLdbuQ0TQGqxSmmpTzHRkm9xMj7Mp62z1GlRsUOzY62GbSLPr8kUfLedNefbWKYI0hYndxz32QDe78D9HCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:37.413972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07979","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9527a9ef15986f3f02a5ba4fd1ac859e188eaf63bcde7f86808d3ca0c5bc4a95","sha256:7ebfe0aa9cb98ce8dcea19f14de231616ff06849d14d688fcb4d93450d3cacee"],"state_sha256":"e985bcc66336aea570ea2149d0d325d109c00ed7a873613d2aaa21b1b168d8a3"}