{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TAF5QRRVLWYIECYXEWR7XZZFQF","short_pith_number":"pith:TAF5QRRV","canonical_record":{"source":{"id":"1905.13203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-30T17:46:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"682306248e3dd66c6fcdbfbfe03edba211c0b0a567d419e175b39f1f69b27363","abstract_canon_sha256":"e6a4eb5f864042b7ffc61e916b64106c7ee4b5baae9deeb301075068aad9a23c"},"schema_version":"1.0"},"canonical_sha256":"980bd846355db0820b1725a3fbe725815d41a45b6051d05970ab4f9c9b3f8765","source":{"kind":"arxiv","id":"1905.13203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13203","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13203v1","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13203","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"TAF5QRRVLWYI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAF5QRRVLWYIECYX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAF5QRRV","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TAF5QRRVLWYIECYXEWR7XZZFQF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-30T17:46:05Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"682306248e3dd66c6fcdbfbfe03edba211c0b0a567d419e175b39f1f69b27363","abstract_canon_sha256":"e6a4eb5f864042b7ffc61e916b64106c7ee4b5baae9deeb301075068aad9a23c"},"schema_version":"1.0"},"canonical_sha256":"980bd846355db0820b1725a3fbe725815d41a45b6051d05970ab4f9c9b3f8765","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.671979Z","signature_b64":"E973nTqZRfpJYt1ejJB3jnFbQ4TPUpf/PH1zK4N0j8+8dQXA0Cb9fuZQJEV0pl9kcBMiEvBmcjb/8on24T0yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"980bd846355db0820b1725a3fbe725815d41a45b6051d05970ab4f9c9b3f8765","last_reissued_at":"2026-05-17T23:44:38.671559Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.671559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13203","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-05-17T23:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gr+6knI/kbePA30v2WChpjQTIeG0R1pKzqcR3FRMScIaHAchdOWXib8y3gMJLuUPxg6oZIq3usgqyHhaEOZNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:58:34.406143Z"},"content_sha256":"5daf516268e3b8f9342eb35310dc78c19fc8bb8ba763726290b652837ba92bed","schema_version":"1.0","event_id":"sha256:5daf516268e3b8f9342eb35310dc78c19fc8bb8ba763726290b652837ba92bed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TAF5QRRVLWYIECYXEWR7XZZFQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parametrised Algorithms for Directed Modular Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Raphael Steiner, Sebastian Wiederrecht","submitted_at":"2019-05-30T17:46:05Z","abstract_excerpt":"Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on measuring how close a digraph is to an oriented tree resp. a directed acyclic graph, in this paper, we investigate directed modular width as a parameter, which is closer to the concept of clique-width. We investigate applications of modular decompositions of directed graphs to a wide range of algorithmic problems and derive FPT-algorithms for several well-kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13203","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"},"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-05-17T23:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APQWOQDncXAfiNOO4dHSVkKJkmz1QP0Avq0Fr40EPE7ZiJpIOtdOJT6qTHkY2abMilivp4CEy5WDA2DtiWG6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:58:34.406878Z"},"content_sha256":"258644288729abacd89d853c18b7253b907c04eba376d9a81a0789a30cfa788f","schema_version":"1.0","event_id":"sha256:258644288729abacd89d853c18b7253b907c04eba376d9a81a0789a30cfa788f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAF5QRRVLWYIECYXEWR7XZZFQF/bundle.json","state_url":"https://pith.science/pith/TAF5QRRVLWYIECYXEWR7XZZFQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAF5QRRVLWYIECYXEWR7XZZFQF/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-06-08T07:58:34Z","links":{"resolver":"https://pith.science/pith/TAF5QRRVLWYIECYXEWR7XZZFQF","bundle":"https://pith.science/pith/TAF5QRRVLWYIECYXEWR7XZZFQF/bundle.json","state":"https://pith.science/pith/TAF5QRRVLWYIECYXEWR7XZZFQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAF5QRRVLWYIECYXEWR7XZZFQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TAF5QRRVLWYIECYXEWR7XZZFQF","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":"e6a4eb5f864042b7ffc61e916b64106c7ee4b5baae9deeb301075068aad9a23c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-30T17:46:05Z","title_canon_sha256":"682306248e3dd66c6fcdbfbfe03edba211c0b0a567d419e175b39f1f69b27363"},"schema_version":"1.0","source":{"id":"1905.13203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13203","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13203v1","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13203","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"TAF5QRRVLWYI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAF5QRRVLWYIECYX","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAF5QRRV","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:258644288729abacd89d853c18b7253b907c04eba376d9a81a0789a30cfa788f","target":"graph","created_at":"2026-05-17T23:44:38Z","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"},"paper":{"abstract_excerpt":"Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on measuring how close a digraph is to an oriented tree resp. a directed acyclic graph, in this paper, we investigate directed modular width as a parameter, which is closer to the concept of clique-width. We investigate applications of modular decompositions of directed graphs to a wide range of algorithmic problems and derive FPT-algorithms for several well-kno","authors_text":"Raphael Steiner, Sebastian Wiederrecht","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-30T17:46:05Z","title":"Parametrised Algorithms for Directed Modular Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13203","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:5daf516268e3b8f9342eb35310dc78c19fc8bb8ba763726290b652837ba92bed","target":"record","created_at":"2026-05-17T23:44:38Z","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":"e6a4eb5f864042b7ffc61e916b64106c7ee4b5baae9deeb301075068aad9a23c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-30T17:46:05Z","title_canon_sha256":"682306248e3dd66c6fcdbfbfe03edba211c0b0a567d419e175b39f1f69b27363"},"schema_version":"1.0","source":{"id":"1905.13203","kind":"arxiv","version":1}},"canonical_sha256":"980bd846355db0820b1725a3fbe725815d41a45b6051d05970ab4f9c9b3f8765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"980bd846355db0820b1725a3fbe725815d41a45b6051d05970ab4f9c9b3f8765","first_computed_at":"2026-05-17T23:44:38.671559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:38.671559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E973nTqZRfpJYt1ejJB3jnFbQ4TPUpf/PH1zK4N0j8+8dQXA0Cb9fuZQJEV0pl9kcBMiEvBmcjb/8on24T0yBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:38.671979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5daf516268e3b8f9342eb35310dc78c19fc8bb8ba763726290b652837ba92bed","sha256:258644288729abacd89d853c18b7253b907c04eba376d9a81a0789a30cfa788f"],"state_sha256":"3f56d712410219dfb620b6ddfe0ca9d649fcded253e17afe4efff90ad1048bd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJOq9HYhoKofwFyqOpVIcBEG1n/fe5ltvrA+uTkwYlEKdgVyjYRa6NYzq1JQXnPs3X/pEl1k4oC/rzn3L3oAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T07:58:34.411046Z","bundle_sha256":"19e8d3dc31bf7627103fde06dda4074b1f695535de24986ef4d0be09f8462871"}}