{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2537TCQ7Z3RHTMWJHD25ESR5IE","short_pith_number":"pith:2537TCQ7","canonical_record":{"source":{"id":"1207.2393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-10T15:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"b7d3844c2c0b3f51ecc1b3bcea7a3d979e1a9aea58769007dd7b230e355f776b","abstract_canon_sha256":"fb18fdc18a224ce92e08a547f3fd5bf7c589d0ed26e3918428a292090e354c26"},"schema_version":"1.0"},"canonical_sha256":"d777f98a1fcee279b2c938f5d24a3d4105b1f8da6ed29199d6c1c6cea6c455bb","source":{"kind":"arxiv","id":"1207.2393","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2393","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2393v2","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2393","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"2537TCQ7Z3RH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2537TCQ7Z3RHTMWJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2537TCQ7","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2537TCQ7Z3RHTMWJHD25ESR5IE","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-10T15:52:42Z","cross_cats_sorted":[],"title_canon_sha256":"b7d3844c2c0b3f51ecc1b3bcea7a3d979e1a9aea58769007dd7b230e355f776b","abstract_canon_sha256":"fb18fdc18a224ce92e08a547f3fd5bf7c589d0ed26e3918428a292090e354c26"},"schema_version":"1.0"},"canonical_sha256":"d777f98a1fcee279b2c938f5d24a3d4105b1f8da6ed29199d6c1c6cea6c455bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:37.576813Z","signature_b64":"8p2FCTQEM/z7bYPApalD73GeJRo8JWS+uzdXBDl4ZdGcuBZ0bhvLsy0RqxC6Z1Bp8m5dJSFbEsPb5XH6gKdHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d777f98a1fcee279b2c938f5d24a3d4105b1f8da6ed29199d6c1c6cea6c455bb","last_reissued_at":"2026-05-18T02:42:37.576286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:37.576286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2393","source_version":2,"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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnmzVUfFMId06lCSIvko8Z7ieu6sPY4L8WDpbEh5FMJPxZZIfi2dUoVCm671AWkzbTL0WDDX+uOWmzKmFnK0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:40:54.202919Z"},"content_sha256":"a926b83de4342ce1aee0d1d3ec1da7b3fdcbaa6076ef86ce3a5d1d3e6f3420c0","schema_version":"1.0","event_id":"sha256:a926b83de4342ce1aee0d1d3ec1da7b3fdcbaa6076ef86ce3a5d1d3e6f3420c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2537TCQ7Z3RHTMWJHD25ESR5IE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Connectivity and the Harary Index of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Xin Li, Yi-Zheng Fan","submitted_at":"2012-07-10T15:52:42Z","abstract_excerpt":"The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with maximum Harary index among all graphs with given number of cut vertices or vertex connectivity or edge connectivity. In addition we also characterize the extremal graphs with the second maximum Harary index among the graphs with given vertex connectivity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2393","kind":"arxiv","version":2},"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:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDCDMyFlu1G4CLOxbqm+nO9REcXgDSTsZjPP8RHzga3akaLvZGKWm9GoxiCIrG/kFT1ZCHAUntwlt3whPCJSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:40:54.203504Z"},"content_sha256":"b5ca436cd90f930ff99872f56b5609472bfa9e1706844e4008cdf9709120fc75","schema_version":"1.0","event_id":"sha256:b5ca436cd90f930ff99872f56b5609472bfa9e1706844e4008cdf9709120fc75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2537TCQ7Z3RHTMWJHD25ESR5IE/bundle.json","state_url":"https://pith.science/pith/2537TCQ7Z3RHTMWJHD25ESR5IE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2537TCQ7Z3RHTMWJHD25ESR5IE/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-30T17:40:54Z","links":{"resolver":"https://pith.science/pith/2537TCQ7Z3RHTMWJHD25ESR5IE","bundle":"https://pith.science/pith/2537TCQ7Z3RHTMWJHD25ESR5IE/bundle.json","state":"https://pith.science/pith/2537TCQ7Z3RHTMWJHD25ESR5IE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2537TCQ7Z3RHTMWJHD25ESR5IE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2537TCQ7Z3RHTMWJHD25ESR5IE","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":"fb18fdc18a224ce92e08a547f3fd5bf7c589d0ed26e3918428a292090e354c26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-10T15:52:42Z","title_canon_sha256":"b7d3844c2c0b3f51ecc1b3bcea7a3d979e1a9aea58769007dd7b230e355f776b"},"schema_version":"1.0","source":{"id":"1207.2393","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2393","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2393v2","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2393","created_at":"2026-05-18T02:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"2537TCQ7Z3RH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2537TCQ7Z3RHTMWJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2537TCQ7","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:b5ca436cd90f930ff99872f56b5609472bfa9e1706844e4008cdf9709120fc75","target":"graph","created_at":"2026-05-18T02:42:37Z","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":"The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with maximum Harary index among all graphs with given number of cut vertices or vertex connectivity or edge connectivity. In addition we also characterize the extremal graphs with the second maximum Harary index among the graphs with given vertex connectivity.","authors_text":"Xiao-Xin Li, Yi-Zheng Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-10T15:52:42Z","title":"The Connectivity and the Harary Index of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2393","kind":"arxiv","version":2},"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:a926b83de4342ce1aee0d1d3ec1da7b3fdcbaa6076ef86ce3a5d1d3e6f3420c0","target":"record","created_at":"2026-05-18T02:42:37Z","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":"fb18fdc18a224ce92e08a547f3fd5bf7c589d0ed26e3918428a292090e354c26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-07-10T15:52:42Z","title_canon_sha256":"b7d3844c2c0b3f51ecc1b3bcea7a3d979e1a9aea58769007dd7b230e355f776b"},"schema_version":"1.0","source":{"id":"1207.2393","kind":"arxiv","version":2}},"canonical_sha256":"d777f98a1fcee279b2c938f5d24a3d4105b1f8da6ed29199d6c1c6cea6c455bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d777f98a1fcee279b2c938f5d24a3d4105b1f8da6ed29199d6c1c6cea6c455bb","first_computed_at":"2026-05-18T02:42:37.576286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:37.576286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8p2FCTQEM/z7bYPApalD73GeJRo8JWS+uzdXBDl4ZdGcuBZ0bhvLsy0RqxC6Z1Bp8m5dJSFbEsPb5XH6gKdHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:37.576813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2393","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a926b83de4342ce1aee0d1d3ec1da7b3fdcbaa6076ef86ce3a5d1d3e6f3420c0","sha256:b5ca436cd90f930ff99872f56b5609472bfa9e1706844e4008cdf9709120fc75"],"state_sha256":"9cc59d8d25df8bfdf11f2c0c4dc143abb51fa8d92dd11ba469dfa28783c948ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obW30YM0f1nKB4HNmY44xih7awDRieIe4p0S2rOxrCnzrGEWclDu5NxxxkalZGhIoArKgp+t7szO1GbgqO7eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:40:54.206610Z","bundle_sha256":"126d75b75641f6441330624bd6de68d83ee9d2c2e8565080daf047479771fd77"}}