{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:L62RU4XAPHJVLU2NHMTWZTGO4R","short_pith_number":"pith:L62RU4XA","schema_version":"1.0","canonical_sha256":"5fb51a72e079d355d34d3b276ccccee4698a0669b9ee5041c5836e4a69ebd49c","source":{"kind":"arxiv","id":"2403.12734","version":2},"attestation_state":"computed","paper":{"title":"Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Leo van Iersel, Mark Jones, Niels Holtgrefe","submitted_at":"2024-03-19T13:49:31Z","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"},"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":"2403.12734","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-19T13:49:31Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ac3aaf68cc99950f1f321fd34d0802776f9a33f964bfa163ea068dc9df82e318","abstract_canon_sha256":"b1e60b7acb90b78db3eef567dcde051c5536ee9c58ac392c673aa2b20b1e384f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:02.205402Z","signature_b64":"UbUXYlz46Fbhsqz87UtboHjPJl6gDvZDXK+YzV19R759ELRWBbRQRJcCpLCBemxXQKiZ7/js4+mh4qXLduzFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fb51a72e079d355d34d3b276ccccee4698a0669b9ee5041c5836e4a69ebd49c","last_reissued_at":"2026-05-21T01:05:02.204391Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:02.204391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Leo van Iersel, Mark Jones, Niels Holtgrefe","submitted_at":"2024-03-19T13:49:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12734","kind":"arxiv","version":2},"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/2403.12734/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":"2403.12734","created_at":"2026-05-21T01:05:02.204550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12734v2","created_at":"2026-05-21T01:05:02.204550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12734","created_at":"2026-05-21T01:05:02.204550+00:00"},{"alias_kind":"pith_short_12","alias_value":"L62RU4XAPHJV","created_at":"2026-05-21T01:05:02.204550+00:00"},{"alias_kind":"pith_short_16","alias_value":"L62RU4XAPHJVLU2N","created_at":"2026-05-21T01:05:02.204550+00:00"},{"alias_kind":"pith_short_8","alias_value":"L62RU4XA","created_at":"2026-05-21T01:05:02.204550+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/L62RU4XAPHJVLU2NHMTWZTGO4R","json":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R.json","graph_json":"https://pith.science/api/pith-number/L62RU4XAPHJVLU2NHMTWZTGO4R/graph.json","events_json":"https://pith.science/api/pith-number/L62RU4XAPHJVLU2NHMTWZTGO4R/events.json","paper":"https://pith.science/paper/L62RU4XA"},"agent_actions":{"view_html":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R","download_json":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R.json","view_paper":"https://pith.science/paper/L62RU4XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12734&json=true","fetch_graph":"https://pith.science/api/pith-number/L62RU4XAPHJVLU2NHMTWZTGO4R/graph.json","fetch_events":"https://pith.science/api/pith-number/L62RU4XAPHJVLU2NHMTWZTGO4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R/action/storage_attestation","attest_author":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R/action/author_attestation","sign_citation":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R/action/citation_signature","submit_replication":"https://pith.science/pith/L62RU4XAPHJVLU2NHMTWZTGO4R/action/replication_record"}},"created_at":"2026-05-21T01:05:02.204550+00:00","updated_at":"2026-05-21T01:05:02.204550+00:00"}