{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XWEESIPY2HHU7ALBL4JPHYPAV7","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":"4bbd4d90568f9122a75490dd653354e5efab486065ebe868b7037b16b532e35a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T20:01:14Z","title_canon_sha256":"e52e22f6720b916308012d11d782b59431baf4d0907f3a1366622d0968dda463"},"schema_version":"1.0","source":{"id":"2607.01438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01438","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01438v1","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01438","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"XWEESIPY2HHU","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_16","alias_value":"XWEESIPY2HHU7ALB","created_at":"2026-07-03T00:17:00Z"},{"alias_kind":"pith_short_8","alias_value":"XWEESIPY","created_at":"2026-07-03T00:17:00Z"}],"graph_snapshots":[{"event_id":"sha256:4eda22dfd95d9eb911deb01ef68c1cc614d627254869e678f7444cdcde4682ab","target":"graph","created_at":"2026-07-03T00:17:00Z","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/2607.01438/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a finite simple graph. The annihilation number $a(G)$ is an efficiently computable upper bound on the independence number $\\alpha(G)$. We develop a sharp matching-number theory for the gap $a(G)-\\alpha(G)$. The strongest general theorem is the exact closed form \\[a(G)-\\alpha(G)\\leq 2\\mu(G)+1- \\lceil \\sqrt{6 \\mu(G)} \\rceil \\qquad(\\mu(G)\\geq 1), \\] and the bound is attained for every prescribed matching number. We also prove sharp matching-dependent bounds for forests, bipartite graphs, and K\\\"onig-Egerv\\'ary graphs, with equality constructions, equality certificates, and equality cri","authors_text":"Ohr Kadrawi, Vadim E. Levit","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T20:01:14Z","title":"Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01438","kind":"arxiv","version":1},"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:f542d4fb1a4cbba229dce2bcf3ffa3a5123c75e612389a72c03af284b679f3a0","target":"record","created_at":"2026-07-03T00:17:00Z","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":"4bbd4d90568f9122a75490dd653354e5efab486065ebe868b7037b16b532e35a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T20:01:14Z","title_canon_sha256":"e52e22f6720b916308012d11d782b59431baf4d0907f3a1366622d0968dda463"},"schema_version":"1.0","source":{"id":"2607.01438","kind":"arxiv","version":1}},"canonical_sha256":"bd884921f8d1cf4f81615f12f3e1e0afcbcbde2e6b849a91708b5c73de07712f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd884921f8d1cf4f81615f12f3e1e0afcbcbde2e6b849a91708b5c73de07712f","first_computed_at":"2026-07-03T00:17:00.230244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:17:00.230244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUkvd8l47zvVPo+CQ/2NJG3y9/PnfG/bk88gF3rlFFwd3QqH6F/Linhd8i9iFRGNHdMwNO9Sz96ADsIaFCucDw==","signature_status":"signed_v1","signed_at":"2026-07-03T00:17:00.230647Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f542d4fb1a4cbba229dce2bcf3ffa3a5123c75e612389a72c03af284b679f3a0","sha256:4eda22dfd95d9eb911deb01ef68c1cc614d627254869e678f7444cdcde4682ab"],"state_sha256":"cf569386c3bdcf28dfcfd1b05de0f45bb66ec16c4c9deb93ab16478883bc8b88"}