{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KRT2K3RRGK3XQ3RKFLS63KOG7H","short_pith_number":"pith:KRT2K3RR","schema_version":"1.0","canonical_sha256":"5467a56e3132b7786e2a2ae5eda9c6f9caa49bb6b280778bed3d0cce5e5403f8","source":{"kind":"arxiv","id":"2606.15761","version":3},"attestation_state":"computed","paper":{"title":"Sharp bounds between the saturation number and the harmonic index","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chakshu Gupta","submitted_at":"2026-06-14T11:46:02Z","abstract_excerpt":"The saturation number $\\mu^*(G)$ of a graph $G$ is the minimum cardinality of a maximal matching, and $H(G)$ is its harmonic index. TxGraffiti conjectured in 2023 that $\\mu^*(G) \\le H(G)$ for every nontrivial connected graph $G$, and B{\\i}y{\\i}ko\\u{g}lu refuted this by showing that the ratio $\\mu^*(G)/H(G)$ can be made arbitrarily large. Restricting to trees bounds the ratio sharply. Every nontrivial tree $T$ satisfies $\\mu^*(T) < \\frac{3}{2} H(T)$, with the constant $3/2$ best possible. A complementary bound $H(G) < 4\\mu^*(G)$ holds for every graph with an edge, so on a nontrivial tree the sa"},"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":"2606.15761","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-14T11:46:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"56cfb7ac063a21f912ce1bfc4060c9e83f0b3abd88b87fb36ae973734d9d969d","abstract_canon_sha256":"74ee201b93e7bff34aa076b5b731a4b528616d81407167a1a31df4312408203f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:56.071492Z","signature_b64":"fxjRrwSfgvvTLR4KOvyhSVKuCbr2YwBM0CbTIS3Bk+AJJPqLI25FgVZfrPkNVjn7zdhRKEts3a2ghAPa3LEXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5467a56e3132b7786e2a2ae5eda9c6f9caa49bb6b280778bed3d0cce5e5403f8","last_reissued_at":"2026-06-19T16:12:56.071099Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:56.071099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp bounds between the saturation number and the harmonic index","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chakshu Gupta","submitted_at":"2026-06-14T11:46:02Z","abstract_excerpt":"The saturation number $\\mu^*(G)$ of a graph $G$ is the minimum cardinality of a maximal matching, and $H(G)$ is its harmonic index. TxGraffiti conjectured in 2023 that $\\mu^*(G) \\le H(G)$ for every nontrivial connected graph $G$, and B{\\i}y{\\i}ko\\u{g}lu refuted this by showing that the ratio $\\mu^*(G)/H(G)$ can be made arbitrarily large. Restricting to trees bounds the ratio sharply. Every nontrivial tree $T$ satisfies $\\mu^*(T) < \\frac{3}{2} H(T)$, with the constant $3/2$ best possible. A complementary bound $H(G) < 4\\mu^*(G)$ holds for every graph with an edge, so on a nontrivial tree the sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.15761","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.15761/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.15761","created_at":"2026-06-19T16:12:56.071163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.15761v3","created_at":"2026-06-19T16:12:56.071163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.15761","created_at":"2026-06-19T16:12:56.071163+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRT2K3RRGK3X","created_at":"2026-06-19T16:12:56.071163+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRT2K3RRGK3XQ3RK","created_at":"2026-06-19T16:12:56.071163+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRT2K3RR","created_at":"2026-06-19T16:12:56.071163+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/KRT2K3RRGK3XQ3RKFLS63KOG7H","json":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H.json","graph_json":"https://pith.science/api/pith-number/KRT2K3RRGK3XQ3RKFLS63KOG7H/graph.json","events_json":"https://pith.science/api/pith-number/KRT2K3RRGK3XQ3RKFLS63KOG7H/events.json","paper":"https://pith.science/paper/KRT2K3RR"},"agent_actions":{"view_html":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H","download_json":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H.json","view_paper":"https://pith.science/paper/KRT2K3RR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.15761&json=true","fetch_graph":"https://pith.science/api/pith-number/KRT2K3RRGK3XQ3RKFLS63KOG7H/graph.json","fetch_events":"https://pith.science/api/pith-number/KRT2K3RRGK3XQ3RKFLS63KOG7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/action/storage_attestation","attest_author":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/action/author_attestation","sign_citation":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/action/citation_signature","submit_replication":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/action/replication_record"}},"created_at":"2026-06-19T16:12:56.071163+00:00","updated_at":"2026-06-19T16:12:56.071163+00:00"}