{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3V6RLTCY2WMJ73D5QYCYJJ6OPA","short_pith_number":"pith:3V6RLTCY","schema_version":"1.0","canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","source":{"kind":"arxiv","id":"1507.07083","version":1},"attestation_state":"computed","paper":{"title":"Remoteness and distance eigenvalues of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Huiqiu Lin, Kinkar Ch. Das","submitted_at":"2015-07-25T09:17:29Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $\\rho$ of $G$ is the maximum average distance from a vertex to all others and $\\partial_1\\geq\\cdots\\geq \\partial_n$ are the distance eigenvalues of $G$. In \\cite{AH}, Aouchiche and Hansen conjectured that $\\rho+\\partial_3>0$ when $d\\geq 3$ and $\\rho+\\partial_{\\lfloor\\frac{7d}{8}\\rfloor}>0.$ In this paper, we confirm these two conjectures. Furthermore, we give lower bounds on $\\partial_n+\\rho$ and $\\partial_1-\\rho$ when $G\\ncong K_n$ and the extremal graphs are characterized."},"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":"1507.07083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-25T09:17:29Z","cross_cats_sorted":[],"title_canon_sha256":"1ba8ced1691f602f3139141e0116c39de3ade7a3cd2136d667067ec702bfa462","abstract_canon_sha256":"a8c003e1f76c02df135b5955a587f3389dbfd2e54f8c4a5044da9ba7c4061a68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:17.259910Z","signature_b64":"60e9gdmdlFUecFHRDbeDuvnEauKGHxxBM44Oxm3WpPYy22taZGGYBGAmzIS6bQpCqfz+92aVj3Pa5P4AjKU2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd7d15cc58d5989fec7d860584a7ce782ea4211df36305deae69733d9765cd5c","last_reissued_at":"2026-05-18T01:36:17.259305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:17.259305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Remoteness and distance eigenvalues of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Huiqiu Lin, Kinkar Ch. Das","submitted_at":"2015-07-25T09:17:29Z","abstract_excerpt":"Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $\\rho$ of $G$ is the maximum average distance from a vertex to all others and $\\partial_1\\geq\\cdots\\geq \\partial_n$ are the distance eigenvalues of $G$. In \\cite{AH}, Aouchiche and Hansen conjectured that $\\rho+\\partial_3>0$ when $d\\geq 3$ and $\\rho+\\partial_{\\lfloor\\frac{7d}{8}\\rfloor}>0.$ In this paper, we confirm these two conjectures. Furthermore, we give lower bounds on $\\partial_n+\\rho$ and $\\partial_1-\\rho$ when $G\\ncong K_n$ and the extremal graphs are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07083","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.07083","created_at":"2026-05-18T01:36:17.259417+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07083v1","created_at":"2026-05-18T01:36:17.259417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07083","created_at":"2026-05-18T01:36:17.259417+00:00"},{"alias_kind":"pith_short_12","alias_value":"3V6RLTCY2WMJ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3V6RLTCY2WMJ73D5","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3V6RLTCY","created_at":"2026-05-18T12:29:02.477457+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/3V6RLTCY2WMJ73D5QYCYJJ6OPA","json":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA.json","graph_json":"https://pith.science/api/pith-number/3V6RLTCY2WMJ73D5QYCYJJ6OPA/graph.json","events_json":"https://pith.science/api/pith-number/3V6RLTCY2WMJ73D5QYCYJJ6OPA/events.json","paper":"https://pith.science/paper/3V6RLTCY"},"agent_actions":{"view_html":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA","download_json":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA.json","view_paper":"https://pith.science/paper/3V6RLTCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07083&json=true","fetch_graph":"https://pith.science/api/pith-number/3V6RLTCY2WMJ73D5QYCYJJ6OPA/graph.json","fetch_events":"https://pith.science/api/pith-number/3V6RLTCY2WMJ73D5QYCYJJ6OPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/action/storage_attestation","attest_author":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/action/author_attestation","sign_citation":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/action/citation_signature","submit_replication":"https://pith.science/pith/3V6RLTCY2WMJ73D5QYCYJJ6OPA/action/replication_record"}},"created_at":"2026-05-18T01:36:17.259417+00:00","updated_at":"2026-05-18T01:36:17.259417+00:00"}