{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3WN5W4WSGUB7W5ZTYDVZM7KEG7","short_pith_number":"pith:3WN5W4WS","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"},"canonical_sha256":"dd9bdb72d23503fb7733c0eb967d4437d6e202f07696f1e5174fa3f2eee5a101","source":{"kind":"arxiv","id":"1702.04322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04322","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04322v2","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04322","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"3WN5W4WSGUB7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3WN5W4WSGUB7W5ZT","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3WN5W4WS","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3WN5W4WSGUB7W5ZTYDVZM7KEG7","target":"record","payload":{"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"},"canonical_sha256":"dd9bdb72d23503fb7733c0eb967d4437d6e202f07696f1e5174fa3f2eee5a101","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"},"source_kind":"arxiv","source_id":"1702.04322","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eU/Ke6PiQk8poM2Gv0wdhwux+QdrZZWKQlpbzNL7aQR8uOuteQs2N3j2GU4pvmDBdAd4JEQC55OvnL+MMcSmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:30:43.920300Z"},"content_sha256":"aafb7618894162397ba39de37d10c37ea303440f8d7637fbf3c2a9d23fdd951e","schema_version":"1.0","event_id":"sha256:aafb7618894162397ba39de37d10c37ea303440f8d7637fbf3c2a9d23fdd951e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3WN5W4WSGUB7W5ZTYDVZM7KEG7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEk0on7MUqKODqtZvmlPSeLHC01VcWIrEocf9OoYmqWPD98Ng6RrZKPRX5E6ASW/r6v1tmx+u0yx+4D1qrRpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:30:43.920669Z"},"content_sha256":"c5b9a1cf779c1422600d37782527c51a3406a4b56562fa64a5062ede57a5ef7d","schema_version":"1.0","event_id":"sha256:c5b9a1cf779c1422600d37782527c51a3406a4b56562fa64a5062ede57a5ef7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/bundle.json","state_url":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:30:43Z","links":{"resolver":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7","bundle":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/bundle.json","state":"https://pith.science/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WN5W4WSGUB7W5ZTYDVZM7KEG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3WN5W4WSGUB7W5ZTYDVZM7KEG7","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":"1ae4045f3211a80d459f417887e7af765ecfb3c44245e795cef6a751cd92a3f2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-14T18:21:28Z","title_canon_sha256":"476ef7849bccd3944e3564f9df96d6f010e3f4d18cbc7a5252e2c559357c741d"},"schema_version":"1.0","source":{"id":"1702.04322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04322","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04322v2","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04322","created_at":"2026-05-18T00:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"3WN5W4WSGUB7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3WN5W4WSGUB7W5ZT","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3WN5W4WS","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:c5b9a1cf779c1422600d37782527c51a3406a4b56562fa64a5062ede57a5ef7d","target":"graph","created_at":"2026-05-18T00:26:46Z","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":"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 ","authors_text":"Christian Komusiewicz, Erik Jan van Leeuwen, Iyad Kanj, Manuel Sorge","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-14T18:21:28Z","title":"Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04322","kind":"arxiv","version":2},"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:aafb7618894162397ba39de37d10c37ea303440f8d7637fbf3c2a9d23fdd951e","target":"record","created_at":"2026-05-18T00:26:46Z","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":"1ae4045f3211a80d459f417887e7af765ecfb3c44245e795cef6a751cd92a3f2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-14T18:21:28Z","title_canon_sha256":"476ef7849bccd3944e3564f9df96d6f010e3f4d18cbc7a5252e2c559357c741d"},"schema_version":"1.0","source":{"id":"1702.04322","kind":"arxiv","version":2}},"canonical_sha256":"dd9bdb72d23503fb7733c0eb967d4437d6e202f07696f1e5174fa3f2eee5a101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd9bdb72d23503fb7733c0eb967d4437d6e202f07696f1e5174fa3f2eee5a101","first_computed_at":"2026-05-18T00:26:46.486303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:46.486303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"434/6RdWbZ0yi12nJOiUWOtcDWJCG12ZbyHhut58LHKqQ4wlBl41kYsfam4KyuHubnL/zTR9NeVcfOPR7/LQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:46.486884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aafb7618894162397ba39de37d10c37ea303440f8d7637fbf3c2a9d23fdd951e","sha256:c5b9a1cf779c1422600d37782527c51a3406a4b56562fa64a5062ede57a5ef7d"],"state_sha256":"42474884f9f18769d55275433e2db78bddd5c1af6a18c4dcfe69f3e4cfb7df29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VO/oyw6T//RQvakCQZ5RnEe+zcF2uln92tpFR3NRuEkrlXxa7j9rZi/Xkrnakw49zKTEry1amsNipMvv+NrWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:30:43.922619Z","bundle_sha256":"dbf056f1342da358c37dd05ece298d8dc198d266b9ea014476286cbc45d60c26"}}