{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VN7M542Y5XYDZS3GYICJT4KBHV","short_pith_number":"pith:VN7M542Y","schema_version":"1.0","canonical_sha256":"ab7ecef358edf03ccb66c20499f1413d788e3221ceb436272db2667d58160248","source":{"kind":"arxiv","id":"1809.02710","version":1},"attestation_state":"computed","paper":{"title":"The Partition Spanning Forest Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, Boris Klemz, Ignaz Rutter, Patrick Schnider, Philipp Kindermann","submitted_at":"2018-09-07T23:21:49Z","abstract_excerpt":"Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly the points of one color class. We show that the problem is NP-complete, even if every color class contains at most five points, but it is solvable in $O(n^2)$ time when each color class contains at most three points. If we require that the spanning forest is a linear forest, then the problem becomes NP-complete even if every color class contains at most four points."},"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":"1809.02710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-07T23:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"77b19c3da400fdce8d5875c40ce43c41d6f914467f3cfcc1b435bde81952923b","abstract_canon_sha256":"8c218fd6d86d2a58d4c87c0b98fc0a98c857c60d95ddc4b7545e4c85b0eeb984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:15.553984Z","signature_b64":"qlZgmJUg6oNdMdVuj73lxxh2FwdqPrynzaA230lr42aBHUoP6x6+kkZ27ulyBH8kspBkJgnvbdXvqR5k2CnjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7ecef358edf03ccb66c20499f1413d788e3221ceb436272db2667d58160248","last_reissued_at":"2026-05-18T00:06:15.553386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:15.553386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Partition Spanning Forest Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, Boris Klemz, Ignaz Rutter, Patrick Schnider, Philipp Kindermann","submitted_at":"2018-09-07T23:21:49Z","abstract_excerpt":"Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly the points of one color class. We show that the problem is NP-complete, even if every color class contains at most five points, but it is solvable in $O(n^2)$ time when each color class contains at most three points. If we require that the spanning forest is a linear forest, then the problem becomes NP-complete even if every color class contains at most four points."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02710","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":""},"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":"1809.02710","created_at":"2026-05-18T00:06:15.553473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02710v1","created_at":"2026-05-18T00:06:15.553473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02710","created_at":"2026-05-18T00:06:15.553473+00:00"},{"alias_kind":"pith_short_12","alias_value":"VN7M542Y5XYD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VN7M542Y5XYDZS3G","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VN7M542Y","created_at":"2026-05-18T12:32:59.047623+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/VN7M542Y5XYDZS3GYICJT4KBHV","json":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV.json","graph_json":"https://pith.science/api/pith-number/VN7M542Y5XYDZS3GYICJT4KBHV/graph.json","events_json":"https://pith.science/api/pith-number/VN7M542Y5XYDZS3GYICJT4KBHV/events.json","paper":"https://pith.science/paper/VN7M542Y"},"agent_actions":{"view_html":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV","download_json":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV.json","view_paper":"https://pith.science/paper/VN7M542Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02710&json=true","fetch_graph":"https://pith.science/api/pith-number/VN7M542Y5XYDZS3GYICJT4KBHV/graph.json","fetch_events":"https://pith.science/api/pith-number/VN7M542Y5XYDZS3GYICJT4KBHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV/action/storage_attestation","attest_author":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV/action/author_attestation","sign_citation":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV/action/citation_signature","submit_replication":"https://pith.science/pith/VN7M542Y5XYDZS3GYICJT4KBHV/action/replication_record"}},"created_at":"2026-05-18T00:06:15.553473+00:00","updated_at":"2026-05-18T00:06:15.553473+00:00"}