{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XOQVHDXPCMTYDJIHQYSXLQWSSA","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":"f47d1ca164911ab5add2d671cc0d3c0372484f6331a0556c5989133198229c10","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-10T12:30:31Z","title_canon_sha256":"e240ee9ced1cde66b475315e6892b3505c71745e1a681f6e3996814d33a72e44"},"schema_version":"1.0","source":{"id":"1306.2182","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2182","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2182v2","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2182","created_at":"2026-05-18T02:51:42Z"},{"alias_kind":"pith_short_12","alias_value":"XOQVHDXPCMTY","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XOQVHDXPCMTYDJIH","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XOQVHDXP","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:76a753cda8caf86481be9148552d4e3ff8ecd4d94eafd8386519218ce5d7652e","target":"graph","created_at":"2026-05-18T02:51:42Z","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":"Interval graphs are intersection graphs of closed intervals of the real-line. The well-known computational problem, called recognition, asks whether an input graph $G$ can be represented by closed intervals, i.e., whether $G$ is an interval graph. There are several linear-time algorithms known for recognizing interval graphs, the oldest one is by Booth and Lueker [J. Comput. System Sci., 13 (1976)] based on PQ-trees.\n  In this paper, we study a generalization of recognition, called partial representation extension. The input of this problem consists of a graph $G$ with a partial representation","authors_text":"Jan Kratochv\\'il, Pavel Klav\\'ik, Tom\\'a\\v{s} Vysko\\v{c}il, Toshiki Saitoh, Yota Otachi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-10T12:30:31Z","title":"Extending Partial Representations of Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2182","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:b17fedc7a0d722511381a11b31ccf2045259c9a73705e7d0b86d5674ecf4a958","target":"record","created_at":"2026-05-18T02:51:42Z","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":"f47d1ca164911ab5add2d671cc0d3c0372484f6331a0556c5989133198229c10","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-10T12:30:31Z","title_canon_sha256":"e240ee9ced1cde66b475315e6892b3505c71745e1a681f6e3996814d33a72e44"},"schema_version":"1.0","source":{"id":"1306.2182","kind":"arxiv","version":2}},"canonical_sha256":"bba1538eef132781a507862575c2d2902ed3ed363225fa2d8cf9dac59bb43b13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bba1538eef132781a507862575c2d2902ed3ed363225fa2d8cf9dac59bb43b13","first_computed_at":"2026-05-18T02:51:42.313080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:42.313080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsYtQshqZzV7IYbpOJf0zIcOAUPkoBuDcsoe56/ZBJ8gpJuzHdqTlV5zQ7rPvlYTbxSlsmsC6FWCiHj5t+MnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:42.313508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2182","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b17fedc7a0d722511381a11b31ccf2045259c9a73705e7d0b86d5674ecf4a958","sha256:76a753cda8caf86481be9148552d4e3ff8ecd4d94eafd8386519218ce5d7652e"],"state_sha256":"a6a2ee6828944471d056f5d2114cf746d090cf791937605bd440b149b1e3e866"}