{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JRNQ2FZHFKBE5BFY55SI7PPR3R","short_pith_number":"pith:JRNQ2FZH","schema_version":"1.0","canonical_sha256":"4c5b0d17272a824e84b8ef648fbdf1dc5c499c01c934cb19aeb9c5070db7f7c6","source":{"kind":"arxiv","id":"1201.6421","version":1},"attestation_state":"computed","paper":{"title":"The black-and-white coloring problem on permutation graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ton Kloks","submitted_at":"2012-01-31T02:40:54Z","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 permutation 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":"1201.6421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-31T02:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"89a157219827587d842e14ec5f5c8ddc55bcfce463e82378d74eed19e7e3d79a","abstract_canon_sha256":"1bc8b1b8e1431cd40b855dc229c574475380e88306785c093a52691ff8384768"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:31.558579Z","signature_b64":"AeIvfSSdXGGGk/cAag0EyGCU+7fXyENQVLCFnQJ3ondovEp4hsf81chLZ5Cf1Qtt68ZPwnSBAH9GB7jdCZJxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c5b0d17272a824e84b8ef648fbdf1dc5c499c01c934cb19aeb9c5070db7f7c6","last_reissued_at":"2026-05-18T04:03:31.557771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:31.557771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The black-and-white coloring problem on permutation graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ton Kloks","submitted_at":"2012-01-31T02:40:54Z","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 permutation graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6421","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":"1201.6421","created_at":"2026-05-18T04:03:31.557898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6421v1","created_at":"2026-05-18T04:03:31.557898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6421","created_at":"2026-05-18T04:03:31.557898+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRNQ2FZHFKBE","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRNQ2FZHFKBE5BFY","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRNQ2FZH","created_at":"2026-05-18T12:27:11.947152+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/JRNQ2FZHFKBE5BFY55SI7PPR3R","json":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R.json","graph_json":"https://pith.science/api/pith-number/JRNQ2FZHFKBE5BFY55SI7PPR3R/graph.json","events_json":"https://pith.science/api/pith-number/JRNQ2FZHFKBE5BFY55SI7PPR3R/events.json","paper":"https://pith.science/paper/JRNQ2FZH"},"agent_actions":{"view_html":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R","download_json":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R.json","view_paper":"https://pith.science/paper/JRNQ2FZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6421&json=true","fetch_graph":"https://pith.science/api/pith-number/JRNQ2FZHFKBE5BFY55SI7PPR3R/graph.json","fetch_events":"https://pith.science/api/pith-number/JRNQ2FZHFKBE5BFY55SI7PPR3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R/action/storage_attestation","attest_author":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R/action/author_attestation","sign_citation":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R/action/citation_signature","submit_replication":"https://pith.science/pith/JRNQ2FZHFKBE5BFY55SI7PPR3R/action/replication_record"}},"created_at":"2026-05-18T04:03:31.557898+00:00","updated_at":"2026-05-18T04:03:31.557898+00:00"}