{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AV4LSLNVTIPH6FJQ624DQRBKIN","short_pith_number":"pith:AV4LSLNV","schema_version":"1.0","canonical_sha256":"0578b92db59a1e7f1530f6b838442a434eeff01fa2045e4d928c9387546dc0b5","source":{"kind":"arxiv","id":"2106.03555","version":1},"attestation_state":"computed","paper":{"title":"The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meike Neuwohner","submitted_at":"2021-06-07T12:35:29Z","abstract_excerpt":"We consider the Maximum Weight Independent Set Problem (MWIS) in $d$-claw free graphs, i.e. the task of computing an independent set of maximum weight in a given $d$-claw free graph $G=(V,E)$ equipped with a positive weight function $w:V\\rightarrow\\mathbb{R}_{>0}$. For $k\\geq 1$, the MWIS in $k+1$-claw free graphs generalizes the weighted $k$-Set Packing Problem. Given that for $k\\geq 3$, this problem does not permit a polynomial time $o(\\frac{k}{\\log k})$-approximation unless $P=NP$, most previous algorithms for both weighted $k$-Set Packing and the MWIS in $d$-claw free graphs rely on local "},"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":"2106.03555","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-06-07T12:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"880fbc6988ff40c2b655fa67a94c24577065f3cfce773527858644c121565440","abstract_canon_sha256":"9a773edea83a9fef29ceee13a1d7b7fb0ec0b4b6e61391ee669a295135491fd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:50.933852Z","signature_b64":"s95vyfFcwKM/LsCyyIcC1crRRMA71Pjt0qANqaFc7La5v+HUbIoo2sm+uqNQ61lMgdgfLFgWPWzhPRXfBjMfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0578b92db59a1e7f1530f6b838442a434eeff01fa2045e4d928c9387546dc0b5","last_reissued_at":"2026-07-05T02:46:50.933252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:50.933252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meike Neuwohner","submitted_at":"2021-06-07T12:35:29Z","abstract_excerpt":"We consider the Maximum Weight Independent Set Problem (MWIS) in $d$-claw free graphs, i.e. the task of computing an independent set of maximum weight in a given $d$-claw free graph $G=(V,E)$ equipped with a positive weight function $w:V\\rightarrow\\mathbb{R}_{>0}$. For $k\\geq 1$, the MWIS in $k+1$-claw free graphs generalizes the weighted $k$-Set Packing Problem. Given that for $k\\geq 3$, this problem does not permit a polynomial time $o(\\frac{k}{\\log k})$-approximation unless $P=NP$, most previous algorithms for both weighted $k$-Set Packing and the MWIS in $d$-claw free graphs rely on local "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03555","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.03555/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.03555","created_at":"2026-07-05T02:46:50.933310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.03555v1","created_at":"2026-07-05T02:46:50.933310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03555","created_at":"2026-07-05T02:46:50.933310+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV4LSLNVTIPH","created_at":"2026-07-05T02:46:50.933310+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV4LSLNVTIPH6FJQ","created_at":"2026-07-05T02:46:50.933310+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV4LSLNV","created_at":"2026-07-05T02:46:50.933310+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.22976","citing_title":"Efficient Parallel Algorithms for Hypergraph Matching","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN","json":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN.json","graph_json":"https://pith.science/api/pith-number/AV4LSLNVTIPH6FJQ624DQRBKIN/graph.json","events_json":"https://pith.science/api/pith-number/AV4LSLNVTIPH6FJQ624DQRBKIN/events.json","paper":"https://pith.science/paper/AV4LSLNV"},"agent_actions":{"view_html":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN","download_json":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN.json","view_paper":"https://pith.science/paper/AV4LSLNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.03555&json=true","fetch_graph":"https://pith.science/api/pith-number/AV4LSLNVTIPH6FJQ624DQRBKIN/graph.json","fetch_events":"https://pith.science/api/pith-number/AV4LSLNVTIPH6FJQ624DQRBKIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN/action/storage_attestation","attest_author":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN/action/author_attestation","sign_citation":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN/action/citation_signature","submit_replication":"https://pith.science/pith/AV4LSLNVTIPH6FJQ624DQRBKIN/action/replication_record"}},"created_at":"2026-07-05T02:46:50.933310+00:00","updated_at":"2026-07-05T02:46:50.933310+00:00"}