{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FMDNLMEX42TR26NSLDMF6MCXXF","short_pith_number":"pith:FMDNLMEX","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"},"canonical_sha256":"2b06d5b097e6a71d79b258d85f3057b953917f8c163fa1f1c8c4aed2ffdd9894","source":{"kind":"arxiv","id":"1503.00793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00793","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00793v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00793","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"FMDNLMEX42TR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FMDNLMEX42TR26NS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FMDNLMEX","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FMDNLMEX42TR26NSLDMF6MCXXF","target":"record","payload":{"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"},"canonical_sha256":"2b06d5b097e6a71d79b258d85f3057b953917f8c163fa1f1c8c4aed2ffdd9894","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"},"source_kind":"arxiv","source_id":"1503.00793","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-18T02:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZC+Vwj0hwibDOKePyO6K23DD02Nz1oweqAJ7wq2iS32RmTcYVI6z3scq12cv10uhae1MEZzqVzj1fn2rAEybAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:24.929383Z"},"content_sha256":"6472a023394fe41f7e579d008fa034f741132a673d17972a17d9badc4e3632a6","schema_version":"1.0","event_id":"sha256:6472a023394fe41f7e579d008fa034f741132a673d17972a17d9badc4e3632a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FMDNLMEX42TR26NSLDMF6MCXXF","target":"graph","payload":{"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"},"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-18T02:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Azh+yoSVUVwbRVe+o9JF8isf5SaW/VZjVqHFvLmaDNLTMXfT0nuLLRr1pv35Cm66OSUiQ+wxEDBTo7Lg0Z13Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:24.930016Z"},"content_sha256":"c19db2446f0e416ba6508b77ce81a4e2458a6238f6817ae46cbdad73e81aac96","schema_version":"1.0","event_id":"sha256:c19db2446f0e416ba6508b77ce81a4e2458a6238f6817ae46cbdad73e81aac96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/bundle.json","state_url":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FMDNLMEX42TR26NSLDMF6MCXXF/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-05-31T02:49:24Z","links":{"resolver":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF","bundle":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/bundle.json","state":"https://pith.science/pith/FMDNLMEX42TR26NSLDMF6MCXXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FMDNLMEX42TR26NSLDMF6MCXXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FMDNLMEX42TR26NSLDMF6MCXXF","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":"76b05369e392d64162f531986b8a805d7a61f981b28dc39819e9c5435a1b4ded","cross_cats_sorted":["cs.LO","cs.PL","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T01:05:06Z","title_canon_sha256":"5d006baa26d48079a3d34363aa6a8d08a95b6e902510b8e94ccc1f9deaf8ad8f"},"schema_version":"1.0","source":{"id":"1503.00793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00793","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00793v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00793","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"FMDNLMEX42TR","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FMDNLMEX42TR26NS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FMDNLMEX","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:c19db2446f0e416ba6508b77ce81a4e2458a6238f6817ae46cbdad73e81aac96","target":"graph","created_at":"2026-05-18T02:25:48Z","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":"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","authors_text":"Neeraj Kumar, Sebastian Fischmeister, Therese Biedl","cross_cats":["cs.LO","cs.PL","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T01:05:06Z","title":"DAG-width of Control Flow Graphs with Applications to Model Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00793","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:6472a023394fe41f7e579d008fa034f741132a673d17972a17d9badc4e3632a6","target":"record","created_at":"2026-05-18T02:25:48Z","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":"76b05369e392d64162f531986b8a805d7a61f981b28dc39819e9c5435a1b4ded","cross_cats_sorted":["cs.LO","cs.PL","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T01:05:06Z","title_canon_sha256":"5d006baa26d48079a3d34363aa6a8d08a95b6e902510b8e94ccc1f9deaf8ad8f"},"schema_version":"1.0","source":{"id":"1503.00793","kind":"arxiv","version":1}},"canonical_sha256":"2b06d5b097e6a71d79b258d85f3057b953917f8c163fa1f1c8c4aed2ffdd9894","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b06d5b097e6a71d79b258d85f3057b953917f8c163fa1f1c8c4aed2ffdd9894","first_computed_at":"2026-05-18T02:25:48.385754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:48.385754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ip8c29UaZus2DSLoNL90DxSab5sokX63PUEMgfsz/1JeBUpn74+Tj3um1PssPGWNefztLHQdBUH2w+ElwJ7GAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:48.386208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6472a023394fe41f7e579d008fa034f741132a673d17972a17d9badc4e3632a6","sha256:c19db2446f0e416ba6508b77ce81a4e2458a6238f6817ae46cbdad73e81aac96"],"state_sha256":"8122c246363ec5d77dfb9403cf2571820d1d960ac47a2777065c1e56f6c1373f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3g4+f+mvUE+gtOABlHdtC62jGZRrs9vTHuQlKDukiApRCc8nw3/dbh1Q2ttkmkzgRFBibet6aOCEZ2ovErsEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:49:24.933139Z","bundle_sha256":"8c0664d24b61970001c109de9c1f6c040e4df5593899034257be3c94c9ff6a0a"}}