{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ODSBIY7U36NQKNXQPEJVAU3XFL","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":"6fa85bc27744abe2715860081fb0695d2c91bee256f8045315c22aeee6ba72b1","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T18:14:42Z","title_canon_sha256":"729724ce931b3d4d2414aa037519edd96f1a238f882942edeb18aee8ec160cbe"},"schema_version":"1.0","source":{"id":"1402.2589","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2589","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2589v3","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2589","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODSBIY7U36NQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ODSBIY7U36NQKNXQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ODSBIY7U","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:9c49d220bbdcb0c3d192d857faf72218b4981546e728890e5e053db116e88bc4","target":"graph","created_at":"2026-05-18T00:43:45Z","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"},"paper":{"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.","authors_text":"Gerhard J. Woeginger, Jiehua Chen, Laurent Bulteau, Ren\\'e van Bevern, Robert Bredereck, Rolf Niedermeier, Vincent Froese","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T18:14:42Z","title":"Partitioning Perfect Graphs into Stars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2589","kind":"arxiv","version":3},"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:05176fbe7120fb4d2b893b43bb7b60444eb39023c96f0a44dbb64748373e1531","target":"record","created_at":"2026-05-18T00:43:45Z","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":"6fa85bc27744abe2715860081fb0695d2c91bee256f8045315c22aeee6ba72b1","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T18:14:42Z","title_canon_sha256":"729724ce931b3d4d2414aa037519edd96f1a238f882942edeb18aee8ec160cbe"},"schema_version":"1.0","source":{"id":"1402.2589","kind":"arxiv","version":3}},"canonical_sha256":"70e41463f4df9b0536f079135053772aefa40f77661bebb72ef7af6e94b6f7c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70e41463f4df9b0536f079135053772aefa40f77661bebb72ef7af6e94b6f7c3","first_computed_at":"2026-05-18T00:43:45.616240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:45.616240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"933ATfR1a4b//Ho+VFbGq9YDAyeEsX4jqRuUSWejica7OW04Fh/ZX+WvaiVhAeWuSvH0Z/RXoIP1p1nRnxQoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:45.616808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2589","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05176fbe7120fb4d2b893b43bb7b60444eb39023c96f0a44dbb64748373e1531","sha256:9c49d220bbdcb0c3d192d857faf72218b4981546e728890e5e053db116e88bc4"],"state_sha256":"e5bd1b0c9e2a5b27877af72c36787e4ee467b8b1688432ccc04da5ce5a0b2030"}