{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VTMSSF3BXZ6YPSGWKPYK5DO25K","short_pith_number":"pith:VTMSSF3B","schema_version":"1.0","canonical_sha256":"acd9291761be7d87c8d653f0ae8ddaea91b598c4e772fa02c81af46e327dc427","source":{"kind":"arxiv","id":"2304.03256","version":1},"attestation_state":"computed","paper":{"title":"The complexity of decomposing a graph into a matching and a bounded linear forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Adva Mond, Agnijo Banerjee, Jan Petr, Jo\\~ao Pedro Marciano, Julien Portier","submitted_at":"2023-04-06T17:41:53Z","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"},"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":"2304.03256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-04-06T17:41:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fbebab85b0700eeac3edde27a4fbc84b9ce63ebdeb48cf4bd124f4a8b08b40cf","abstract_canon_sha256":"b75e1d4c7593a78e1f60429a3c4c8d29e18ebe449a806d221f1192b3628e2f36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:54.262395Z","signature_b64":"UZg0OcsddOTdz15Exc9I9VqkF7PEGxBSc5xUFPL8YpaQW2osokqcC2Sqk4z7h4O2Rbc/AngKpNamut9YLXSKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acd9291761be7d87c8d653f0ae8ddaea91b598c4e772fa02c81af46e327dc427","last_reissued_at":"2026-07-05T05:58:54.262023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:54.262023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of decomposing a graph into a matching and a bounded linear forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Adva Mond, Agnijo Banerjee, Jan Petr, Jo\\~ao Pedro Marciano, Julien Portier","submitted_at":"2023-04-06T17:41:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03256","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/2304.03256/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":"2304.03256","created_at":"2026-07-05T05:58:54.262087+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03256v1","created_at":"2026-07-05T05:58:54.262087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03256","created_at":"2026-07-05T05:58:54.262087+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTMSSF3BXZ6Y","created_at":"2026-07-05T05:58:54.262087+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTMSSF3BXZ6YPSGW","created_at":"2026-07-05T05:58:54.262087+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTMSSF3B","created_at":"2026-07-05T05:58:54.262087+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/VTMSSF3BXZ6YPSGWKPYK5DO25K","json":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K.json","graph_json":"https://pith.science/api/pith-number/VTMSSF3BXZ6YPSGWKPYK5DO25K/graph.json","events_json":"https://pith.science/api/pith-number/VTMSSF3BXZ6YPSGWKPYK5DO25K/events.json","paper":"https://pith.science/paper/VTMSSF3B"},"agent_actions":{"view_html":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K","download_json":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K.json","view_paper":"https://pith.science/paper/VTMSSF3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03256&json=true","fetch_graph":"https://pith.science/api/pith-number/VTMSSF3BXZ6YPSGWKPYK5DO25K/graph.json","fetch_events":"https://pith.science/api/pith-number/VTMSSF3BXZ6YPSGWKPYK5DO25K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K/action/storage_attestation","attest_author":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K/action/author_attestation","sign_citation":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K/action/citation_signature","submit_replication":"https://pith.science/pith/VTMSSF3BXZ6YPSGWKPYK5DO25K/action/replication_record"}},"created_at":"2026-07-05T05:58:54.262087+00:00","updated_at":"2026-07-05T05:58:54.262087+00:00"}