{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HOQX7GM6LELKXYQE4BG335GCH5","short_pith_number":"pith:HOQX7GM6","schema_version":"1.0","canonical_sha256":"3ba17f999e5916abe204e04dbdf4c23f69d68b9d8e93d6b01a3bc80ef5364359","source":{"kind":"arxiv","id":"1409.2038","version":1},"attestation_state":"computed","paper":{"title":"The Maximal Matching Energy of Tricyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin Chen, Yongtang Shi","submitted_at":"2014-09-06T17:45:04Z","abstract_excerpt":"Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and $\\mu_1,\\mu_2,\\ldots,\\mu_n$ be the roots of its matching polynomial. The matching energy of $G$ is defined to be the sum of the absolute values of $\\mu_{i}\\ (i=1,2,\\ldots,n)$. Gutman and Cvetkoi\\'c determined the tricyclic graphs on $n$ vertices with maximal number of matchings by a computer search for small values of $n$ and by an induction argument for the rest. Based on this result, in this paper, we character"},"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":"1409.2038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-06T17:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"edc6d204e343fc8219cf98c7e7c6d18940e1f282ce270da08d46d8782ae5d0b7","abstract_canon_sha256":"cf23703baf27eced62c29523ee5b757741ecf5c58867a4e2a18e07a2b49a9fd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:18.069018Z","signature_b64":"Y86K05VZ8WD0kY7tnQEyOszZ6Ug3uZUMEObCQ3QgbChczmUTKPZ0TxgwvUoWVAAIW9w6Z0Rw/cHYacpYLkgpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba17f999e5916abe204e04dbdf4c23f69d68b9d8e93d6b01a3bc80ef5364359","last_reissued_at":"2026-05-18T02:43:18.068469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:18.068469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Maximal Matching Energy of Tricyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lin Chen, Yongtang Shi","submitted_at":"2014-09-06T17:45:04Z","abstract_excerpt":"Gutman and Wagner proposed the concept of the matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and $\\mu_1,\\mu_2,\\ldots,\\mu_n$ be the roots of its matching polynomial. The matching energy of $G$ is defined to be the sum of the absolute values of $\\mu_{i}\\ (i=1,2,\\ldots,n)$. Gutman and Cvetkoi\\'c determined the tricyclic graphs on $n$ vertices with maximal number of matchings by a computer search for small values of $n$ and by an induction argument for the rest. Based on this result, in this paper, we character"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2038","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":"1409.2038","created_at":"2026-05-18T02:43:18.068557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2038v1","created_at":"2026-05-18T02:43:18.068557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2038","created_at":"2026-05-18T02:43:18.068557+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOQX7GM6LELK","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOQX7GM6LELKXYQE","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOQX7GM6","created_at":"2026-05-18T12:28:30.664211+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/HOQX7GM6LELKXYQE4BG335GCH5","json":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5.json","graph_json":"https://pith.science/api/pith-number/HOQX7GM6LELKXYQE4BG335GCH5/graph.json","events_json":"https://pith.science/api/pith-number/HOQX7GM6LELKXYQE4BG335GCH5/events.json","paper":"https://pith.science/paper/HOQX7GM6"},"agent_actions":{"view_html":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5","download_json":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5.json","view_paper":"https://pith.science/paper/HOQX7GM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2038&json=true","fetch_graph":"https://pith.science/api/pith-number/HOQX7GM6LELKXYQE4BG335GCH5/graph.json","fetch_events":"https://pith.science/api/pith-number/HOQX7GM6LELKXYQE4BG335GCH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5/action/storage_attestation","attest_author":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5/action/author_attestation","sign_citation":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5/action/citation_signature","submit_replication":"https://pith.science/pith/HOQX7GM6LELKXYQE4BG335GCH5/action/replication_record"}},"created_at":"2026-05-18T02:43:18.068557+00:00","updated_at":"2026-05-18T02:43:18.068557+00:00"}