{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FJMLTVA4XBM4JXOUTPDBLLLM5D","short_pith_number":"pith:FJMLTVA4","schema_version":"1.0","canonical_sha256":"2a58b9d41cb859c4ddd49bc615ad6ce8c86a9baaf65283e0cec6646418eab899","source":{"kind":"arxiv","id":"1505.07651","version":3},"attestation_state":"computed","paper":{"title":"Graphs with small diameter determined by their $D$-spectra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Xue, Ruifang Liu","submitted_at":"2015-05-28T11:30:46Z","abstract_excerpt":"Let $G$ be a connected graph with vertex set $V(G)=\\{v_{1},v_{2},...,v_{n}\\}$. The distance matrix $D(G)=(d_{ij})_{n\\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$ and $v_{j}$. Suppose that $\\lambda_{1}(D)\\geq\\lambda_{2}(D)\\geq\\cdots\\geq\\lambda_{n}(D)$ are the distance spectrum of $G$. The graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D(G)$, any graph having the same spectrum as $G$ is isomorphic to $G$. In this paper, we give the distance characteristic polynomial of some"},"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":"1505.07651","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2015-05-28T11:30:46Z","cross_cats_sorted":[],"title_canon_sha256":"7d1b7aebdad2d106df763b0e2a05659699a1d83342ca4e3eb67ca8332f267cdf","abstract_canon_sha256":"8af7d457037138adf76621517b608446879adf87cd10ad64892d01e4b18656a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.439189Z","signature_b64":"h6ldLBvyXffQStR2+gUYpXz9wcCYmzgDBTTbVUGDBEDS+J3/glEtzBvxYFtUeivzwy1dFMvp0lqMsJZQuaUTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a58b9d41cb859c4ddd49bc615ad6ce8c86a9baaf65283e0cec6646418eab899","last_reissued_at":"2026-05-18T00:25:02.438682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.438682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with small diameter determined by their $D$-spectra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Xue, Ruifang Liu","submitted_at":"2015-05-28T11:30:46Z","abstract_excerpt":"Let $G$ be a connected graph with vertex set $V(G)=\\{v_{1},v_{2},...,v_{n}\\}$. The distance matrix $D(G)=(d_{ij})_{n\\times n}$ is the matrix indexed by the vertices of $G,$ where $d_{ij}$ denotes the distance between the vertices $v_{i}$ and $v_{j}$. Suppose that $\\lambda_{1}(D)\\geq\\lambda_{2}(D)\\geq\\cdots\\geq\\lambda_{n}(D)$ are the distance spectrum of $G$. The graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D(G)$, any graph having the same spectrum as $G$ is isomorphic to $G$. In this paper, we give the distance characteristic polynomial of some"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07651","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":"1505.07651","created_at":"2026-05-18T00:25:02.438759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07651v3","created_at":"2026-05-18T00:25:02.438759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07651","created_at":"2026-05-18T00:25:02.438759+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJMLTVA4XBM4","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJMLTVA4XBM4JXOU","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJMLTVA4","created_at":"2026-05-18T12:29:19.899920+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/FJMLTVA4XBM4JXOUTPDBLLLM5D","json":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D.json","graph_json":"https://pith.science/api/pith-number/FJMLTVA4XBM4JXOUTPDBLLLM5D/graph.json","events_json":"https://pith.science/api/pith-number/FJMLTVA4XBM4JXOUTPDBLLLM5D/events.json","paper":"https://pith.science/paper/FJMLTVA4"},"agent_actions":{"view_html":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D","download_json":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D.json","view_paper":"https://pith.science/paper/FJMLTVA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07651&json=true","fetch_graph":"https://pith.science/api/pith-number/FJMLTVA4XBM4JXOUTPDBLLLM5D/graph.json","fetch_events":"https://pith.science/api/pith-number/FJMLTVA4XBM4JXOUTPDBLLLM5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D/action/storage_attestation","attest_author":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D/action/author_attestation","sign_citation":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D/action/citation_signature","submit_replication":"https://pith.science/pith/FJMLTVA4XBM4JXOUTPDBLLLM5D/action/replication_record"}},"created_at":"2026-05-18T00:25:02.438759+00:00","updated_at":"2026-05-18T00:25:02.438759+00:00"}