{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LLEMQ2DOHI4PEIUVQJ5CI4JOMG","short_pith_number":"pith:LLEMQ2DO","canonical_record":{"source":{"id":"1504.04225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T13:39:08Z","cross_cats_sorted":[],"title_canon_sha256":"cf66dd4bb0af1ce6db53a4389c3f59e5c28b80a52e77c75cafadbd2311f44613","abstract_canon_sha256":"5fa761480b6a900dd385d2ece42bbc0756e8c3ecef80ca2d93d12f08bd44cff0"},"schema_version":"1.0"},"canonical_sha256":"5ac8c8686e3a38f22295827a24712e61bee31ba6860857e115191fcf8ea85498","source":{"kind":"arxiv","id":"1504.04225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04225","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04225v1","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04225","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"LLEMQ2DOHI4P","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLEMQ2DOHI4PEIUV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLEMQ2DO","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LLEMQ2DOHI4PEIUVQJ5CI4JOMG","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T13:39:08Z","cross_cats_sorted":[],"title_canon_sha256":"cf66dd4bb0af1ce6db53a4389c3f59e5c28b80a52e77c75cafadbd2311f44613","abstract_canon_sha256":"5fa761480b6a900dd385d2ece42bbc0756e8c3ecef80ca2d93d12f08bd44cff0"},"schema_version":"1.0"},"canonical_sha256":"5ac8c8686e3a38f22295827a24712e61bee31ba6860857e115191fcf8ea85498","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:39.479750Z","signature_b64":"9UTmsOjBOwA6MGnEHoi3VEqtdE11TWokpnzA3hzLuO3i2vvneKO01zlCRrnNLpOEV8rGOZvH4eHJgdYgm02LDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ac8c8686e3a38f22295827a24712e61bee31ba6860857e115191fcf8ea85498","last_reissued_at":"2026-05-18T02:18:39.479184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:39.479184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04225","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-18T02:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Oe2erWYVre83ndViFfBC4nDo0SjIXb8QdzjQWrEDmmwiaRTvFwjiWOIqMOtENYhiKj+f4Ria4fury2anRsYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:20:37.850901Z"},"content_sha256":"e02ef915a09e8a0f4c53ad13bdf571c87f332740e96217ca23a8d5652bd836d0","schema_version":"1.0","event_id":"sha256:e02ef915a09e8a0f4c53ad13bdf571c87f332740e96217ca23a8d5652bd836d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LLEMQ2DOHI4PEIUVQJ5CI4JOMG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the second largest distance eigenvalue of a graph","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Xue, Litao Guo, Ruifang Liu","submitted_at":"2015-04-16T13:39:08Z","abstract_excerpt":"Let $G$ be a simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $\\lambda_{1}(D(G))\\geq\\lambda_{2}(D(G))\\geq\\cdots\\geq\\lambda_{n}(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D(G)$, any graph with the same spectrum as $G$ is isomorphic to $G$. In this paper, we consider spectral characterization on the second largest distance eigenvalue $\\lambda_{2}(D(G))$ of graphs, and prove that the graphs with $\\lambda_{2}(D(G))\\leq\\frac{17-\\sqrt{329}}{2}\\approx-0.5692$ are de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04225","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-18T02:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BW+5xIVSMW0EHmL4MRkSFr5cWOAwrB25bQHiixTp+sjKc8S9AYrJQVEWUtXadjZ6I6a4HDIVvvj3gr3ryeVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:20:37.851234Z"},"content_sha256":"7759e4522767ff95b9936750e648939aa450645262a1e1d1be680a78b5c3528c","schema_version":"1.0","event_id":"sha256:7759e4522767ff95b9936750e648939aa450645262a1e1d1be680a78b5c3528c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG/bundle.json","state_url":"https://pith.science/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG/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-20T11:20:37Z","links":{"resolver":"https://pith.science/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG","bundle":"https://pith.science/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG/bundle.json","state":"https://pith.science/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLEMQ2DOHI4PEIUVQJ5CI4JOMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LLEMQ2DOHI4PEIUVQJ5CI4JOMG","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":"5fa761480b6a900dd385d2ece42bbc0756e8c3ecef80ca2d93d12f08bd44cff0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T13:39:08Z","title_canon_sha256":"cf66dd4bb0af1ce6db53a4389c3f59e5c28b80a52e77c75cafadbd2311f44613"},"schema_version":"1.0","source":{"id":"1504.04225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04225","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04225v1","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04225","created_at":"2026-05-18T02:18:39Z"},{"alias_kind":"pith_short_12","alias_value":"LLEMQ2DOHI4P","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLEMQ2DOHI4PEIUV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLEMQ2DO","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:7759e4522767ff95b9936750e648939aa450645262a1e1d1be680a78b5c3528c","target":"graph","created_at":"2026-05-18T02:18:39Z","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 simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $\\lambda_{1}(D(G))\\geq\\lambda_{2}(D(G))\\geq\\cdots\\geq\\lambda_{n}(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D(G)$, any graph with the same spectrum as $G$ is isomorphic to $G$. In this paper, we consider spectral characterization on the second largest distance eigenvalue $\\lambda_{2}(D(G))$ of graphs, and prove that the graphs with $\\lambda_{2}(D(G))\\leq\\frac{17-\\sqrt{329}}{2}\\approx-0.5692$ are de","authors_text":"Jie Xue, Litao Guo, Ruifang Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T13:39:08Z","title":"On the second largest distance eigenvalue of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04225","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:e02ef915a09e8a0f4c53ad13bdf571c87f332740e96217ca23a8d5652bd836d0","target":"record","created_at":"2026-05-18T02:18:39Z","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":"5fa761480b6a900dd385d2ece42bbc0756e8c3ecef80ca2d93d12f08bd44cff0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2015-04-16T13:39:08Z","title_canon_sha256":"cf66dd4bb0af1ce6db53a4389c3f59e5c28b80a52e77c75cafadbd2311f44613"},"schema_version":"1.0","source":{"id":"1504.04225","kind":"arxiv","version":1}},"canonical_sha256":"5ac8c8686e3a38f22295827a24712e61bee31ba6860857e115191fcf8ea85498","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ac8c8686e3a38f22295827a24712e61bee31ba6860857e115191fcf8ea85498","first_computed_at":"2026-05-18T02:18:39.479184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:39.479184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9UTmsOjBOwA6MGnEHoi3VEqtdE11TWokpnzA3hzLuO3i2vvneKO01zlCRrnNLpOEV8rGOZvH4eHJgdYgm02LDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:39.479750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e02ef915a09e8a0f4c53ad13bdf571c87f332740e96217ca23a8d5652bd836d0","sha256:7759e4522767ff95b9936750e648939aa450645262a1e1d1be680a78b5c3528c"],"state_sha256":"f7abac40df460874810595ace0ae5fead709b12d426824cda9a36d682ae2d297"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eD/f5oXS59bbWlxJJLr+JbdTmUIGGCh8uA3Al1H4qO6EDuZJLFPe+RXwP94h6nJFhq6psMKGVifY2UnC528BCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T11:20:37.853135Z","bundle_sha256":"4b3c9381944c539d80cb71fb5ce92269f819a1edad7c376748238a6e32b58cc3"}}