{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:B47MMXAS4SX6CKEJYPNSTJ43AD","short_pith_number":"pith:B47MMXAS","schema_version":"1.0","canonical_sha256":"0f3ec65c12e4afe12889c3db29a79b00df09870f935f159c87cc52fb267ed595","source":{"kind":"arxiv","id":"1111.0867","version":1},"attestation_state":"computed","paper":{"title":"The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Feng-Ren Tsai, Sheung-Hung Poon, Ton Kloks, Yue-Li Wang","submitted_at":"2011-11-03T15:01:07Z","abstract_excerpt":"Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to cographs, distance-hereditary graphs, interval graphs and strongly chordal graphs. We show that the problem is NP-complete on splitgraphs."},"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":"1111.0867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-03T15:01:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"86f52e3d4277fd877bf77f4ef8bde8b9f6ad467f39f673297c1498b44bbd2389","abstract_canon_sha256":"00fbd5bf237761bbff0cf1e3b138443ab31255e0f02817ab000d986a71464c5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:36.081391Z","signature_b64":"OQ+mwFfKrErlLHccfmDY8EiBwKspzgBUUkALpsA5Hf73JaVGb7FXzk/dtotjwZ3IufXO3LYV+SlAcNk0MlNgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f3ec65c12e4afe12889c3db29a79b00df09870f935f159c87cc52fb267ed595","last_reissued_at":"2026-05-18T04:09:36.080864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:36.080864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Feng-Ren Tsai, Sheung-Hung Poon, Ton Kloks, Yue-Li Wang","submitted_at":"2011-11-03T15:01:07Z","abstract_excerpt":"Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to cographs, distance-hereditary graphs, interval graphs and strongly chordal graphs. We show that the problem is NP-complete on splitgraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0867","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":"1111.0867","created_at":"2026-05-18T04:09:36.080954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0867v1","created_at":"2026-05-18T04:09:36.080954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0867","created_at":"2026-05-18T04:09:36.080954+00:00"},{"alias_kind":"pith_short_12","alias_value":"B47MMXAS4SX6","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B47MMXAS4SX6CKEJ","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B47MMXAS","created_at":"2026-05-18T12:26:24.575870+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/B47MMXAS4SX6CKEJYPNSTJ43AD","json":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD.json","graph_json":"https://pith.science/api/pith-number/B47MMXAS4SX6CKEJYPNSTJ43AD/graph.json","events_json":"https://pith.science/api/pith-number/B47MMXAS4SX6CKEJYPNSTJ43AD/events.json","paper":"https://pith.science/paper/B47MMXAS"},"agent_actions":{"view_html":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD","download_json":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD.json","view_paper":"https://pith.science/paper/B47MMXAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0867&json=true","fetch_graph":"https://pith.science/api/pith-number/B47MMXAS4SX6CKEJYPNSTJ43AD/graph.json","fetch_events":"https://pith.science/api/pith-number/B47MMXAS4SX6CKEJYPNSTJ43AD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD/action/storage_attestation","attest_author":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD/action/author_attestation","sign_citation":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD/action/citation_signature","submit_replication":"https://pith.science/pith/B47MMXAS4SX6CKEJYPNSTJ43AD/action/replication_record"}},"created_at":"2026-05-18T04:09:36.080954+00:00","updated_at":"2026-05-18T04:09:36.080954+00:00"}