{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VROVUFTI72UP63NJ43M3DPFQFZ","short_pith_number":"pith:VROVUFTI","schema_version":"1.0","canonical_sha256":"ac5d5a1668fea8ff6da9e6d9b1bcb02e7ed18090bc0cbc74321afcdab67c24aa","source":{"kind":"arxiv","id":"2302.10643","version":2},"attestation_state":"computed","paper":{"title":"New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Igor Razgon, Tuukka Korhonen","submitted_at":"2023-02-21T13:01:48Z","abstract_excerpt":"We study the tractability of the maximum independent set problem from the viewpoint of graph width parameters, with the goal of defining a width parameter that is as general as possible and allows to solve independent set in polynomial-time on graphs where the parameter is bounded. We introduce two new graph width parameters: one-sided maximum induced matching-width (o-mim-width) and neighbor-depth. O-mim-width is a graph parameter that is more general than the known parameters mim-width and tree-independence number, and we show that independent set and feedback vertex set can be solved in pol"},"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":"2302.10643","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-02-21T13:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"4036fe2ad6fddcbae663e72bacd969ddf55c3dd7ef964c1a36e99375dbd1ce2b","abstract_canon_sha256":"e478a8e44a257a449d5195c63e2fa20494ab0a972c0eb7803340c21bda48106a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:48.592786Z","signature_b64":"MdUcps8bLq1or6xoexOSeVKd25VCgqaaMWsCQqffAgcoeRwXvV46Pi1Bk4jNy0NTAde703+0AHLsXcC2NBErBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5d5a1668fea8ff6da9e6d9b1bcb02e7ed18090bc0cbc74321afcdab67c24aa","last_reissued_at":"2026-07-05T06:35:48.592351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:48.592351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Igor Razgon, Tuukka Korhonen","submitted_at":"2023-02-21T13:01:48Z","abstract_excerpt":"We study the tractability of the maximum independent set problem from the viewpoint of graph width parameters, with the goal of defining a width parameter that is as general as possible and allows to solve independent set in polynomial-time on graphs where the parameter is bounded. We introduce two new graph width parameters: one-sided maximum induced matching-width (o-mim-width) and neighbor-depth. O-mim-width is a graph parameter that is more general than the known parameters mim-width and tree-independence number, and we show that independent set and feedback vertex set can be solved in pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10643","kind":"arxiv","version":2},"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/2302.10643/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":"2302.10643","created_at":"2026-07-05T06:35:48.592399+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10643v2","created_at":"2026-07-05T06:35:48.592399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10643","created_at":"2026-07-05T06:35:48.592399+00:00"},{"alias_kind":"pith_short_12","alias_value":"VROVUFTI72UP","created_at":"2026-07-05T06:35:48.592399+00:00"},{"alias_kind":"pith_short_16","alias_value":"VROVUFTI72UP63NJ","created_at":"2026-07-05T06:35:48.592399+00:00"},{"alias_kind":"pith_short_8","alias_value":"VROVUFTI","created_at":"2026-07-05T06:35:48.592399+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/VROVUFTI72UP63NJ43M3DPFQFZ","json":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ.json","graph_json":"https://pith.science/api/pith-number/VROVUFTI72UP63NJ43M3DPFQFZ/graph.json","events_json":"https://pith.science/api/pith-number/VROVUFTI72UP63NJ43M3DPFQFZ/events.json","paper":"https://pith.science/paper/VROVUFTI"},"agent_actions":{"view_html":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ","download_json":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ.json","view_paper":"https://pith.science/paper/VROVUFTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10643&json=true","fetch_graph":"https://pith.science/api/pith-number/VROVUFTI72UP63NJ43M3DPFQFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VROVUFTI72UP63NJ43M3DPFQFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ/action/storage_attestation","attest_author":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ/action/author_attestation","sign_citation":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ/action/citation_signature","submit_replication":"https://pith.science/pith/VROVUFTI72UP63NJ43M3DPFQFZ/action/replication_record"}},"created_at":"2026-07-05T06:35:48.592399+00:00","updated_at":"2026-07-05T06:35:48.592399+00:00"}