{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WFTAJXZPRH5YSQPAXFYDWJNRYC","short_pith_number":"pith:WFTAJXZP","schema_version":"1.0","canonical_sha256":"b16604df2f89fb8941e0b9703b25b1c09e12f3df5c0f6685f4a43c07e20425a9","source":{"kind":"arxiv","id":"1811.02259","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02259","created_at":"2026-05-18T00:01:24.702697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02259v1","created_at":"2026-05-18T00:01:24.702697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02259","created_at":"2026-05-18T00:01:24.702697+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFTAJXZPRH5Y","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFTAJXZPRH5YSQPA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFTAJXZP","created_at":"2026-05-18T12:32:59.047623+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/WFTAJXZPRH5YSQPAXFYDWJNRYC","json":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC.json","graph_json":"https://pith.science/api/pith-number/WFTAJXZPRH5YSQPAXFYDWJNRYC/graph.json","events_json":"https://pith.science/api/pith-number/WFTAJXZPRH5YSQPAXFYDWJNRYC/events.json","paper":"https://pith.science/paper/WFTAJXZP"},"agent_actions":{"view_html":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC","download_json":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC.json","view_paper":"https://pith.science/paper/WFTAJXZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02259&json=true","fetch_graph":"https://pith.science/api/pith-number/WFTAJXZPRH5YSQPAXFYDWJNRYC/graph.json","fetch_events":"https://pith.science/api/pith-number/WFTAJXZPRH5YSQPAXFYDWJNRYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/action/storage_attestation","attest_author":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/action/author_attestation","sign_citation":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/action/citation_signature","submit_replication":"https://pith.science/pith/WFTAJXZPRH5YSQPAXFYDWJNRYC/action/replication_record"}},"created_at":"2026-05-18T00:01:24.702697+00:00","updated_at":"2026-05-18T00:01:24.702697+00:00"}