{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:R35GXEPEODH3SWZ3SXWON4DUHS","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":"8677e95c8184119f3256146f16b96a7a7ad8d08ed7a5af2fe2794584b5901b55","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T19:01:16Z","title_canon_sha256":"8a7cdf6366f40dd521272095aa9af6178f8160bde1be03b52b6827e6e3b09c79"},"schema_version":"1.0","source":{"id":"2405.04617","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04617","created_at":"2026-07-05T09:24:16Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04617v2","created_at":"2026-07-05T09:24:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04617","created_at":"2026-07-05T09:24:16Z"},{"alias_kind":"pith_short_12","alias_value":"R35GXEPEODH3","created_at":"2026-07-05T09:24:16Z"},{"alias_kind":"pith_short_16","alias_value":"R35GXEPEODH3SWZ3","created_at":"2026-07-05T09:24:16Z"},{"alias_kind":"pith_short_8","alias_value":"R35GXEPE","created_at":"2026-07-05T09:24:16Z"}],"graph_snapshots":[{"event_id":"sha256:927da9d639b5bb843661fa8454ef9db5b3d040b010b9259dfe5184c39c0f5ac3","target":"graph","created_at":"2026-07-05T09:24:16Z","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/2405.04617/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a tree decomposition $\\mathcal{T}$ of a graph $G$, let $\\mu(\\mathcal{T})$ denote the maximum size of an induced matching in $G$ with the property that some bag of $\\mathcal{T}$ contains at least one endpoint of every edge of the matching. The induced matching treewidth of a graph $G$ is the minimum value of $\\mu(\\mathcal{T})$ over all tree decompositions $\\mathcal{T}$ of $G$. Classes of graphs with bounded induced matching treewidth admit polynomial-time algorithms for a number of problems, including INDEPENDENT SET, $k$-COLORING, ODD CYCLE TRANSVERSAL, and FEEDBACK VERTEX SET. In this pap","authors_text":"Bartosz Walczak, Jadwiga Czy\\.zewska, Marcin Bria\\'nski, Martin Milani\\v{c}, Pawe{\\l} Rz\\k{a}\\.zewski, Rose McCarty, Tara Abrishami","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T19:01:16Z","title":"Excluding a clique or a biclique in graphs of bounded induced matching treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04617","kind":"arxiv","version":2},"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:b82f75e58748b66b7097a8ebc823b8dedbaf3a7c3b7eb1e2f5f5ec48c43eb637","target":"record","created_at":"2026-07-05T09:24:16Z","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":"8677e95c8184119f3256146f16b96a7a7ad8d08ed7a5af2fe2794584b5901b55","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T19:01:16Z","title_canon_sha256":"8a7cdf6366f40dd521272095aa9af6178f8160bde1be03b52b6827e6e3b09c79"},"schema_version":"1.0","source":{"id":"2405.04617","kind":"arxiv","version":2}},"canonical_sha256":"8efa6b91e470cfb95b3b95ece6f0743cb71ad2c4d3efff4e11485562ba36e41d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8efa6b91e470cfb95b3b95ece6f0743cb71ad2c4d3efff4e11485562ba36e41d","first_computed_at":"2026-07-05T09:24:16.537149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:24:16.537149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z+cBHU1/6zc0Rhe1YbTAdivrwrevqMMoXG3czWSo+3fRe5ua+HF0vi0HJtKhDuzcJrRJ13n4n11k6BK+w2KRAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:24:16.537624Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.04617","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b82f75e58748b66b7097a8ebc823b8dedbaf3a7c3b7eb1e2f5f5ec48c43eb637","sha256:927da9d639b5bb843661fa8454ef9db5b3d040b010b9259dfe5184c39c0f5ac3"],"state_sha256":"e66949ac6e9fcfc6aacc2173a5c5cc34291eb035a03f3c8e4d0c06b94fc74414"}