{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4IAEKBNWKTOR5KU7OFQLANSW7Q","short_pith_number":"pith:4IAEKBNW","schema_version":"1.0","canonical_sha256":"e2004505b654dd1eaa9f7160b03656fc02c44e982411b4956d9980a8ab04d819","source":{"kind":"arxiv","id":"1806.04457","version":1},"attestation_state":"computed","paper":{"title":"Computing directed path-width and directed tree-width of recursively defined digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Carolin Rehs, Frank Gurski","submitted_at":"2018-06-12T12:13:47Z","abstract_excerpt":"In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint union, order composition, directed union, and series composition of two directed graphs. These results imply the equality of directed path-width and directed tree-width for all digraphs which can be defined by these four operations. This allows us to show a linear-time solution for computing the directed path-width and directed tree-width of all these digrap"},"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":"1806.04457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T12:13:47Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"aa562ee9638da87ab5acb0b3e67eaf8d2800b52fda21ec1e001bc0f535b939c1","abstract_canon_sha256":"b4547e58f157c5fbb929d1ad0cf3c7218e85eb6a7ef153481fb8f940263515a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.454612Z","signature_b64":"EE7bOGSkWW6QCKhJtyHvsZHiFIALe3q//YVOOKXM6MUWlyIvj+Jawaoe/GOPxoxAEmKG7hzGvigsrAzTqN5WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2004505b654dd1eaa9f7160b03656fc02c44e982411b4956d9980a8ab04d819","last_reissued_at":"2026-05-18T00:13:35.454078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.454078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing directed path-width and directed tree-width of recursively defined digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Carolin Rehs, Frank Gurski","submitted_at":"2018-06-12T12:13:47Z","abstract_excerpt":"In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint union, order composition, directed union, and series composition of two directed graphs. These results imply the equality of directed path-width and directed tree-width for all digraphs which can be defined by these four operations. This allows us to show a linear-time solution for computing the directed path-width and directed tree-width of all these digrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04457","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":"1806.04457","created_at":"2026-05-18T00:13:35.454145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04457v1","created_at":"2026-05-18T00:13:35.454145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04457","created_at":"2026-05-18T00:13:35.454145+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IAEKBNWKTOR","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IAEKBNWKTOR5KU7","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IAEKBNW","created_at":"2026-05-18T12:32:05.422762+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/4IAEKBNWKTOR5KU7OFQLANSW7Q","json":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q.json","graph_json":"https://pith.science/api/pith-number/4IAEKBNWKTOR5KU7OFQLANSW7Q/graph.json","events_json":"https://pith.science/api/pith-number/4IAEKBNWKTOR5KU7OFQLANSW7Q/events.json","paper":"https://pith.science/paper/4IAEKBNW"},"agent_actions":{"view_html":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q","download_json":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q.json","view_paper":"https://pith.science/paper/4IAEKBNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04457&json=true","fetch_graph":"https://pith.science/api/pith-number/4IAEKBNWKTOR5KU7OFQLANSW7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/4IAEKBNWKTOR5KU7OFQLANSW7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/action/storage_attestation","attest_author":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/action/author_attestation","sign_citation":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/action/citation_signature","submit_replication":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/action/replication_record"}},"created_at":"2026-05-18T00:13:35.454145+00:00","updated_at":"2026-05-18T00:13:35.454145+00:00"}