{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CTKMV25IVCNHAKMJYJKK3JFAQV","short_pith_number":"pith:CTKMV25I","schema_version":"1.0","canonical_sha256":"14d4caeba8a89a702989c254ada4a0856234c23602ae9b663bd7c225c1759238","source":{"kind":"arxiv","id":"0909.4577","version":1},"attestation_state":"computed","paper":{"title":"On Sum--Connectivity Index of Bicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Zhibin Du","submitted_at":"2009-09-24T23:55:15Z","abstract_excerpt":"We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\\le m\\le \\lfloor\\frac{n}{2}\\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\\ge 5$ vertices. The extremal graphs are characterized."},"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":"0909.4577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-09-24T23:55:15Z","cross_cats_sorted":[],"title_canon_sha256":"eee907422c3ade9101f69f2bad9e861307ced60d7f4fda3421467aa9895ffe3a","abstract_canon_sha256":"6af06f35e6f76ec23d1436e5c93ae98267381692135aee426a963c7e5c3dad22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:26.698821Z","signature_b64":"B9m/FCdTP5kJoSwaVvBHaVmv7fJF2QtezuEsWxmwYB8qnWBVD0xr+naQEmQtTqtAPX463GUlCJqzZk5Hkt7FCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14d4caeba8a89a702989c254ada4a0856234c23602ae9b663bd7c225c1759238","last_reissued_at":"2026-05-18T04:01:26.698182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:26.698182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Sum--Connectivity Index of Bicyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Zhibin Du","submitted_at":"2009-09-24T23:55:15Z","abstract_excerpt":"We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\\le m\\le \\lfloor\\frac{n}{2}\\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\\ge 5$ vertices. The extremal graphs are characterized."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4577","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":"0909.4577","created_at":"2026-05-18T04:01:26.698280+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4577v1","created_at":"2026-05-18T04:01:26.698280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4577","created_at":"2026-05-18T04:01:26.698280+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTKMV25IVCNH","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTKMV25IVCNHAKMJ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTKMV25I","created_at":"2026-05-18T12:25:59.703012+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/CTKMV25IVCNHAKMJYJKK3JFAQV","json":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV.json","graph_json":"https://pith.science/api/pith-number/CTKMV25IVCNHAKMJYJKK3JFAQV/graph.json","events_json":"https://pith.science/api/pith-number/CTKMV25IVCNHAKMJYJKK3JFAQV/events.json","paper":"https://pith.science/paper/CTKMV25I"},"agent_actions":{"view_html":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV","download_json":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV.json","view_paper":"https://pith.science/paper/CTKMV25I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4577&json=true","fetch_graph":"https://pith.science/api/pith-number/CTKMV25IVCNHAKMJYJKK3JFAQV/graph.json","fetch_events":"https://pith.science/api/pith-number/CTKMV25IVCNHAKMJYJKK3JFAQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV/action/storage_attestation","attest_author":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV/action/author_attestation","sign_citation":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV/action/citation_signature","submit_replication":"https://pith.science/pith/CTKMV25IVCNHAKMJYJKK3JFAQV/action/replication_record"}},"created_at":"2026-05-18T04:01:26.698280+00:00","updated_at":"2026-05-18T04:01:26.698280+00:00"}