{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4IAEKBNWKTOR5KU7OFQLANSW7Q","short_pith_number":"pith:4IAEKBNW","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"},"canonical_sha256":"e2004505b654dd1eaa9f7160b03656fc02c44e982411b4956d9980a8ab04d819","source":{"kind":"arxiv","id":"1806.04457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04457","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04457v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04457","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"4IAEKBNWKTOR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4IAEKBNWKTOR5KU7","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4IAEKBNW","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4IAEKBNWKTOR5KU7OFQLANSW7Q","target":"record","payload":{"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"},"canonical_sha256":"e2004505b654dd1eaa9f7160b03656fc02c44e982411b4956d9980a8ab04d819","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"},"source_kind":"arxiv","source_id":"1806.04457","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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQAH26clohpuzjwtvezlP/5lqnpxwFIh8qcK94KDpavqPtlsHvBhiFfUFoOjEqfYnUdW+z/7602axAmyFui1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:01:55.900860Z"},"content_sha256":"4c1d0f2f4a9845e4679645b9e651c6ccd879e067af2594e6f034afd176455d31","schema_version":"1.0","event_id":"sha256:4c1d0f2f4a9845e4679645b9e651c6ccd879e067af2594e6f034afd176455d31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4IAEKBNWKTOR5KU7OFQLANSW7Q","target":"graph","payload":{"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"},"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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AY3qauwXyWkAiN/Bhv724y4fImE4I/sWNAA4yt55R4F5oue7Qyog0yOhFOxl+nTWhtJtAptSz9wVPgV5uG5mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:01:55.901340Z"},"content_sha256":"bddb906d2d78d99a652cad2a0b6b4c4af60fe6c333a0f1ccfbfc3135af5203dd","schema_version":"1.0","event_id":"sha256:bddb906d2d78d99a652cad2a0b6b4c4af60fe6c333a0f1ccfbfc3135af5203dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/bundle.json","state_url":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/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-06-27T10:01:55Z","links":{"resolver":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q","bundle":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/bundle.json","state":"https://pith.science/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IAEKBNWKTOR5KU7OFQLANSW7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4IAEKBNWKTOR5KU7OFQLANSW7Q","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":"b4547e58f157c5fbb929d1ad0cf3c7218e85eb6a7ef153481fb8f940263515a7","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T12:13:47Z","title_canon_sha256":"aa562ee9638da87ab5acb0b3e67eaf8d2800b52fda21ec1e001bc0f535b939c1"},"schema_version":"1.0","source":{"id":"1806.04457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04457","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04457v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04457","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"4IAEKBNWKTOR","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4IAEKBNWKTOR5KU7","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4IAEKBNW","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:bddb906d2d78d99a652cad2a0b6b4c4af60fe6c333a0f1ccfbfc3135af5203dd","target":"graph","created_at":"2026-05-18T00:13:35Z","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":"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","authors_text":"Carolin Rehs, Frank Gurski","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T12:13:47Z","title":"Computing directed path-width and directed tree-width of recursively defined digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04457","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:4c1d0f2f4a9845e4679645b9e651c6ccd879e067af2594e6f034afd176455d31","target":"record","created_at":"2026-05-18T00:13:35Z","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":"b4547e58f157c5fbb929d1ad0cf3c7218e85eb6a7ef153481fb8f940263515a7","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-12T12:13:47Z","title_canon_sha256":"aa562ee9638da87ab5acb0b3e67eaf8d2800b52fda21ec1e001bc0f535b939c1"},"schema_version":"1.0","source":{"id":"1806.04457","kind":"arxiv","version":1}},"canonical_sha256":"e2004505b654dd1eaa9f7160b03656fc02c44e982411b4956d9980a8ab04d819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2004505b654dd1eaa9f7160b03656fc02c44e982411b4956d9980a8ab04d819","first_computed_at":"2026-05-18T00:13:35.454078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.454078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EE7bOGSkWW6QCKhJtyHvsZHiFIALe3q//YVOOKXM6MUWlyIvj+Jawaoe/GOPxoxAEmKG7hzGvigsrAzTqN5WAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.454612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c1d0f2f4a9845e4679645b9e651c6ccd879e067af2594e6f034afd176455d31","sha256:bddb906d2d78d99a652cad2a0b6b4c4af60fe6c333a0f1ccfbfc3135af5203dd"],"state_sha256":"41f226a4acbd35bab3e35abbed44e6c43fd19be480786e92dcbc2b9eed599a3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2gRWX+JbPM8gpNtqQz/RuY9zpHHiiXhQjhCdkmMqDLZ7Ai4kySDFrkXrmSxuJHfqkLKvtWUaE7i9RgC4m+cBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:01:55.903626Z","bundle_sha256":"cdec8ce35cb6020db00bde3fca4a96e2ba3b8f219966b10ea14229993e8afa46"}}