{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6ASHII4BCKNUWUIJGY3KFP2LCK","short_pith_number":"pith:6ASHII4B","schema_version":"1.0","canonical_sha256":"f024742381129b4b51093636a2bf4b1280559303b2ae7f19518781ce55328f7c","source":{"kind":"arxiv","id":"2008.09004","version":4},"attestation_state":"computed","paper":{"title":"Solving Problems on Generalized Convex Graphs via Mim-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrea Munaro, Dani\\\"el Paulusma, Flavia Bonomo-Braberman, Nick Brettell","submitted_at":"2020-08-20T14:47:54Z","abstract_excerpt":"A bipartite graph $G=(A,B,E)$ is ${\\cal H}$-convex, for some family of graphs ${\\cal H}$, if there exists a graph $H\\in {\\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\\in B$ induces a connected subgraph of $H$. Many $\\mathsf{NP}$-complete problems, including problems such as Dominating Set, Feedback Vertex Set, Induced Matching and List $k$-Colouring, become polynomial-time solvable for ${\\mathcal H}$-convex graphs when ${\\mathcal H}$ is the set of paths. In this case, the class of ${\\mathcal H}$-convex graphs is known as the class of convex graphs. The underlying rea"},"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":"2008.09004","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-20T14:47:54Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"58022a44ed798c9b94507f656ce34f7f2c876b57cc22be13d3043726d0616aba","abstract_canon_sha256":"5c5f57e0e0f2ca80f96c78a045d3a8bfb48c703c8e9af8c76f9323171851404d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:47.386818Z","signature_b64":"nsszW2hY/THtn7yPRwELnUzchH/w/mXV25Or7/8tRmzPdB9mNbXAiQgzUvop6tCdHGKlmsb62fWQE2TpwKzhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f024742381129b4b51093636a2bf4b1280559303b2ae7f19518781ce55328f7c","last_reissued_at":"2026-07-05T07:40:47.386186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:47.386186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Problems on Generalized Convex Graphs via Mim-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrea Munaro, Dani\\\"el Paulusma, Flavia Bonomo-Braberman, Nick Brettell","submitted_at":"2020-08-20T14:47:54Z","abstract_excerpt":"A bipartite graph $G=(A,B,E)$ is ${\\cal H}$-convex, for some family of graphs ${\\cal H}$, if there exists a graph $H\\in {\\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\\in B$ induces a connected subgraph of $H$. Many $\\mathsf{NP}$-complete problems, including problems such as Dominating Set, Feedback Vertex Set, Induced Matching and List $k$-Colouring, become polynomial-time solvable for ${\\mathcal H}$-convex graphs when ${\\mathcal H}$ is the set of paths. In this case, the class of ${\\mathcal H}$-convex graphs is known as the class of convex graphs. The underlying rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09004","kind":"arxiv","version":4},"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/2008.09004/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":"2008.09004","created_at":"2026-07-05T07:40:47.386290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.09004v4","created_at":"2026-07-05T07:40:47.386290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09004","created_at":"2026-07-05T07:40:47.386290+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ASHII4BCKNU","created_at":"2026-07-05T07:40:47.386290+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ASHII4BCKNUWUIJ","created_at":"2026-07-05T07:40:47.386290+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ASHII4B","created_at":"2026-07-05T07:40:47.386290+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/6ASHII4BCKNUWUIJGY3KFP2LCK","json":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK.json","graph_json":"https://pith.science/api/pith-number/6ASHII4BCKNUWUIJGY3KFP2LCK/graph.json","events_json":"https://pith.science/api/pith-number/6ASHII4BCKNUWUIJGY3KFP2LCK/events.json","paper":"https://pith.science/paper/6ASHII4B"},"agent_actions":{"view_html":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK","download_json":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK.json","view_paper":"https://pith.science/paper/6ASHII4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.09004&json=true","fetch_graph":"https://pith.science/api/pith-number/6ASHII4BCKNUWUIJGY3KFP2LCK/graph.json","fetch_events":"https://pith.science/api/pith-number/6ASHII4BCKNUWUIJGY3KFP2LCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK/action/storage_attestation","attest_author":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK/action/author_attestation","sign_citation":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK/action/citation_signature","submit_replication":"https://pith.science/pith/6ASHII4BCKNUWUIJGY3KFP2LCK/action/replication_record"}},"created_at":"2026-07-05T07:40:47.386290+00:00","updated_at":"2026-07-05T07:40:47.386290+00:00"}