{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2URS5JZZSP4QYAXME45RXHDXFJ","short_pith_number":"pith:2URS5JZZ","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"},"canonical_sha256":"d5232ea73993f90c02ec273b1b9c772a532d6777bc5389cf27075ea4e0bc1c71","source":{"kind":"arxiv","id":"1411.6832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6832","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6832v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6832","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"2URS5JZZSP4Q","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2URS5JZZSP4QYAXM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2URS5JZZ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2URS5JZZSP4QYAXME45RXHDXFJ","target":"record","payload":{"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"},"canonical_sha256":"d5232ea73993f90c02ec273b1b9c772a532d6777bc5389cf27075ea4e0bc1c71","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"},"source_kind":"arxiv","source_id":"1411.6832","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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKNwT9nYQVw/6l7Ped8bqhKeZXht+siseAAq0aidLCBT/FO7daTxArAz1ptCQAufvMTCA4GyCAMKUtuzcp/sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:54:22.269226Z"},"content_sha256":"bb9a30ff482e5ba5201dae2aaf12ed1afb0fdd6b1fe2f54a18f8eac71a927eab","schema_version":"1.0","event_id":"sha256:bb9a30ff482e5ba5201dae2aaf12ed1afb0fdd6b1fe2f54a18f8eac71a927eab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2URS5JZZSP4QYAXME45RXHDXFJ","target":"graph","payload":{"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"},"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:32:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4o5yKqYGsC7loFyoX/U/29YMp4mcBcD2QMAtv8ozKepZlKWpnp7HX5kq2uew9bXte1784XTeT4yZ19zx3nrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:54:22.269680Z"},"content_sha256":"ff3ef64233753e8ff31dd885d8688dd55751de3b7d774e56b433ef5ade8faeae","schema_version":"1.0","event_id":"sha256:ff3ef64233753e8ff31dd885d8688dd55751de3b7d774e56b433ef5ade8faeae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/bundle.json","state_url":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2URS5JZZSP4QYAXME45RXHDXFJ/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-05-25T19:54:22Z","links":{"resolver":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ","bundle":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/bundle.json","state":"https://pith.science/pith/2URS5JZZSP4QYAXME45RXHDXFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2URS5JZZSP4QYAXME45RXHDXFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2URS5JZZSP4QYAXME45RXHDXFJ","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":"cafa8acd262963ad5fafcf3dd586a39dd7ccaa169f973b3b342ff501d081d7dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T12:20:55Z","title_canon_sha256":"91523115a02d79c979f3c68a37437fe7c70d3f8fdc85eec6f11d3da56444d8da"},"schema_version":"1.0","source":{"id":"1411.6832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6832","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6832v1","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6832","created_at":"2026-05-18T02:32:47Z"},{"alias_kind":"pith_short_12","alias_value":"2URS5JZZSP4Q","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2URS5JZZSP4QYAXM","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2URS5JZZ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:ff3ef64233753e8ff31dd885d8688dd55751de3b7d774e56b433ef5ade8faeae","target":"graph","created_at":"2026-05-18T02:32:47Z","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 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 ","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T12:20:55Z","title":"On graphs with maximum Harary spectral radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6832","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:bb9a30ff482e5ba5201dae2aaf12ed1afb0fdd6b1fe2f54a18f8eac71a927eab","target":"record","created_at":"2026-05-18T02:32:47Z","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":"cafa8acd262963ad5fafcf3dd586a39dd7ccaa169f973b3b342ff501d081d7dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2014-11-25T12:20:55Z","title_canon_sha256":"91523115a02d79c979f3c68a37437fe7c70d3f8fdc85eec6f11d3da56444d8da"},"schema_version":"1.0","source":{"id":"1411.6832","kind":"arxiv","version":1}},"canonical_sha256":"d5232ea73993f90c02ec273b1b9c772a532d6777bc5389cf27075ea4e0bc1c71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5232ea73993f90c02ec273b1b9c772a532d6777bc5389cf27075ea4e0bc1c71","first_computed_at":"2026-05-18T02:32:47.212899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:47.212899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3LK/URK2favLg0gGNHBBp1BtZonsz/oISgEjYebF7ZjoX0y2T9irGZFR9WhqPIcnvx7KeX5wI8xgcOc6WSNyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:47.213376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb9a30ff482e5ba5201dae2aaf12ed1afb0fdd6b1fe2f54a18f8eac71a927eab","sha256:ff3ef64233753e8ff31dd885d8688dd55751de3b7d774e56b433ef5ade8faeae"],"state_sha256":"56c19480fc88fb999c41a0c5432694df2cecf88a1fc4c3d21d737128d96c51e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJhsTrmo0ObOIBmyev46UmTt0KHguS0oIzHA4swFl0AXvYDHTRgqJTnThzb0NVWJEk602AygOzfJu+3wFGgUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:54:22.272554Z","bundle_sha256":"32bfe7bdda05bce4a1aecd9902c3546c6a12d4abf4714de00fa7dc3953c7ee01"}}