{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XT7AICRD3B6DPXYQ6VVZKMDNSR","short_pith_number":"pith:XT7AICRD","schema_version":"1.0","canonical_sha256":"bcfe040a23d87c37df10f56b95306d945b593b5a4c43c754dc92c8622db1111f","source":{"kind":"arxiv","id":"1602.05838","version":1},"attestation_state":"computed","paper":{"title":"Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca","submitted_at":"2016-02-18T15:25:55Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) problem is a well-known NP-hard problem. For graphs $G_1, G_2$, $G_1+G_2$ denotes the disjoint union of $G_1$ and $G_2$, and for a constant $l \\ge 2$, $lG$ denotes the disjoint union of $l$ copies of $G$. A {\\em claw} has vertices $a,b,c,d$, and edges $ab,ac,ad$. MWIS can be solved for claw-free graphs in polynomial time; the first two polynomial time algorithms were introduced in 1980 by \\cite{Minty1980,Sbihi1980}, then revisited by \\cite{NakTam2001}, and recently improved by \\cite{FaeOriSta2011,FaeOriSta2014}, and by \\cite{NobSas2011,NobSas2015} with"},"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":"1602.05838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-18T15:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"9a71208d5ab843c37f08c4b27f57dde5031de030bb4b7ca279158456eed980c5","abstract_canon_sha256":"707a383c9dc9b9be85b244c2409c81dcb37c98f4a07ae19ac683472c4f1c4d42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:23.089438Z","signature_b64":"p0haioRhYdFBWN1VIHTf5AdTU19z/Md/ZY+ZTjv1l1mEhSFJORjQsOQD18LYSFYh9wl5QqXvsZ9YkJdF3Gb3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcfe040a23d87c37df10f56b95306d945b593b5a4c43c754dc92c8622db1111f","last_reissued_at":"2026-05-18T01:20:23.088703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:23.088703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca","submitted_at":"2016-02-18T15:25:55Z","abstract_excerpt":"The Maximum Weight Independent Set (MWIS) problem is a well-known NP-hard problem. For graphs $G_1, G_2$, $G_1+G_2$ denotes the disjoint union of $G_1$ and $G_2$, and for a constant $l \\ge 2$, $lG$ denotes the disjoint union of $l$ copies of $G$. A {\\em claw} has vertices $a,b,c,d$, and edges $ab,ac,ad$. MWIS can be solved for claw-free graphs in polynomial time; the first two polynomial time algorithms were introduced in 1980 by \\cite{Minty1980,Sbihi1980}, then revisited by \\cite{NakTam2001}, and recently improved by \\cite{FaeOriSta2011,FaeOriSta2014}, and by \\cite{NobSas2011,NobSas2015} with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05838","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":"1602.05838","created_at":"2026-05-18T01:20:23.088801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05838v1","created_at":"2026-05-18T01:20:23.088801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05838","created_at":"2026-05-18T01:20:23.088801+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT7AICRD3B6D","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT7AICRD3B6DPXYQ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT7AICRD","created_at":"2026-05-18T12:30:51.357362+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/XT7AICRD3B6DPXYQ6VVZKMDNSR","json":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR.json","graph_json":"https://pith.science/api/pith-number/XT7AICRD3B6DPXYQ6VVZKMDNSR/graph.json","events_json":"https://pith.science/api/pith-number/XT7AICRD3B6DPXYQ6VVZKMDNSR/events.json","paper":"https://pith.science/paper/XT7AICRD"},"agent_actions":{"view_html":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR","download_json":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR.json","view_paper":"https://pith.science/paper/XT7AICRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05838&json=true","fetch_graph":"https://pith.science/api/pith-number/XT7AICRD3B6DPXYQ6VVZKMDNSR/graph.json","fetch_events":"https://pith.science/api/pith-number/XT7AICRD3B6DPXYQ6VVZKMDNSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR/action/storage_attestation","attest_author":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR/action/author_attestation","sign_citation":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR/action/citation_signature","submit_replication":"https://pith.science/pith/XT7AICRD3B6DPXYQ6VVZKMDNSR/action/replication_record"}},"created_at":"2026-05-18T01:20:23.088801+00:00","updated_at":"2026-05-18T01:20:23.088801+00:00"}