{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BMZJDYQF2JMOVLOM6QGAY3SKX7","short_pith_number":"pith:BMZJDYQF","schema_version":"1.0","canonical_sha256":"0b3291e205d258eaadccf40c0c6e4abff6ff316f19174ac64afa97fc1bda8933","source":{"kind":"arxiv","id":"1204.3686","version":1},"attestation_state":"computed","paper":{"title":"Maximum Estrada Index of Bicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Long Wang, Yi Wang, Yi-Zheng Fan","submitted_at":"2012-04-17T02:01:12Z","abstract_excerpt":"Let $G$ be a simple graph of order $n$, let $\\lambda_1(G),\\lambda_2(G),...,\\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^{n}e^{\\lambda_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order."},"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":"1204.3686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-17T02:01:12Z","cross_cats_sorted":[],"title_canon_sha256":"e1956473951328a167ed83adcbdec15a1889304586b4c06be9db1460bc04b0a5","abstract_canon_sha256":"45daa3705a09b0e174b16a646762211ebd5a2dcdec6673516b49ba5990f48f64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:37.604461Z","signature_b64":"iZnaA40qrv0rKj9VglRucVrqMkCFtCMqU9hcQ0siwIPE/3VQoqVxYbQ2u1fJ4hGkGMAXlFn5+EJL2Y3SXGbWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b3291e205d258eaadccf40c0c6e4abff6ff316f19174ac64afa97fc1bda8933","last_reissued_at":"2026-05-18T02:42:37.603774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:37.603774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Estrada Index of Bicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Long Wang, Yi Wang, Yi-Zheng Fan","submitted_at":"2012-04-17T02:01:12Z","abstract_excerpt":"Let $G$ be a simple graph of order $n$, let $\\lambda_1(G),\\lambda_2(G),...,\\lambda_n(G)$ be the eigenvalues of the adjacency matrix of $G$. The Esrada index of $G$ is defined as $EE(G)=\\sum_{i=1}^{n}e^{\\lambda_i(G)}$. In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3686","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":"1204.3686","created_at":"2026-05-18T02:42:37.603885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3686v1","created_at":"2026-05-18T02:42:37.603885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3686","created_at":"2026-05-18T02:42:37.603885+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMZJDYQF2JMO","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMZJDYQF2JMOVLOM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMZJDYQF","created_at":"2026-05-18T12:27:01.376967+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/BMZJDYQF2JMOVLOM6QGAY3SKX7","json":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7.json","graph_json":"https://pith.science/api/pith-number/BMZJDYQF2JMOVLOM6QGAY3SKX7/graph.json","events_json":"https://pith.science/api/pith-number/BMZJDYQF2JMOVLOM6QGAY3SKX7/events.json","paper":"https://pith.science/paper/BMZJDYQF"},"agent_actions":{"view_html":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7","download_json":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7.json","view_paper":"https://pith.science/paper/BMZJDYQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3686&json=true","fetch_graph":"https://pith.science/api/pith-number/BMZJDYQF2JMOVLOM6QGAY3SKX7/graph.json","fetch_events":"https://pith.science/api/pith-number/BMZJDYQF2JMOVLOM6QGAY3SKX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7/action/storage_attestation","attest_author":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7/action/author_attestation","sign_citation":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7/action/citation_signature","submit_replication":"https://pith.science/pith/BMZJDYQF2JMOVLOM6QGAY3SKX7/action/replication_record"}},"created_at":"2026-05-18T02:42:37.603885+00:00","updated_at":"2026-05-18T02:42:37.603885+00:00"}