{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:37AINLFPGJX3CTPQ2VAN3N5U4E","short_pith_number":"pith:37AINLFP","schema_version":"1.0","canonical_sha256":"dfc086acaf326fb14df0d540ddb7b4e103cd49fd689326067761bc4e4d84d19b","source":{"kind":"arxiv","id":"1011.4658","version":2},"attestation_state":"computed","paper":{"title":"Complete solution to a conjecture on the maximal energy of unicyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bofeng Huo, Xueliang Li, Yongtang Shi","submitted_at":"2010-11-21T12:25:51Z","abstract_excerpt":"For a given simple graph $G$, the energy of $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $P_n^{\\ell}$ be the unicyclic graph obtained by connecting a vertex of $C_\\ell$ with a leaf of $P_{n-\\ell}$\\,. In [G. Caporossi, D. Cvetkovi\\'c, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with extremal energy, {\\it J. Chem. Inf. Comput. Sci.} {\\bf 39}(1999) 984--996], Caporossi et al. conjectured that the unicyclic graph with maximal energy is $C_n$ if $n\\leq 7$ and $n=9,10,11,13,15$\\,, an"},"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":"1011.4658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-21T12:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"c153365deeaccac66f923657d298bc58560756bfa1d623d9403888090ab9805d","abstract_canon_sha256":"b25cd37ecaca7a5b182fda6acb9169a070f1dca26ea9205f40d81332c37175c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:29.241740Z","signature_b64":"hx6qMR2WzvEFlTdO85XYBvFobNsNrtuefQUVFJh/KE/n7GXMXP8Q0UkFG7r7glicy4JhEojoD3ESTGCofb6IBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfc086acaf326fb14df0d540ddb7b4e103cd49fd689326067761bc4e4d84d19b","last_reissued_at":"2026-05-18T04:28:29.241330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:29.241330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete solution to a conjecture on the maximal energy of unicyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bofeng Huo, Xueliang Li, Yongtang Shi","submitted_at":"2010-11-21T12:25:51Z","abstract_excerpt":"For a given simple graph $G$, the energy of $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $P_n^{\\ell}$ be the unicyclic graph obtained by connecting a vertex of $C_\\ell$ with a leaf of $P_{n-\\ell}$\\,. In [G. Caporossi, D. Cvetkovi\\'c, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with extremal energy, {\\it J. Chem. Inf. Comput. Sci.} {\\bf 39}(1999) 984--996], Caporossi et al. conjectured that the unicyclic graph with maximal energy is $C_n$ if $n\\leq 7$ and $n=9,10,11,13,15$\\,, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.4658","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.4658","created_at":"2026-05-18T04:28:29.241397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.4658v2","created_at":"2026-05-18T04:28:29.241397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.4658","created_at":"2026-05-18T04:28:29.241397+00:00"},{"alias_kind":"pith_short_12","alias_value":"37AINLFPGJX3","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"37AINLFPGJX3CTPQ","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"37AINLFP","created_at":"2026-05-18T12:26:03.138858+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/37AINLFPGJX3CTPQ2VAN3N5U4E","json":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E.json","graph_json":"https://pith.science/api/pith-number/37AINLFPGJX3CTPQ2VAN3N5U4E/graph.json","events_json":"https://pith.science/api/pith-number/37AINLFPGJX3CTPQ2VAN3N5U4E/events.json","paper":"https://pith.science/paper/37AINLFP"},"agent_actions":{"view_html":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E","download_json":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E.json","view_paper":"https://pith.science/paper/37AINLFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.4658&json=true","fetch_graph":"https://pith.science/api/pith-number/37AINLFPGJX3CTPQ2VAN3N5U4E/graph.json","fetch_events":"https://pith.science/api/pith-number/37AINLFPGJX3CTPQ2VAN3N5U4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E/action/storage_attestation","attest_author":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E/action/author_attestation","sign_citation":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E/action/citation_signature","submit_replication":"https://pith.science/pith/37AINLFPGJX3CTPQ2VAN3N5U4E/action/replication_record"}},"created_at":"2026-05-18T04:28:29.241397+00:00","updated_at":"2026-05-18T04:28:29.241397+00:00"}