{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XWEESIPY2HHU7ALBL4JPHYPAV7","short_pith_number":"pith:XWEESIPY","canonical_record":{"source":{"id":"2607.01438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T20:01:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e52e22f6720b916308012d11d782b59431baf4d0907f3a1366622d0968dda463","abstract_canon_sha256":"4bbd4d90568f9122a75490dd653354e5efab486065ebe868b7037b16b532e35a"},"schema_version":"1.0"},"canonical_sha256":"bd884921f8d1cf4f81615f12f3e1e0afcbcbde2e6b849a91708b5c73de07712f","source":{"kind":"arxiv","id":"2607.01438","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XWEESIPY2HHU7ALBL4JPHYPAV7","target":"record","payload":{"canonical_record":{"source":{"id":"2607.01438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T20:01:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e52e22f6720b916308012d11d782b59431baf4d0907f3a1366622d0968dda463","abstract_canon_sha256":"4bbd4d90568f9122a75490dd653354e5efab486065ebe868b7037b16b532e35a"},"schema_version":"1.0"},"canonical_sha256":"bd884921f8d1cf4f81615f12f3e1e0afcbcbde2e6b849a91708b5c73de07712f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:17:00.230647Z","signature_b64":"SUkvd8l47zvVPo+CQ/2NJG3y9/PnfG/bk88gF3rlFFwd3QqH6F/Linhd8i9iFRGNHdMwNO9Sz96ADsIaFCucDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd884921f8d1cf4f81615f12f3e1e0afcbcbde2e6b849a91708b5c73de07712f","last_reissued_at":"2026-07-03T00:17:00.230244Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:17:00.230244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.01438","source_version":1,"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-07-03T00:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQweMhKW531KQqLJKetgXFPGqtFxHYxO+R54RuyzVIgLvuQOeyz2/yMCdpuh0Rj+H4hwpLKtx+L9HuskiGhECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:24:35.580045Z"},"content_sha256":"f542d4fb1a4cbba229dce2bcf3ffa3a5123c75e612389a72c03af284b679f3a0","schema_version":"1.0","event_id":"sha256:f542d4fb1a4cbba229dce2bcf3ffa3a5123c75e612389a72c03af284b679f3a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XWEESIPY2HHU7ALBL4JPHYPAV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ohr Kadrawi, Vadim E. Levit","submitted_at":"2026-07-01T20:01:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01438","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01438/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-07-03T00:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poxwuvCeX5HkJpZd/o4XR5o/u0BjAzqurBFdQ0iXqi9HAN6sV7dzjkYpW+XSzR51ZadiXc7FEfXWtxX8K31CAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:24:35.580434Z"},"content_sha256":"4eda22dfd95d9eb911deb01ef68c1cc614d627254869e678f7444cdcde4682ab","schema_version":"1.0","event_id":"sha256:4eda22dfd95d9eb911deb01ef68c1cc614d627254869e678f7444cdcde4682ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/bundle.json","state_url":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/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-04T20:24:35Z","links":{"resolver":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7","bundle":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/bundle.json","state":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SQwsDxZkQL26O18krbaXxTgvaJpZHZVO7GX+niDWFBlPDjv1KqG2a0NHactg6T+MQ7FOlKKR/uMNnrhnmgg/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:24:35.582421Z","bundle_sha256":"7b9b8d4d968ab249d1687bde896e2c036366fb89cb8f85e9bbc91650f48585b4"}}