{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZZSE2OLVF5NCEKMYGDGHFIXA7N","short_pith_number":"pith:ZZSE2OLV","schema_version":"1.0","canonical_sha256":"ce644d39752f5a22299830cc72a2e0fb542e59b38df5837baf9607bed9cb7fb9","source":{"kind":"arxiv","id":"1603.02011","version":1},"attestation_state":"computed","paper":{"title":"Independent Sets in Classes Related to Chair/Fork-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"T. Karthick","submitted_at":"2016-03-07T11:39:03Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. MWIS is known to be $NP$-complete in general, even under various restrictions. Let $S_{i,j,k}$ be the graph consisting of three induced paths of lengths $i, j, k$ with a common initial vertex. The complexity of the MWIS problem for $S_{1, 2, 2}$-free graphs, and for $S_{1, 1, 3}$-free graphs are open. In this paper, we show that the MWIS problem can solved in polynomial time for ($S_{1, 2, 2}$, $S_{1, 1, 3}$, co-chair)-free graphs, by analyzin"},"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":"1603.02011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T11:39:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a72222635c33bc5d057478910b6a56abb186ffff4dc8c616db9f611ef36b43d5","abstract_canon_sha256":"add2a48ca39d5280dc0fbd485d02ffd453bf4d15a987456cecacd625a8bafd4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:05.015026Z","signature_b64":"YIUAeqK8cx436sAtkO5+Rzm6VRl9KxHvZ0qeKTzZJX4JZ8jBRGiMAMpqqkpKdAB6Va+cBiHAFA/uRpNSvjxuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce644d39752f5a22299830cc72a2e0fb542e59b38df5837baf9607bed9cb7fb9","last_reissued_at":"2026-05-18T01:19:05.014408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:05.014408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent Sets in Classes Related to Chair/Fork-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"T. Karthick","submitted_at":"2016-03-07T11:39:03Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. MWIS is known to be $NP$-complete in general, even under various restrictions. Let $S_{i,j,k}$ be the graph consisting of three induced paths of lengths $i, j, k$ with a common initial vertex. The complexity of the MWIS problem for $S_{1, 2, 2}$-free graphs, and for $S_{1, 1, 3}$-free graphs are open. In this paper, we show that the MWIS problem can solved in polynomial time for ($S_{1, 2, 2}$, $S_{1, 1, 3}$, co-chair)-free graphs, by analyzin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02011","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":"1603.02011","created_at":"2026-05-18T01:19:05.014488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.02011v1","created_at":"2026-05-18T01:19:05.014488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02011","created_at":"2026-05-18T01:19:05.014488+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZSE2OLVF5NC","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZSE2OLVF5NCEKMY","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZSE2OLV","created_at":"2026-05-18T12:30:55.937587+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/ZZSE2OLVF5NCEKMYGDGHFIXA7N","json":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N.json","graph_json":"https://pith.science/api/pith-number/ZZSE2OLVF5NCEKMYGDGHFIXA7N/graph.json","events_json":"https://pith.science/api/pith-number/ZZSE2OLVF5NCEKMYGDGHFIXA7N/events.json","paper":"https://pith.science/paper/ZZSE2OLV"},"agent_actions":{"view_html":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N","download_json":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N.json","view_paper":"https://pith.science/paper/ZZSE2OLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.02011&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZSE2OLVF5NCEKMYGDGHFIXA7N/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZSE2OLVF5NCEKMYGDGHFIXA7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/action/storage_attestation","attest_author":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/action/author_attestation","sign_citation":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/action/citation_signature","submit_replication":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/action/replication_record"}},"created_at":"2026-05-18T01:19:05.014488+00:00","updated_at":"2026-05-18T01:19:05.014488+00:00"}