{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:L62RU4XAPHJVLU2NHMTWZTGO4R","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":"b1e60b7acb90b78db3eef567dcde051c5536ee9c58ac392c673aa2b20b1e384f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-19T13:49:31Z","title_canon_sha256":"ac3aaf68cc99950f1f321fd34d0802776f9a33f964bfa163ea068dc9df82e318"},"schema_version":"1.0","source":{"id":"2403.12734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.12734","created_at":"2026-05-21T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2403.12734v2","created_at":"2026-05-21T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12734","created_at":"2026-05-21T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"L62RU4XAPHJV","created_at":"2026-05-21T01:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"L62RU4XAPHJVLU2N","created_at":"2026-05-21T01:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"L62RU4XA","created_at":"2026-05-21T01:05:02Z"}],"graph_snapshots":[{"event_id":"sha256:7cd7a69e6fc00908f74d31734de5ffc38cfe2d0cef13ddb7cb900a0070eb9604","target":"graph","created_at":"2026-05-21T01:05:02Z","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/2403.12734/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To measure the tree-likeness of a directed acyclic graph (DAG), a new width parameter that considers the directions of the arcs was recently introduced: scanwidth. We present the first algorithm that efficiently computes the exact scanwidth of general DAGs. For DAGs with one root and scanwidth $k$ it runs in $O(k \\cdot n^k \\cdot m)$ time. The algorithm also functions as an FPT algorithm with complexity $O(2^{4 \\ell - 1} \\cdot \\ell \\cdot n + n^2)$ for phylogenetic networks of level-$\\ell$, a type of DAG used to depict evolutionary relationships among species. Our algorithm performs well in prac","authors_text":"Leo van Iersel, Mark Jones, Niels Holtgrefe","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-19T13:49:31Z","title":"Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12734","kind":"arxiv","version":2},"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:0d412b12cdae01f89e70784787343d112028f924549b5dd03ff749875cf379d5","target":"record","created_at":"2026-05-21T01:05:02Z","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":"b1e60b7acb90b78db3eef567dcde051c5536ee9c58ac392c673aa2b20b1e384f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-19T13:49:31Z","title_canon_sha256":"ac3aaf68cc99950f1f321fd34d0802776f9a33f964bfa163ea068dc9df82e318"},"schema_version":"1.0","source":{"id":"2403.12734","kind":"arxiv","version":2}},"canonical_sha256":"5fb51a72e079d355d34d3b276ccccee4698a0669b9ee5041c5836e4a69ebd49c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb51a72e079d355d34d3b276ccccee4698a0669b9ee5041c5836e4a69ebd49c","first_computed_at":"2026-05-21T01:05:02.204391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:02.204391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbUXYlz46Fbhsqz87UtboHjPJl6gDvZDXK+YzV19R759ELRWBbRQRJcCpLCBemxXQKiZ7/js4+mh4qXLduzFAg==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:02.205402Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.12734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d412b12cdae01f89e70784787343d112028f924549b5dd03ff749875cf379d5","sha256:7cd7a69e6fc00908f74d31734de5ffc38cfe2d0cef13ddb7cb900a0070eb9604"],"state_sha256":"2acedd83d0aa652dd923ade7777ffa383b433d4bdd9ab731415ace1624badfb5"}