{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FKLSJMFO4J77GJHJ5CDKEVQPKS","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":"f6542099ef8b591062655134ff00b5537dd876229e66296c162ee6716db8ee6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-11T21:38:15Z","title_canon_sha256":"5bc900bf6611074bd202bfae401801ccd20fb16ddddfb00d19435a9bf90d85b4"},"schema_version":"1.0","source":{"id":"1311.2618","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2618","created_at":"2026-05-18T02:43:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2618v2","created_at":"2026-05-18T02:43:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2618","created_at":"2026-05-18T02:43:16Z"},{"alias_kind":"pith_short_12","alias_value":"FKLSJMFO4J77","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FKLSJMFO4J77GJHJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FKLSJMFO","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:d11edab2d7df155ce87cfc2d1878b675d8d8ad1d8b202c1a9a78451fa504c41a","target":"graph","created_at":"2026-05-18T02:43:16Z","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 graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each $k$, there is a finite obstruction set $\\mathcal{O}_k$ of graphs such that a graph $G$ has linear rank-width at most $k$ if and only if no vertex-minor of $G$ is isomorphic to a graph in $\\mathcal{O}_k$. However, no attempts have been made to bound the number of graphs in $\\mathcal{O}_k$ for $k\\ge 2$. We show that for each $k$, there are at least $2^{\\Omega(3^k)}$ pairwise locally non-equivalent graphs in $\\mathcal{O}_k$, and ther","authors_text":"Jisu Jeong, O-joung Kwon, Sang-il Oum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-11T21:38:15Z","title":"Excluded vertex-minors for graphs of linear rank-width at most k"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2618","kind":"arxiv","version":2},"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:627cc9125169a1405870387685e322dad332f79b4754a8e387f1f6f8e77062ff","target":"record","created_at":"2026-05-18T02:43:16Z","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":"f6542099ef8b591062655134ff00b5537dd876229e66296c162ee6716db8ee6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-11T21:38:15Z","title_canon_sha256":"5bc900bf6611074bd202bfae401801ccd20fb16ddddfb00d19435a9bf90d85b4"},"schema_version":"1.0","source":{"id":"1311.2618","kind":"arxiv","version":2}},"canonical_sha256":"2a9724b0aee27ff324e9e886a2560f54bdd869811f0a0bca9865088ba776002f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a9724b0aee27ff324e9e886a2560f54bdd869811f0a0bca9865088ba776002f","first_computed_at":"2026-05-18T02:43:16.442634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:16.442634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C4ZBY8sXRYUvCrBrs5rVt6HVj06a4rt0DbIuNnZ1bYtNpCFCR1Wa0X/UdC6bSLPbCLZmpjO2bmjd/A3H+Vr0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:16.443074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2618","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:627cc9125169a1405870387685e322dad332f79b4754a8e387f1f6f8e77062ff","sha256:d11edab2d7df155ce87cfc2d1878b675d8d8ad1d8b202c1a9a78451fa504c41a"],"state_sha256":"66d5889975d69737474fc93325ab7b0b794a71b6feee624dd37e02acd494ee19"}