{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2URS5JZZSP4QYAXME45RXHDXFJ","short_pith_number":"pith:2URS5JZZ","schema_version":"1.0","canonical_sha256":"d5232ea73993f90c02ec273b1b9c772a532d6777bc5389cf27075ea4e0bc1c71","source":{"kind":"arxiv","id":"1411.6832","version":1},"attestation_state":"computed","paper":{"title":"On graphs with maximum Harary spectral radius","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","submitted_at":"2014-11-25T12:20:55Z","abstract_excerpt":"Let $G$ be a simple graph with vertex set $V(G) = \\{v_1 ,v_2 ,\\cdots ,v_n\\}$. The Harary matrix $RD(G)$ of $G$, which is initially called the reciprocal distance matrix, is an $n \\times n$ matrix whose $(i,j)$-entry is equal to $\\frac{1}{d_{ij}}$ if $i\\not=j$ and $0$ otherwise, where $d_{ij}$ is the distance of $v_i$ and $v_j$ in $G$. In this paper, we characterize graphs with maximum spectral radius of Harary matrix in three classes of simple connected graphs with $n$ vertices: graphs with fixed matching number, bipartite graphs with fixed matching number, and graphs with given number of cut "},"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":"1411.6832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T12:20:55Z","cross_cats_sorted":[],"title_canon_sha256":"91523115a02d79c979f3c68a37437fe7c70d3f8fdc85eec6f11d3da56444d8da","abstract_canon_sha256":"cafa8acd262963ad5fafcf3dd586a39dd7ccaa169f973b3b342ff501d081d7dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:47.213376Z","signature_b64":"3LK/URK2favLg0gGNHBBp1BtZonsz/oISgEjYebF7ZjoX0y2T9irGZFR9WhqPIcnvx7KeX5wI8xgcOc6WSNyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5232ea73993f90c02ec273b1b9c772a532d6777bc5389cf27075ea4e0bc1c71","last_reissued_at":"2026-05-18T02:32:47.212899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:47.212899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with maximum Harary spectral radius","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","submitted_at":"2014-11-25T12:20:55Z","abstract_excerpt":"Let $G$ be a simple graph with vertex set $V(G) = \\{v_1 ,v_2 ,\\cdots ,v_n\\}$. The Harary matrix $RD(G)$ of $G$, which is initially called the reciprocal distance matrix, is an $n \\times n$ matrix whose $(i,j)$-entry is equal to $\\frac{1}{d_{ij}}$ if $i\\not=j$ and $0$ otherwise, where $d_{ij}$ is the distance of $v_i$ and $v_j$ in $G$. In this paper, we characterize graphs with maximum spectral radius of Harary matrix in three classes of simple connected graphs with $n$ vertices: graphs with fixed matching number, bipartite graphs with fixed matching number, and graphs with given number of cut "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6832","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":"1411.6832","created_at":"2026-05-18T02:32:47.212969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6832v1","created_at":"2026-05-18T02:32:47.212969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6832","created_at":"2026-05-18T02:32:47.212969+00:00"},{"alias_kind":"pith_short_12","alias_value":"2URS5JZZSP4Q","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2URS5JZZSP4QYAXM","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2URS5JZZ","created_at":"2026-05-18T12:28:11.866339+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/2URS5JZZSP4QYAXME45RXHDXFJ","json":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ.json","graph_json":"https://pith.science/api/pith-number/2URS5JZZSP4QYAXME45RXHDXFJ/graph.json","events_json":"https://pith.science/api/pith-number/2URS5JZZSP4QYAXME45RXHDXFJ/events.json","paper":"https://pith.science/paper/2URS5JZZ"},"agent_actions":{"view_html":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ","download_json":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ.json","view_paper":"https://pith.science/paper/2URS5JZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6832&json=true","fetch_graph":"https://pith.science/api/pith-number/2URS5JZZSP4QYAXME45RXHDXFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2URS5JZZSP4QYAXME45RXHDXFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/action/storage_attestation","attest_author":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/action/author_attestation","sign_citation":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/action/citation_signature","submit_replication":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/action/replication_record"}},"created_at":"2026-05-18T02:32:47.212969+00:00","updated_at":"2026-05-18T02:32:47.212969+00:00"}