{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KRT2K3RRGK3XQ3RKFLS63KOG7H","short_pith_number":"pith:KRT2K3RR","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"},"canonical_sha256":"5467a56e3132b7786e2a2ae5eda9c6f9caa49bb6b280778bed3d0cce5e5403f8","source":{"kind":"arxiv","id":"2606.15761","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.15761","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.15761v3","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.15761","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"KRT2K3RRGK3X","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"pith_short_16","alias_value":"KRT2K3RRGK3XQ3RK","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"pith_short_8","alias_value":"KRT2K3RR","created_at":"2026-06-19T16:12:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KRT2K3RRGK3XQ3RKFLS63KOG7H","target":"record","payload":{"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"},"canonical_sha256":"5467a56e3132b7786e2a2ae5eda9c6f9caa49bb6b280778bed3d0cce5e5403f8","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"},"source_kind":"arxiv","source_id":"2606.15761","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rFR8cEQRzGbcyzF6O/gMYWaURvjWD7usPlD4KdskTnKe2GW2clfALARjwdAJgpDnMrGIDqRIkYhrN2/OKkGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:00:24.113302Z"},"content_sha256":"0e6672d2a7f615fbc00d1413c211bb751e2fb5e2396b61c2c7d17a41327c7fa6","schema_version":"1.0","event_id":"sha256:0e6672d2a7f615fbc00d1413c211bb751e2fb5e2396b61c2c7d17a41327c7fa6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KRT2K3RRGK3XQ3RKFLS63KOG7H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vLXlTV8cc3RvqhQFt1ifQ8Hlv0bf344QLlRheqPakHsKXBtkIh+hLB7bXLt4HWOm5+i2hOygnQ8aZqecSnjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:00:24.113728Z"},"content_sha256":"8b96c0b6644a0cb9810b9ab40985906d9506b0762b3f3ecaa39c376529c9e39b","schema_version":"1.0","event_id":"sha256:8b96c0b6644a0cb9810b9ab40985906d9506b0762b3f3ecaa39c376529c9e39b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/bundle.json","state_url":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T09:00:24Z","links":{"resolver":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H","bundle":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/bundle.json","state":"https://pith.science/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRT2K3RRGK3XQ3RKFLS63KOG7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KRT2K3RRGK3XQ3RKFLS63KOG7H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"74ee201b93e7bff34aa076b5b731a4b528616d81407167a1a31df4312408203f","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-14T11:46:02Z","title_canon_sha256":"56cfb7ac063a21f912ce1bfc4060c9e83f0b3abd88b87fb36ae973734d9d969d"},"schema_version":"1.0","source":{"id":"2606.15761","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.15761","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.15761v3","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.15761","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"KRT2K3RRGK3X","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"pith_short_16","alias_value":"KRT2K3RRGK3XQ3RK","created_at":"2026-06-19T16:12:56Z"},{"alias_kind":"pith_short_8","alias_value":"KRT2K3RR","created_at":"2026-06-19T16:12:56Z"}],"graph_snapshots":[{"event_id":"sha256:8b96c0b6644a0cb9810b9ab40985906d9506b0762b3f3ecaa39c376529c9e39b","target":"graph","created_at":"2026-06-19T16:12:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.15761/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chakshu Gupta","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-14T11:46:02Z","title":"Sharp bounds between the saturation number and the harmonic index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.15761","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e6672d2a7f615fbc00d1413c211bb751e2fb5e2396b61c2c7d17a41327c7fa6","target":"record","created_at":"2026-06-19T16:12:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"74ee201b93e7bff34aa076b5b731a4b528616d81407167a1a31df4312408203f","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-14T11:46:02Z","title_canon_sha256":"56cfb7ac063a21f912ce1bfc4060c9e83f0b3abd88b87fb36ae973734d9d969d"},"schema_version":"1.0","source":{"id":"2606.15761","kind":"arxiv","version":3}},"canonical_sha256":"5467a56e3132b7786e2a2ae5eda9c6f9caa49bb6b280778bed3d0cce5e5403f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5467a56e3132b7786e2a2ae5eda9c6f9caa49bb6b280778bed3d0cce5e5403f8","first_computed_at":"2026-06-19T16:12:56.071099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:56.071099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fxjRrwSfgvvTLR4KOvyhSVKuCbr2YwBM0CbTIS3Bk+AJJPqLI25FgVZfrPkNVjn7zdhRKEts3a2ghAPa3LEXBQ==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:56.071492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.15761","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e6672d2a7f615fbc00d1413c211bb751e2fb5e2396b61c2c7d17a41327c7fa6","sha256:8b96c0b6644a0cb9810b9ab40985906d9506b0762b3f3ecaa39c376529c9e39b"],"state_sha256":"cca85bdbf143587f177a8a8f39ca688d4d15a6647a176b7a0e51f324981f9ccf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+AyKiotKoboIh2gSRneunV1rFuHu6kslSyaO9/aAp71MjXBn+b8UxI7WYzYb6vc/odCSESiJZI/Cmr4rSlZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:00:24.115762Z","bundle_sha256":"3657164df6e7cefef632c8a7e7425536855ed9602d64d8f3a49c731aa52de004"}}