{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PU3Q7HQF3YDUNDFKTGKDIMP7X6","short_pith_number":"pith:PU3Q7HQF","schema_version":"1.0","canonical_sha256":"7d370f9e05de07468caa99943431ffbfadbdcc82096dd28725afda24a51404a2","source":{"kind":"arxiv","id":"1102.5409","version":1},"attestation_state":"computed","paper":{"title":"The Wiener Index of Unicyclic Graphs with Girth and the Matching Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Dong Zhang, Ya-Hong Chen","submitted_at":"2011-02-26T13:26:33Z","abstract_excerpt":"In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order $n$ with girth and the matching number $\\beta\\ge \\frac{3g}{2}$. Moreover, we characterize all extremal graphs which attain the lower bound."},"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":"1102.5409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-26T13:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"dd6d1872223d18af8488efcc8d15733177e440c3a808b2d9b3b3530f12c9673f","abstract_canon_sha256":"7756654002ee7f8ce38a9089917e74dc44c40b0daaa47ffd184b437e6de8bf0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:47.005557Z","signature_b64":"VydTjbiOh7oF7QgJiAITXjcqfJlRMAJiLAZcUU7kDMcL6kakDDxiT6WMZ9LwdR/K7vUq0MvcjhQv7rHJPmZSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d370f9e05de07468caa99943431ffbfadbdcc82096dd28725afda24a51404a2","last_reissued_at":"2026-05-18T04:27:47.004984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:47.004984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Wiener Index of Unicyclic Graphs with Girth and the Matching Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiao-Dong Zhang, Ya-Hong Chen","submitted_at":"2011-02-26T13:26:33Z","abstract_excerpt":"In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order $n$ with girth and the matching number $\\beta\\ge \\frac{3g}{2}$. Moreover, we characterize all extremal graphs which attain the lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5409","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":"1102.5409","created_at":"2026-05-18T04:27:47.005069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5409v1","created_at":"2026-05-18T04:27:47.005069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5409","created_at":"2026-05-18T04:27:47.005069+00:00"},{"alias_kind":"pith_short_12","alias_value":"PU3Q7HQF3YDU","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PU3Q7HQF3YDUNDFK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PU3Q7HQF","created_at":"2026-05-18T12:26:39.201973+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/PU3Q7HQF3YDUNDFKTGKDIMP7X6","json":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6.json","graph_json":"https://pith.science/api/pith-number/PU3Q7HQF3YDUNDFKTGKDIMP7X6/graph.json","events_json":"https://pith.science/api/pith-number/PU3Q7HQF3YDUNDFKTGKDIMP7X6/events.json","paper":"https://pith.science/paper/PU3Q7HQF"},"agent_actions":{"view_html":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6","download_json":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6.json","view_paper":"https://pith.science/paper/PU3Q7HQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5409&json=true","fetch_graph":"https://pith.science/api/pith-number/PU3Q7HQF3YDUNDFKTGKDIMP7X6/graph.json","fetch_events":"https://pith.science/api/pith-number/PU3Q7HQF3YDUNDFKTGKDIMP7X6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6/action/storage_attestation","attest_author":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6/action/author_attestation","sign_citation":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6/action/citation_signature","submit_replication":"https://pith.science/pith/PU3Q7HQF3YDUNDFKTGKDIMP7X6/action/replication_record"}},"created_at":"2026-05-18T04:27:47.005069+00:00","updated_at":"2026-05-18T04:27:47.005069+00:00"}