{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K5C7XGCUYP5TYK7I4V767672D4","short_pith_number":"pith:K5C7XGCU","schema_version":"1.0","canonical_sha256":"5745fb9854c3fb3c2be8e57feffbfa1f25dab8329cc5075c8a9235390f0289f8","source":{"kind":"arxiv","id":"1812.06653","version":1},"attestation_state":"computed","paper":{"title":"Comparing Linear Width Parameters for Directed Graphs","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-12-17T08:52:20Z","abstract_excerpt":"In this paper we introduce the linear clique-width, linear NLC-width, neighbourhood-width, and linear rank-width for directed graphs. We compare these parameters with each other as well as with the previously defined parameters directed path-width and directed cut-width. It turns out that the parameters directed linear clique-width, directed linear NLC-width, directed neighbourhood-width, and directed linear rank-width are equivalent in that sense, that all of these parameters can be upper bounded by each of the others. For the restriction to digraphs of bounded vertex degree directed path-wid"},"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":"1812.06653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-17T08:52:20Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"cfa0b552c27bf1ca63a4ab435a34ea822200b971fc5888d04b4be203cb64ee36","abstract_canon_sha256":"7a6cbd3768f8d5e651d7523e147c75ec6d8ec773d8eaa8139b3aabc7c529b3cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.636449Z","signature_b64":"OQ68J7wIYMSRNbL6S/5aqTURZnwyWxaQQ3JIVQ0BeakJmy+tL7sXnNJfGrn/awWoDNf0cnuy5emtA+5gJPAMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5745fb9854c3fb3c2be8e57feffbfa1f25dab8329cc5075c8a9235390f0289f8","last_reissued_at":"2026-05-17T23:58:09.635817Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.635817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing Linear Width Parameters for Directed Graphs","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-12-17T08:52:20Z","abstract_excerpt":"In this paper we introduce the linear clique-width, linear NLC-width, neighbourhood-width, and linear rank-width for directed graphs. We compare these parameters with each other as well as with the previously defined parameters directed path-width and directed cut-width. It turns out that the parameters directed linear clique-width, directed linear NLC-width, directed neighbourhood-width, and directed linear rank-width are equivalent in that sense, that all of these parameters can be upper bounded by each of the others. For the restriction to digraphs of bounded vertex degree directed path-wid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06653","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":"1812.06653","created_at":"2026-05-17T23:58:09.635911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06653v1","created_at":"2026-05-17T23:58:09.635911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06653","created_at":"2026-05-17T23:58:09.635911+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5C7XGCUYP5T","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5C7XGCUYP5TYK7I","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5C7XGCU","created_at":"2026-05-18T12:32:33.847187+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/K5C7XGCUYP5TYK7I4V767672D4","json":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4.json","graph_json":"https://pith.science/api/pith-number/K5C7XGCUYP5TYK7I4V767672D4/graph.json","events_json":"https://pith.science/api/pith-number/K5C7XGCUYP5TYK7I4V767672D4/events.json","paper":"https://pith.science/paper/K5C7XGCU"},"agent_actions":{"view_html":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4","download_json":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4.json","view_paper":"https://pith.science/paper/K5C7XGCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06653&json=true","fetch_graph":"https://pith.science/api/pith-number/K5C7XGCUYP5TYK7I4V767672D4/graph.json","fetch_events":"https://pith.science/api/pith-number/K5C7XGCUYP5TYK7I4V767672D4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4/action/storage_attestation","attest_author":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4/action/author_attestation","sign_citation":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4/action/citation_signature","submit_replication":"https://pith.science/pith/K5C7XGCUYP5TYK7I4V767672D4/action/replication_record"}},"created_at":"2026-05-17T23:58:09.635911+00:00","updated_at":"2026-05-17T23:58:09.635911+00:00"}