{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XWEESIPY2HHU7ALBL4JPHYPAV7","short_pith_number":"pith:XWEESIPY","schema_version":"1.0","canonical_sha256":"bd884921f8d1cf4f81615f12f3e1e0afcbcbde2e6b849a91708b5c73de07712f","source":{"kind":"arxiv","id":"2607.01438","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.01438","created_at":"2026-07-03T00:17:00.230301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01438v1","created_at":"2026-07-03T00:17:00.230301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01438","created_at":"2026-07-03T00:17:00.230301+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWEESIPY2HHU","created_at":"2026-07-03T00:17:00.230301+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWEESIPY2HHU7ALB","created_at":"2026-07-03T00:17:00.230301+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWEESIPY","created_at":"2026-07-03T00:17:00.230301+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/XWEESIPY2HHU7ALBL4JPHYPAV7","json":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7.json","graph_json":"https://pith.science/api/pith-number/XWEESIPY2HHU7ALBL4JPHYPAV7/graph.json","events_json":"https://pith.science/api/pith-number/XWEESIPY2HHU7ALBL4JPHYPAV7/events.json","paper":"https://pith.science/paper/XWEESIPY"},"agent_actions":{"view_html":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7","download_json":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7.json","view_paper":"https://pith.science/paper/XWEESIPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01438&json=true","fetch_graph":"https://pith.science/api/pith-number/XWEESIPY2HHU7ALBL4JPHYPAV7/graph.json","fetch_events":"https://pith.science/api/pith-number/XWEESIPY2HHU7ALBL4JPHYPAV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/action/storage_attestation","attest_author":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/action/author_attestation","sign_citation":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/action/citation_signature","submit_replication":"https://pith.science/pith/XWEESIPY2HHU7ALBL4JPHYPAV7/action/replication_record"}},"created_at":"2026-07-03T00:17:00.230301+00:00","updated_at":"2026-07-03T00:17:00.230301+00:00"}