{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2HS2WGSDTFZMJR52EV6HYMX7AA","short_pith_number":"pith:2HS2WGSD","schema_version":"1.0","canonical_sha256":"d1e5ab1a439972c4c7ba257c7c32ff000d1d4410f1b63bae85001bec2ac3f3fd","source":{"kind":"arxiv","id":"1704.02068","version":1},"attestation_state":"computed","paper":{"title":"Ordering of bicyclic graphs by matching energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ligong Wang, Peng Xiao, Xiangxiang Liu","submitted_at":"2017-04-07T01:48:38Z","abstract_excerpt":"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 is defined as the sum $\\sum^{n}_{i=1}|\\mu_{i}|$, which was introduced by Gutman and Wagner in 2012. In this paper, the graphs with the first five smallest matching energies among all bicyclic graphs for order $n>5$ are determined."},"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":"1704.02068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-07T01:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"265bbd8d00f04a23ec16b32587f565dcdef8e72c1c5a3b7a261d3c5f517e9c59","abstract_canon_sha256":"fe033a1a447a6bb0f62784e068f8c40e9232d62bb2acf3d81a71e5b870800672"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:50.900630Z","signature_b64":"qqbrXc249MSG/eyx5mh00NLXhYPhFZFPRWaGg/0jB1/E53DCz3RRSrPwhG0D6/aLZvu0rFEJtqGoaWw+vBTuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e5ab1a439972c4c7ba257c7c32ff000d1d4410f1b63bae85001bec2ac3f3fd","last_reissued_at":"2026-05-18T00:46:50.900089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:50.900089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordering of bicyclic graphs by matching energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ligong Wang, Peng Xiao, Xiangxiang Liu","submitted_at":"2017-04-07T01:48:38Z","abstract_excerpt":"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 is defined as the sum $\\sum^{n}_{i=1}|\\mu_{i}|$, which was introduced by Gutman and Wagner in 2012. In this paper, the graphs with the first five smallest matching energies among all bicyclic graphs for order $n>5$ are determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02068","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":"1704.02068","created_at":"2026-05-18T00:46:50.900176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02068v1","created_at":"2026-05-18T00:46:50.900176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02068","created_at":"2026-05-18T00:46:50.900176+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HS2WGSDTFZM","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HS2WGSDTFZMJR52","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HS2WGSD","created_at":"2026-05-18T12:30:55.937587+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/2HS2WGSDTFZMJR52EV6HYMX7AA","json":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA.json","graph_json":"https://pith.science/api/pith-number/2HS2WGSDTFZMJR52EV6HYMX7AA/graph.json","events_json":"https://pith.science/api/pith-number/2HS2WGSDTFZMJR52EV6HYMX7AA/events.json","paper":"https://pith.science/paper/2HS2WGSD"},"agent_actions":{"view_html":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA","download_json":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA.json","view_paper":"https://pith.science/paper/2HS2WGSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02068&json=true","fetch_graph":"https://pith.science/api/pith-number/2HS2WGSDTFZMJR52EV6HYMX7AA/graph.json","fetch_events":"https://pith.science/api/pith-number/2HS2WGSDTFZMJR52EV6HYMX7AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA/action/storage_attestation","attest_author":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA/action/author_attestation","sign_citation":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA/action/citation_signature","submit_replication":"https://pith.science/pith/2HS2WGSDTFZMJR52EV6HYMX7AA/action/replication_record"}},"created_at":"2026-05-18T00:46:50.900176+00:00","updated_at":"2026-05-18T00:46:50.900176+00:00"}