{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q7YFKOGNY5IC5BT7ZPGD6OSGLF","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":"87d20d18faa7b57cdfc7695ca5a620995a945487521df9a659f68aa51f56c101","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T11:27:38Z","title_canon_sha256":"ca9f6e0c6570ce0acd74da72654006ee125bac2d92b123c85a95e4c262f3949f"},"schema_version":"1.0","source":{"id":"1403.1081","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1081","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1081v3","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1081","created_at":"2026-05-18T01:34:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q7YFKOGNY5IC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q7YFKOGNY5IC5BT7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q7YFKOGN","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:7e371d5bf45ba051b44a38a14ef0dd737e903c4ddc67859039f4e55ff58c3abb","target":"graph","created_at":"2026-05-18T01:34:59Z","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":"Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every $n$-vertex distance-hereditary graph, equivalently a graph of rank-width at most $1$, can be computed in time $\\mathcal{O}(n^2\\cdot \\log_2 n)$, and a linear layout witnessing the linear rank-width can be computed with the same time complexity. As a corollary, we show that the path-width of every $n$-element matroid of branch-width at most $2$ can be computed in time $\\mathcal{O}(n^2\\cdot \\log_2 n)$, provided that the matroid is gi","authors_text":"Isolde Adler, Mamadou Moustapha Kant\\'e, O-joung Kwon","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T11:27:38Z","title":"Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1081","kind":"arxiv","version":3},"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:16e083bb97005ea7215ec078fcafbcb9ac0282df7526ac6bcf6e8cf8c8a1a735","target":"record","created_at":"2026-05-18T01:34:59Z","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":"87d20d18faa7b57cdfc7695ca5a620995a945487521df9a659f68aa51f56c101","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-05T11:27:38Z","title_canon_sha256":"ca9f6e0c6570ce0acd74da72654006ee125bac2d92b123c85a95e4c262f3949f"},"schema_version":"1.0","source":{"id":"1403.1081","kind":"arxiv","version":3}},"canonical_sha256":"87f05538cdc7502e867fcbcc3f3a465955c9ae07e8b1e12a70b3b824c3ba6605","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87f05538cdc7502e867fcbcc3f3a465955c9ae07e8b1e12a70b3b824c3ba6605","first_computed_at":"2026-05-18T01:34:59.370824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:59.370824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OxR5UnoP64vfPywheta8vMzv8PvN8AQMqIh2zXSaa3Af9KBroFoURa9p0VilFHZc91x9foZ9dzCtny+ZUnLjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:59.371522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1081","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e083bb97005ea7215ec078fcafbcb9ac0282df7526ac6bcf6e8cf8c8a1a735","sha256:7e371d5bf45ba051b44a38a14ef0dd737e903c4ddc67859039f4e55ff58c3abb"],"state_sha256":"0c57380fa4f78a6d319dce3d996c5ecd90e6a9080fcd3c668ea305337641b1df"}