{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WFTAJXZPRH5YSQPAXFYDWJNRYC","short_pith_number":"pith:WFTAJXZP","canonical_record":{"source":{"id":"1811.02259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T09:50:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"21ada95ae13d4407e9ed204b1a393d124924c34e07ea006481b385f4b3799105","abstract_canon_sha256":"e4d05f462f566857e088d1fc2613b87c051dd730d34643fbb792e1de31188e39"},"schema_version":"1.0"},"canonical_sha256":"b16604df2f89fb8941e0b9703b25b1c09e12f3df5c0f6685f4a43c07e20425a9","source":{"kind":"arxiv","id":"1811.02259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02259","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02259v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02259","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"WFTAJXZPRH5Y","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WFTAJXZPRH5YSQPA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WFTAJXZP","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WFTAJXZPRH5YSQPAXFYDWJNRYC","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T09:50:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"21ada95ae13d4407e9ed204b1a393d124924c34e07ea006481b385f4b3799105","abstract_canon_sha256":"e4d05f462f566857e088d1fc2613b87c051dd730d34643fbb792e1de31188e39"},"schema_version":"1.0"},"canonical_sha256":"b16604df2f89fb8941e0b9703b25b1c09e12f3df5c0f6685f4a43c07e20425a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.702998Z","signature_b64":"0q/nNPhp3TMpv6vG/G0uHo/7Vwdrs5t2IlNm0V8zzVGZ7fDg0zj8RKGszLBJUyEcAtj8sgeW/t/nMT9FgsZ0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b16604df2f89fb8941e0b9703b25b1c09e12f3df5c0f6685f4a43c07e20425a9","last_reissued_at":"2026-05-18T00:01:24.702643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.702643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02259","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:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9yrHspquW92GhXleRXC5hUD/qTo64M14Q+ChL4fP3DxW1NzCu/duZeA99SqMW8KUJKWQ9n8ccF+fKYylfVqBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:54:01.565009Z"},"content_sha256":"6b608f7153a6def5096768418e4d3c03d50b386a7e0c4fd5a48df592686066ac","schema_version":"1.0","event_id":"sha256:6b608f7153a6def5096768418e4d3c03d50b386a7e0c4fd5a48df592686066ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WFTAJXZPRH5YSQPAXFYDWJNRYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizations and Directed Path-Width of Sequence 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, Jochen Rethmann","submitted_at":"2018-11-06T09:50:49Z","abstract_excerpt":"Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an input digraph G=(V,A) by a number k of sequences with entries from V, such that (u,v) in A if and only if in one of the sequences there is an occurrence of u appearing before an occurrence of v. We present several graph theoretical properties of these digraphs. Among these we give forbidden subdigraphs of digraphs which can be defined by k=1 sequence, which is a subclass of semicomplete digraphs. Given the decompositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02259","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:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ryTm2cSbR28XSaHwbJbmZKiWbIRErhLmljpJBbvad6S9D8hzQ3WwmhNb9sI3IWlT5AwFRPWB9aHHAQ0V1G7yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:54:01.565367Z"},"content_sha256":"0cf53d9de4fd344e03aa56eff3c11bd7119f03f35fe37ddba0dd83d9e9aac8e0","schema_version":"1.0","event_id":"sha256:0cf53d9de4fd344e03aa56eff3c11bd7119f03f35fe37ddba0dd83d9e9aac8e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/bundle.json","state_url":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/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-27T08:54:01Z","links":{"resolver":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC","bundle":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/bundle.json","state":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WFTAJXZPRH5YSQPAXFYDWJNRYC","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":"e4d05f462f566857e088d1fc2613b87c051dd730d34643fbb792e1de31188e39","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T09:50:49Z","title_canon_sha256":"21ada95ae13d4407e9ed204b1a393d124924c34e07ea006481b385f4b3799105"},"schema_version":"1.0","source":{"id":"1811.02259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02259","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02259v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02259","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"WFTAJXZPRH5Y","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WFTAJXZPRH5YSQPA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WFTAJXZP","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:0cf53d9de4fd344e03aa56eff3c11bd7119f03f35fe37ddba0dd83d9e9aac8e0","target":"graph","created_at":"2026-05-18T00:01:24Z","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":"Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an input digraph G=(V,A) by a number k of sequences with entries from V, such that (u,v) in A if and only if in one of the sequences there is an occurrence of u appearing before an occurrence of v. We present several graph theoretical properties of these digraphs. Among these we give forbidden subdigraphs of digraphs which can be defined by k=1 sequence, which is a subclass of semicomplete digraphs. Given the decompositi","authors_text":"Carolin Rehs, Frank Gurski, Jochen Rethmann","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T09:50:49Z","title":"Characterizations and Directed Path-Width of Sequence Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02259","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:6b608f7153a6def5096768418e4d3c03d50b386a7e0c4fd5a48df592686066ac","target":"record","created_at":"2026-05-18T00:01:24Z","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":"e4d05f462f566857e088d1fc2613b87c051dd730d34643fbb792e1de31188e39","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-06T09:50:49Z","title_canon_sha256":"21ada95ae13d4407e9ed204b1a393d124924c34e07ea006481b385f4b3799105"},"schema_version":"1.0","source":{"id":"1811.02259","kind":"arxiv","version":1}},"canonical_sha256":"b16604df2f89fb8941e0b9703b25b1c09e12f3df5c0f6685f4a43c07e20425a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b16604df2f89fb8941e0b9703b25b1c09e12f3df5c0f6685f4a43c07e20425a9","first_computed_at":"2026-05-18T00:01:24.702643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:24.702643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0q/nNPhp3TMpv6vG/G0uHo/7Vwdrs5t2IlNm0V8zzVGZ7fDg0zj8RKGszLBJUyEcAtj8sgeW/t/nMT9FgsZ0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:24.702998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b608f7153a6def5096768418e4d3c03d50b386a7e0c4fd5a48df592686066ac","sha256:0cf53d9de4fd344e03aa56eff3c11bd7119f03f35fe37ddba0dd83d9e9aac8e0"],"state_sha256":"4a562370b8d7a3cc99c31a591054eec86072fbecc708873aa29f523365a23fbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkTpl4iM8Ki84o9CJGBMTdgyQuCesiNBeq7id+K2Lf0dcUGeIWK+uCKTshaIIVLa5m5wbLvOU1fttAu76Q2uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:54:01.567231Z","bundle_sha256":"29ca3f6dce6d006ad48f9562c273c550d7eef54d45c22275f3685196f8ad8a1c"}}