{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3WN5W4WSGUB7W5ZTYDVZM7KEG7","short_pith_number":"pith:3WN5W4WS","schema_version":"1.0","canonical_sha256":"dd9bdb72d23503fb7733c0eb967d4437d6e202f07696f1e5174fa3f2eee5a101","source":{"kind":"arxiv","id":"1702.04322","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Christian Komusiewicz, Erik Jan van Leeuwen, Iyad Kanj, Manuel Sorge","submitted_at":"2017-02-14T18:21:28Z","abstract_excerpt":"A graph $G$ is a $(\\Pi_A,\\Pi_B)$-graph if $V(G)$ can be bipartitioned into $A$ and $B$ such that $G[A]$ satisfies property $\\Pi_A$ and $G[B]$ satisfies property $\\Pi_B$. The $(\\Pi_{A},\\Pi_{B})$-Recognition problem is to recognize whether a given graph is a $(\\Pi_A,\\Pi_B)$-graph. There are many $(\\Pi_{A},\\Pi_{B})$-Recognition problems, including the recognition problems for bipartite, split, and unipolar graphs. We present efficient algorithms for many cases of $(\\Pi_A,\\Pi_B)$-Recognition based on a technique which we dub inductive recognition. In particular, we give fixed-parameter algorithms "},"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":"1702.04322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-14T18:21:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"476ef7849bccd3944e3564f9df96d6f010e3f4d18cbc7a5252e2c559357c741d","abstract_canon_sha256":"1ae4045f3211a80d459f417887e7af765ecfb3c44245e795cef6a751cd92a3f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:46.486884Z","signature_b64":"434/6RdWbZ0yi12nJOiUWOtcDWJCG12ZbyHhut58LHKqQ4wlBl41kYsfam4KyuHubnL/zTR9NeVcfOPR7/LQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd9bdb72d23503fb7733c0eb967d4437d6e202f07696f1e5174fa3f2eee5a101","last_reissued_at":"2026-05-18T00:26:46.486303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:46.486303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Christian Komusiewicz, Erik Jan van Leeuwen, Iyad Kanj, Manuel Sorge","submitted_at":"2017-02-14T18:21:28Z","abstract_excerpt":"A graph $G$ is a $(\\Pi_A,\\Pi_B)$-graph if $V(G)$ can be bipartitioned into $A$ and $B$ such that $G[A]$ satisfies property $\\Pi_A$ and $G[B]$ satisfies property $\\Pi_B$. The $(\\Pi_{A},\\Pi_{B})$-Recognition problem is to recognize whether a given graph is a $(\\Pi_A,\\Pi_B)$-graph. There are many $(\\Pi_{A},\\Pi_{B})$-Recognition problems, including the recognition problems for bipartite, split, and unipolar graphs. We present efficient algorithms for many cases of $(\\Pi_A,\\Pi_B)$-Recognition based on a technique which we dub inductive recognition. In particular, we give fixed-parameter algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04322","kind":"arxiv","version":2},"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":"1702.04322","created_at":"2026-05-18T00:26:46.486415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04322v2","created_at":"2026-05-18T00:26:46.486415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04322","created_at":"2026-05-18T00:26:46.486415+00:00"},{"alias_kind":"pith_short_12","alias_value":"3WN5W4WSGUB7","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3WN5W4WSGUB7W5ZT","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3WN5W4WS","created_at":"2026-05-18T12:30:58.224056+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/3WN5W4WSGUB7W5ZTYDVZM7KEG7","json":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7.json","graph_json":"https://pith.science/api/pith-number/3WN5W4WSGUB7W5ZTYDVZM7KEG7/graph.json","events_json":"https://pith.science/api/pith-number/3WN5W4WSGUB7W5ZTYDVZM7KEG7/events.json","paper":"https://pith.science/paper/3WN5W4WS"},"agent_actions":{"view_html":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7","download_json":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7.json","view_paper":"https://pith.science/paper/3WN5W4WS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04322&json=true","fetch_graph":"https://pith.science/api/pith-number/3WN5W4WSGUB7W5ZTYDVZM7KEG7/graph.json","fetch_events":"https://pith.science/api/pith-number/3WN5W4WSGUB7W5ZTYDVZM7KEG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/action/storage_attestation","attest_author":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/action/author_attestation","sign_citation":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/action/citation_signature","submit_replication":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/action/replication_record"}},"created_at":"2026-05-18T00:26:46.486415+00:00","updated_at":"2026-05-18T00:26:46.486415+00:00"}