{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZZSE2OLVF5NCEKMYGDGHFIXA7N","short_pith_number":"pith:ZZSE2OLV","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"},"canonical_sha256":"ce644d39752f5a22299830cc72a2e0fb542e59b38df5837baf9607bed9cb7fb9","source":{"kind":"arxiv","id":"1603.02011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02011","created_at":"2026-05-18T01:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02011v1","created_at":"2026-05-18T01:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02011","created_at":"2026-05-18T01:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZZSE2OLVF5NC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZZSE2OLVF5NCEKMY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZZSE2OLV","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZZSE2OLVF5NCEKMYGDGHFIXA7N","target":"record","payload":{"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"},"canonical_sha256":"ce644d39752f5a22299830cc72a2e0fb542e59b38df5837baf9607bed9cb7fb9","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"},"source_kind":"arxiv","source_id":"1603.02011","source_version":1,"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-18T01:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOXj7RJaFy7Cf4AI5pzMxHc9uz46YDQBzIQ0m+ObT4xB+15BAE0Vz8+nZORaGr1AmX6BjM9E5eNieIEMSV6vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:56:14.400546Z"},"content_sha256":"6ae2b1dbb1e9abca988b6bfc18b271c6aab671739fe2a842c34817a03a4193f1","schema_version":"1.0","event_id":"sha256:6ae2b1dbb1e9abca988b6bfc18b271c6aab671739fe2a842c34817a03a4193f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZZSE2OLVF5NCEKMYGDGHFIXA7N","target":"graph","payload":{"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"},"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-18T01:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"564KOdCdDfx1/KFG4BFSMNG532UDoc1GvSznzrzitraoKpOqmXFs6ft+wlg+hXZW8kRpdPnxf+J7pKgXcS07DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:56:14.400890Z"},"content_sha256":"74309e9dbca5a4fd5f1bb57c5413ff0be546b57a29c28eae3a071a740dc0323b","schema_version":"1.0","event_id":"sha256:74309e9dbca5a4fd5f1bb57c5413ff0be546b57a29c28eae3a071a740dc0323b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/bundle.json","state_url":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/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-31T03:56:14Z","links":{"resolver":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N","bundle":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/bundle.json","state":"https://pith.science/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZSE2OLVF5NCEKMYGDGHFIXA7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZZSE2OLVF5NCEKMYGDGHFIXA7N","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":"add2a48ca39d5280dc0fbd485d02ffd453bf4d15a987456cecacd625a8bafd4a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T11:39:03Z","title_canon_sha256":"a72222635c33bc5d057478910b6a56abb186ffff4dc8c616db9f611ef36b43d5"},"schema_version":"1.0","source":{"id":"1603.02011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02011","created_at":"2026-05-18T01:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02011v1","created_at":"2026-05-18T01:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02011","created_at":"2026-05-18T01:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZZSE2OLVF5NC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZZSE2OLVF5NCEKMY","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZZSE2OLV","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:74309e9dbca5a4fd5f1bb57c5413ff0be546b57a29c28eae3a071a740dc0323b","target":"graph","created_at":"2026-05-18T01:19:05Z","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":"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","authors_text":"T. Karthick","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T11:39:03Z","title":"Independent Sets in Classes Related to Chair/Fork-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02011","kind":"arxiv","version":1},"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:6ae2b1dbb1e9abca988b6bfc18b271c6aab671739fe2a842c34817a03a4193f1","target":"record","created_at":"2026-05-18T01:19:05Z","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":"add2a48ca39d5280dc0fbd485d02ffd453bf4d15a987456cecacd625a8bafd4a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-07T11:39:03Z","title_canon_sha256":"a72222635c33bc5d057478910b6a56abb186ffff4dc8c616db9f611ef36b43d5"},"schema_version":"1.0","source":{"id":"1603.02011","kind":"arxiv","version":1}},"canonical_sha256":"ce644d39752f5a22299830cc72a2e0fb542e59b38df5837baf9607bed9cb7fb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce644d39752f5a22299830cc72a2e0fb542e59b38df5837baf9607bed9cb7fb9","first_computed_at":"2026-05-18T01:19:05.014408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:05.014408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YIUAeqK8cx436sAtkO5+Rzm6VRl9KxHvZ0qeKTzZJX4JZ8jBRGiMAMpqqkpKdAB6Va+cBiHAFA/uRpNSvjxuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:05.015026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ae2b1dbb1e9abca988b6bfc18b271c6aab671739fe2a842c34817a03a4193f1","sha256:74309e9dbca5a4fd5f1bb57c5413ff0be546b57a29c28eae3a071a740dc0323b"],"state_sha256":"6dcb3f0d9c1461acf891e685da95f9740318cdfbbd48cfd7d730de745d0eed7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsJzmxmwX21EvnuXJaQOINFWg5fOIzY02sAiGK5QfzaHwO+gwM93+hSdE10Q7BXNmnbEKcn1CG5ame4kOdPFBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:56:14.402761Z","bundle_sha256":"1a9bb1b5c22ac7e6617a408f94c080a352d0537ee64a491448b7008877df3ffe"}}