{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D4R25KOMXV3DOALHZFFU3HZ76K","short_pith_number":"pith:D4R25KOM","schema_version":"1.0","canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","source":{"kind":"arxiv","id":"1209.2512","version":1},"attestation_state":"computed","paper":{"title":"Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","submitted_at":"2012-09-12T07:39:51Z","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. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a chordless cycle of length at least five). By applying clique separator decomposition as well as modular decomposition, we obtain polynomial time solutions of MWIS for odd-hole- and dart-free graphs as well"},"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":"1209.2512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-09-12T07:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"ae5dcdc90d08c1ceb3a7d0cd1f18805c8a37253ab9fdf5a9f8899192a8855dc7","abstract_canon_sha256":"fe1ed72aacd8d814a339075e7a6cdbc167b89f92815f0aaac5c6dfd6b85cb476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:42.933559Z","signature_b64":"QsSn4PhWL/xDxqyAbym1jxTL6D+5hCX7DH+4ASZyDdJF11DoLoUcmTuigj8UukQrDTPqevwq17YHuAyz2N8+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f23aea9ccbd76370167c94b4d9f3ff2aba1f0df799771004341dd88acd94f5e","last_reissued_at":"2026-05-18T03:45:42.932776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:42.932776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","submitted_at":"2012-09-12T07:39:51Z","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. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a chordless cycle of length at least five). By applying clique separator decomposition as well as modular decomposition, we obtain polynomial time solutions of MWIS for odd-hole- and dart-free graphs as well"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2512","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":"1209.2512","created_at":"2026-05-18T03:45:42.932879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2512v1","created_at":"2026-05-18T03:45:42.932879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2512","created_at":"2026-05-18T03:45:42.932879+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4R25KOMXV3D","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4R25KOMXV3DOALH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4R25KOM","created_at":"2026-05-18T12:27:01.376967+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/D4R25KOMXV3DOALHZFFU3HZ76K","json":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K.json","graph_json":"https://pith.science/api/pith-number/D4R25KOMXV3DOALHZFFU3HZ76K/graph.json","events_json":"https://pith.science/api/pith-number/D4R25KOMXV3DOALHZFFU3HZ76K/events.json","paper":"https://pith.science/paper/D4R25KOM"},"agent_actions":{"view_html":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K","download_json":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K.json","view_paper":"https://pith.science/paper/D4R25KOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2512&json=true","fetch_graph":"https://pith.science/api/pith-number/D4R25KOMXV3DOALHZFFU3HZ76K/graph.json","fetch_events":"https://pith.science/api/pith-number/D4R25KOMXV3DOALHZFFU3HZ76K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/action/storage_attestation","attest_author":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/action/author_attestation","sign_citation":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/action/citation_signature","submit_replication":"https://pith.science/pith/D4R25KOMXV3DOALHZFFU3HZ76K/action/replication_record"}},"created_at":"2026-05-18T03:45:42.932879+00:00","updated_at":"2026-05-18T03:45:42.932879+00:00"}