{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HV46RBEGYLL7QMGSUYEILKA43S","short_pith_number":"pith:HV46RBEG","schema_version":"1.0","canonical_sha256":"3d79e88486c2d7f830d2a60885a81cdc8e52309fe432843c90496dc6c657db9c","source":{"kind":"arxiv","id":"2308.15635","version":1},"attestation_state":"computed","paper":{"title":"Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Marie Diana Sieper, Petr A. Golovach, Stephen Kobourov, Tanmay Inamdar, Walter Didimo","submitted_at":"2023-08-29T21:01:31Z","abstract_excerpt":"A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of many types of graph layouts, such as upward drawings, level-planar drawings, and L-drawings. If the graph is not bimodal, the Maximum Bimodal Subgraph (MBS) problem asks for an embedding-preserving bimodal subgraph with the maximum number of edges. We initiate the study of the MBS problem from the parameterized complexity perspective with two main results: (i) "},"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":"2308.15635","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T21:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"116b73222ee93ea6c6872310d68f741d95af592bed94b5f35a4a5f63e4d9c454","abstract_canon_sha256":"67d45737cfef6b099c80d775afca7a44cb7f7f6d7aab855edc0dc816f19c4a1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:11.062862Z","signature_b64":"RfmcC/4CzfWiA6tz608jUlmc/NrU3SwpKdsyWRbz3bLM8yZR7iJDGz6/vGNko/pt3D9hx3uM1PqfrM1T5s0MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d79e88486c2d7f830d2a60885a81cdc8e52309fe432843c90496dc6c657db9c","last_reissued_at":"2026-07-05T06:46:11.062443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:11.062443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Marie Diana Sieper, Petr A. Golovach, Stephen Kobourov, Tanmay Inamdar, Walter Didimo","submitted_at":"2023-08-29T21:01:31Z","abstract_excerpt":"A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of many types of graph layouts, such as upward drawings, level-planar drawings, and L-drawings. If the graph is not bimodal, the Maximum Bimodal Subgraph (MBS) problem asks for an embedding-preserving bimodal subgraph with the maximum number of edges. We initiate the study of the MBS problem from the parameterized complexity perspective with two main results: (i) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15635","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/2308.15635/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":"2308.15635","created_at":"2026-07-05T06:46:11.062504+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.15635v1","created_at":"2026-07-05T06:46:11.062504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15635","created_at":"2026-07-05T06:46:11.062504+00:00"},{"alias_kind":"pith_short_12","alias_value":"HV46RBEGYLL7","created_at":"2026-07-05T06:46:11.062504+00:00"},{"alias_kind":"pith_short_16","alias_value":"HV46RBEGYLL7QMGS","created_at":"2026-07-05T06:46:11.062504+00:00"},{"alias_kind":"pith_short_8","alias_value":"HV46RBEG","created_at":"2026-07-05T06:46:11.062504+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/HV46RBEGYLL7QMGSUYEILKA43S","json":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S.json","graph_json":"https://pith.science/api/pith-number/HV46RBEGYLL7QMGSUYEILKA43S/graph.json","events_json":"https://pith.science/api/pith-number/HV46RBEGYLL7QMGSUYEILKA43S/events.json","paper":"https://pith.science/paper/HV46RBEG"},"agent_actions":{"view_html":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S","download_json":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S.json","view_paper":"https://pith.science/paper/HV46RBEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.15635&json=true","fetch_graph":"https://pith.science/api/pith-number/HV46RBEGYLL7QMGSUYEILKA43S/graph.json","fetch_events":"https://pith.science/api/pith-number/HV46RBEGYLL7QMGSUYEILKA43S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/action/storage_attestation","attest_author":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/action/author_attestation","sign_citation":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/action/citation_signature","submit_replication":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/action/replication_record"}},"created_at":"2026-07-05T06:46:11.062504+00:00","updated_at":"2026-07-05T06:46:11.062504+00:00"}