{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VTMSSF3BXZ6YPSGWKPYK5DO25K","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":"b75e1d4c7593a78e1f60429a3c4c8d29e18ebe449a806d221f1192b3628e2f36","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-04-06T17:41:53Z","title_canon_sha256":"fbebab85b0700eeac3edde27a4fbc84b9ce63ebdeb48cf4bd124f4a8b08b40cf"},"schema_version":"1.0","source":{"id":"2304.03256","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.03256","created_at":"2026-07-05T05:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"2304.03256v1","created_at":"2026-07-05T05:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03256","created_at":"2026-07-05T05:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"VTMSSF3BXZ6Y","created_at":"2026-07-05T05:58:54Z"},{"alias_kind":"pith_short_16","alias_value":"VTMSSF3BXZ6YPSGW","created_at":"2026-07-05T05:58:54Z"},{"alias_kind":"pith_short_8","alias_value":"VTMSSF3B","created_at":"2026-07-05T05:58:54Z"}],"graph_snapshots":[{"event_id":"sha256:3d9079a3087b841a9bc9e1ce6d04c7a843531640eb10aa02bd34d04a5f60571c","target":"graph","created_at":"2026-07-05T05:58:54Z","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/2304.03256/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deciding whether a graph can be edge-decomposed into a matching and a $k$-bounded linear forest was recently shown by Campbell, H{\\\"o}rsch and Moore to be NP-complete for every $k \\ge 9$, and solvable in polynomial time for $k=1,2$. In the first part of this paper, we close this gap by showing that this problem is in NP-complete for every $k \\ge 3$. In the second part of the paper, we show that deciding whether a graph can be edge-decomposed into a matching and a $k$-bounded star forest is polynomially solvable for any $k \\in \\mathbb{N} \\cup \\{ \\infty \\}$, answering another question by Campbel","authors_text":"Adva Mond, Agnijo Banerjee, Jan Petr, Jo\\~ao Pedro Marciano, Julien Portier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-04-06T17:41:53Z","title":"The complexity of decomposing a graph into a matching and a bounded linear forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03256","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:a19259883cef2a7b7bd10692844d1e043b7902576cab811056a8dcbc4141e970","target":"record","created_at":"2026-07-05T05:58:54Z","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":"b75e1d4c7593a78e1f60429a3c4c8d29e18ebe449a806d221f1192b3628e2f36","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-04-06T17:41:53Z","title_canon_sha256":"fbebab85b0700eeac3edde27a4fbc84b9ce63ebdeb48cf4bd124f4a8b08b40cf"},"schema_version":"1.0","source":{"id":"2304.03256","kind":"arxiv","version":1}},"canonical_sha256":"acd9291761be7d87c8d653f0ae8ddaea91b598c4e772fa02c81af46e327dc427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acd9291761be7d87c8d653f0ae8ddaea91b598c4e772fa02c81af46e327dc427","first_computed_at":"2026-07-05T05:58:54.262023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:58:54.262023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZg0OcsddOTdz15Exc9I9VqkF7PEGxBSc5xUFPL8YpaQW2osokqcC2Sqk4z7h4O2Rbc/AngKpNamut9YLXSKBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:58:54.262395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.03256","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a19259883cef2a7b7bd10692844d1e043b7902576cab811056a8dcbc4141e970","sha256:3d9079a3087b841a9bc9e1ce6d04c7a843531640eb10aa02bd34d04a5f60571c"],"state_sha256":"b29701eca181735b0adb1df3a998345367c91dee64c9e74675632a7183a953e4"}