{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:35FBGNO23TJDO4RPRCWBOLFBR7","short_pith_number":"pith:35FBGNO2","schema_version":"1.0","canonical_sha256":"df4a1335dadcd237722f88ac172ca18fe3679279e85b062734133967c1c08ab6","source":{"kind":"arxiv","id":"1405.1601","version":1},"attestation_state":"computed","paper":{"title":"The matching energy of graphs with given edge connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongping Ma, Shengjin Ji","submitted_at":"2014-05-07T13:34:42Z","abstract_excerpt":"Let G be a simple graph of order $n$ and $\\mu_1,\\mu_2,\\ldots,\\mu_n$ the roots of its matching polynomial. The matching energy of $G$ is defined as the sum $\\sum_{i=1}^n|\\mu_i|$. Let $K_{n-1,1}^k$ be the graph obtained from $K_1\\cup K_{n-1}$ by adding $k$ edges between $V(K_1)$ and $V(K_{n-1})$. In this paper, we show that $K_{n-1,1}^k$ has maximum matching energy among all connected graph with order $n$ and edge connectivity $k$."},"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":"1405.1601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-07T13:34:42Z","cross_cats_sorted":[],"title_canon_sha256":"b3c5e2a4c73cf4c7f1f8652e4145383cb97c7d20372bb1cdab5069be3dbd02ee","abstract_canon_sha256":"87ba9311517744cde0e579a69d5f4a6ec2466bd45e3abb1cf77ec2f75fbc0af0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:24.384419Z","signature_b64":"2kGZUQqu3ONrNY98hJaFasEe78NTiVDK03MiMmz/kSixTJaLLzsRTlrErhYsxVZFMm+NlLlwfvfYwvLeaCnwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df4a1335dadcd237722f88ac172ca18fe3679279e85b062734133967c1c08ab6","last_reissued_at":"2026-05-18T02:52:24.383611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:24.383611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The matching energy of graphs with given edge connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongping Ma, Shengjin Ji","submitted_at":"2014-05-07T13:34:42Z","abstract_excerpt":"Let G be a simple graph of order $n$ and $\\mu_1,\\mu_2,\\ldots,\\mu_n$ the roots of its matching polynomial. The matching energy of $G$ is defined as the sum $\\sum_{i=1}^n|\\mu_i|$. Let $K_{n-1,1}^k$ be the graph obtained from $K_1\\cup K_{n-1}$ by adding $k$ edges between $V(K_1)$ and $V(K_{n-1})$. In this paper, we show that $K_{n-1,1}^k$ has maximum matching energy among all connected graph with order $n$ and edge connectivity $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1601","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":"1405.1601","created_at":"2026-05-18T02:52:24.383747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1601v1","created_at":"2026-05-18T02:52:24.383747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1601","created_at":"2026-05-18T02:52:24.383747+00:00"},{"alias_kind":"pith_short_12","alias_value":"35FBGNO23TJD","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"35FBGNO23TJDO4RP","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"35FBGNO2","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/35FBGNO23TJDO4RPRCWBOLFBR7","json":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7.json","graph_json":"https://pith.science/api/pith-number/35FBGNO23TJDO4RPRCWBOLFBR7/graph.json","events_json":"https://pith.science/api/pith-number/35FBGNO23TJDO4RPRCWBOLFBR7/events.json","paper":"https://pith.science/paper/35FBGNO2"},"agent_actions":{"view_html":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7","download_json":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7.json","view_paper":"https://pith.science/paper/35FBGNO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1601&json=true","fetch_graph":"https://pith.science/api/pith-number/35FBGNO23TJDO4RPRCWBOLFBR7/graph.json","fetch_events":"https://pith.science/api/pith-number/35FBGNO23TJDO4RPRCWBOLFBR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7/action/storage_attestation","attest_author":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7/action/author_attestation","sign_citation":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7/action/citation_signature","submit_replication":"https://pith.science/pith/35FBGNO23TJDO4RPRCWBOLFBR7/action/replication_record"}},"created_at":"2026-05-18T02:52:24.383747+00:00","updated_at":"2026-05-18T02:52:24.383747+00:00"}