{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HV46RBEGYLL7QMGSUYEILKA43S","short_pith_number":"pith:HV46RBEG","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"},"canonical_sha256":"3d79e88486c2d7f830d2a60885a81cdc8e52309fe432843c90496dc6c657db9c","source":{"kind":"arxiv","id":"2308.15635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15635","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15635v1","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15635","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"HV46RBEGYLL7","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"pith_short_16","alias_value":"HV46RBEGYLL7QMGS","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"pith_short_8","alias_value":"HV46RBEG","created_at":"2026-07-05T06:46:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HV46RBEGYLL7QMGSUYEILKA43S","target":"record","payload":{"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"},"canonical_sha256":"3d79e88486c2d7f830d2a60885a81cdc8e52309fe432843c90496dc6c657db9c","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"},"source_kind":"arxiv","source_id":"2308.15635","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjNzV8R01q9bIzBLPO+Mq9rYTVNuKHVdXqbsjZX+ebSZ18gndw58ZyuWwIBuSGI1j4ZSC/+tylTb1PUHPOKzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:44:04.069059Z"},"content_sha256":"41ce0c5f20864c0d0fdc97440e021690ac7c1b41ff8a15f65395380d0ee2b547","schema_version":"1.0","event_id":"sha256:41ce0c5f20864c0d0fdc97440e021690ac7c1b41ff8a15f65395380d0ee2b547"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HV46RBEGYLL7QMGSUYEILKA43S","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdNYQ+o9do4MYsJSr7IYY8pR8zzj+ogdPe4zdfQ4H55UzTyanZrEXDYsaDkTXlBiUsuSoL3Y9333EIAhVmG6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:44:04.069874Z"},"content_sha256":"fa31b468ecf96789831ba96e618c13d66a4e13e974251ebbb56d80c8f0f57fd8","schema_version":"1.0","event_id":"sha256:fa31b468ecf96789831ba96e618c13d66a4e13e974251ebbb56d80c8f0f57fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/bundle.json","state_url":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HV46RBEGYLL7QMGSUYEILKA43S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T12:44:04Z","links":{"resolver":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S","bundle":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/bundle.json","state":"https://pith.science/pith/HV46RBEGYLL7QMGSUYEILKA43S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HV46RBEGYLL7QMGSUYEILKA43S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HV46RBEGYLL7QMGSUYEILKA43S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"67d45737cfef6b099c80d775afca7a44cb7f7f6d7aab855edc0dc816f19c4a1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T21:01:31Z","title_canon_sha256":"116b73222ee93ea6c6872310d68f741d95af592bed94b5f35a4a5f63e4d9c454"},"schema_version":"1.0","source":{"id":"2308.15635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15635","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15635v1","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15635","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"HV46RBEGYLL7","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"pith_short_16","alias_value":"HV46RBEGYLL7QMGS","created_at":"2026-07-05T06:46:11Z"},{"alias_kind":"pith_short_8","alias_value":"HV46RBEG","created_at":"2026-07-05T06:46:11Z"}],"graph_snapshots":[{"event_id":"sha256:fa31b468ecf96789831ba96e618c13d66a4e13e974251ebbb56d80c8f0f57fd8","target":"graph","created_at":"2026-07-05T06:46:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.15635/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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) ","authors_text":"Fedor V. Fomin, Marie Diana Sieper, Petr A. Golovach, Stephen Kobourov, Tanmay Inamdar, Walter Didimo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T21:01:31Z","title":"Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15635","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:41ce0c5f20864c0d0fdc97440e021690ac7c1b41ff8a15f65395380d0ee2b547","target":"record","created_at":"2026-07-05T06:46:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"67d45737cfef6b099c80d775afca7a44cb7f7f6d7aab855edc0dc816f19c4a1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T21:01:31Z","title_canon_sha256":"116b73222ee93ea6c6872310d68f741d95af592bed94b5f35a4a5f63e4d9c454"},"schema_version":"1.0","source":{"id":"2308.15635","kind":"arxiv","version":1}},"canonical_sha256":"3d79e88486c2d7f830d2a60885a81cdc8e52309fe432843c90496dc6c657db9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d79e88486c2d7f830d2a60885a81cdc8e52309fe432843c90496dc6c657db9c","first_computed_at":"2026-07-05T06:46:11.062443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:46:11.062443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RfmcC/4CzfWiA6tz608jUlmc/NrU3SwpKdsyWRbz3bLM8yZR7iJDGz6/vGNko/pt3D9hx3uM1PqfrM1T5s0MBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:46:11.062862Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.15635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41ce0c5f20864c0d0fdc97440e021690ac7c1b41ff8a15f65395380d0ee2b547","sha256:fa31b468ecf96789831ba96e618c13d66a4e13e974251ebbb56d80c8f0f57fd8"],"state_sha256":"adac936cef59ca5605f07ddcf3514417dea3530d71bd9327e6c973bc4287deaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7M02UYQc2GNUi4jV4xLqPoBYDvXWA/esI+Bj6NqJ9mgdqIyVQt3Plhjg/VM4PaBXkUbB8/t8VFlZIGUPGzQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:44:04.075409Z","bundle_sha256":"fba3e9f6724c1facdfc71be0b4b036bb71f26adadea95edd3f0bcdbddc357bfc"}}