{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FMDNLMEX42TR26NSLDMF6MCXXF","short_pith_number":"pith:FMDNLMEX","schema_version":"1.0","canonical_sha256":"2b06d5b097e6a71d79b258d85f3057b953917f8c163fa1f1c8c4aed2ffdd9894","source":{"kind":"arxiv","id":"1503.00793","version":1},"attestation_state":"computed","paper":{"title":"DAG-width of Control Flow Graphs with Applications to Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL","cs.SE"],"primary_cat":"cs.DM","authors_text":"Neeraj Kumar, Sebastian Fischmeister, Therese Biedl","submitted_at":"2015-03-03T01:05:06Z","abstract_excerpt":"The treewidth of control flow graphs arising from structured programs is known to be at most six. However, as a control flow graph is inherently directed, it makes sense to consider a measure of width for digraphs instead. We use the so-called DAG-width and show that the DAG-width of control flow graphs arising from structured (goto-free) programs is at most three. Additionally, we also give a linear time algorithm to compute the DAG decomposition of these control flow graphs. One consequence of this result is that parity games (and hence the $\\mu$-calculus model checking problem), which are k"},"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":"1503.00793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T01:05:06Z","cross_cats_sorted":["cs.LO","cs.PL","cs.SE"],"title_canon_sha256":"5d006baa26d48079a3d34363aa6a8d08a95b6e902510b8e94ccc1f9deaf8ad8f","abstract_canon_sha256":"76b05369e392d64162f531986b8a805d7a61f981b28dc39819e9c5435a1b4ded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:48.386208Z","signature_b64":"ip8c29UaZus2DSLoNL90DxSab5sokX63PUEMgfsz/1JeBUpn74+Tj3um1PssPGWNefztLHQdBUH2w+ElwJ7GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b06d5b097e6a71d79b258d85f3057b953917f8c163fa1f1c8c4aed2ffdd9894","last_reissued_at":"2026-05-18T02:25:48.385754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:48.385754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DAG-width of Control Flow Graphs with Applications to Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.PL","cs.SE"],"primary_cat":"cs.DM","authors_text":"Neeraj Kumar, Sebastian Fischmeister, Therese Biedl","submitted_at":"2015-03-03T01:05:06Z","abstract_excerpt":"The treewidth of control flow graphs arising from structured programs is known to be at most six. However, as a control flow graph is inherently directed, it makes sense to consider a measure of width for digraphs instead. We use the so-called DAG-width and show that the DAG-width of control flow graphs arising from structured (goto-free) programs is at most three. Additionally, we also give a linear time algorithm to compute the DAG decomposition of these control flow graphs. One consequence of this result is that parity games (and hence the $\\mu$-calculus model checking problem), which are k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00793","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.00793","created_at":"2026-05-18T02:25:48.385821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00793v1","created_at":"2026-05-18T02:25:48.385821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00793","created_at":"2026-05-18T02:25:48.385821+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMDNLMEX42TR","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMDNLMEX42TR26NS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMDNLMEX","created_at":"2026-05-18T12:29:19.899920+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/FMDNLMEX42TR26NSLDMF6MCXXF","json":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF.json","graph_json":"https://pith.science/api/pith-number/FMDNLMEX42TR26NSLDMF6MCXXF/graph.json","events_json":"https://pith.science/api/pith-number/FMDNLMEX42TR26NSLDMF6MCXXF/events.json","paper":"https://pith.science/paper/FMDNLMEX"},"agent_actions":{"view_html":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF","download_json":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF.json","view_paper":"https://pith.science/paper/FMDNLMEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00793&json=true","fetch_graph":"https://pith.science/api/pith-number/FMDNLMEX42TR26NSLDMF6MCXXF/graph.json","fetch_events":"https://pith.science/api/pith-number/FMDNLMEX42TR26NSLDMF6MCXXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/action/storage_attestation","attest_author":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/action/author_attestation","sign_citation":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/action/citation_signature","submit_replication":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/action/replication_record"}},"created_at":"2026-05-18T02:25:48.385821+00:00","updated_at":"2026-05-18T02:25:48.385821+00:00"}