{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ODSBIY7U36NQKNXQPEJVAU3XFL","short_pith_number":"pith:ODSBIY7U","schema_version":"1.0","canonical_sha256":"70e41463f4df9b0536f079135053772aefa40f77661bebb72ef7af6e94b6f7c3","source":{"kind":"arxiv","id":"1402.2589","version":3},"attestation_state":"computed","paper":{"title":"Partitioning Perfect Graphs into Stars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Laurent Bulteau, Ren\\'e van Bevern, Robert Bredereck, Rolf Niedermeier, Vincent Froese","submitted_at":"2014-02-11T18:14:42Z","abstract_excerpt":"The partition of graphs into \"nice\" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs."},"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":"1402.2589","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T18:14:42Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"729724ce931b3d4d2414aa037519edd96f1a238f882942edeb18aee8ec160cbe","abstract_canon_sha256":"6fa85bc27744abe2715860081fb0695d2c91bee256f8045315c22aeee6ba72b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.616808Z","signature_b64":"933ATfR1a4b//Ho+VFbGq9YDAyeEsX4jqRuUSWejica7OW04Fh/ZX+WvaiVhAeWuSvH0Z/RXoIP1p1nRnxQoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e41463f4df9b0536f079135053772aefa40f77661bebb72ef7af6e94b6f7c3","last_reissued_at":"2026-05-18T00:43:45.616240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.616240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioning Perfect Graphs into Stars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Laurent Bulteau, Ren\\'e van Bevern, Robert Bredereck, Rolf Niedermeier, Vincent Froese","submitted_at":"2014-02-11T18:14:42Z","abstract_excerpt":"The partition of graphs into \"nice\" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2589","kind":"arxiv","version":3},"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":"1402.2589","created_at":"2026-05-18T00:43:45.616330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2589v3","created_at":"2026-05-18T00:43:45.616330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2589","created_at":"2026-05-18T00:43:45.616330+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODSBIY7U36NQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODSBIY7U36NQKNXQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODSBIY7U","created_at":"2026-05-18T12:28:41.024544+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/ODSBIY7U36NQKNXQPEJVAU3XFL","json":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL.json","graph_json":"https://pith.science/api/pith-number/ODSBIY7U36NQKNXQPEJVAU3XFL/graph.json","events_json":"https://pith.science/api/pith-number/ODSBIY7U36NQKNXQPEJVAU3XFL/events.json","paper":"https://pith.science/paper/ODSBIY7U"},"agent_actions":{"view_html":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL","download_json":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL.json","view_paper":"https://pith.science/paper/ODSBIY7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2589&json=true","fetch_graph":"https://pith.science/api/pith-number/ODSBIY7U36NQKNXQPEJVAU3XFL/graph.json","fetch_events":"https://pith.science/api/pith-number/ODSBIY7U36NQKNXQPEJVAU3XFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL/action/storage_attestation","attest_author":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL/action/author_attestation","sign_citation":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL/action/citation_signature","submit_replication":"https://pith.science/pith/ODSBIY7U36NQKNXQPEJVAU3XFL/action/replication_record"}},"created_at":"2026-05-18T00:43:45.616330+00:00","updated_at":"2026-05-18T00:43:45.616330+00:00"}