{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XOQVHDXPCMTYDJIHQYSXLQWSSA","short_pith_number":"pith:XOQVHDXP","schema_version":"1.0","canonical_sha256":"bba1538eef132781a507862575c2d2902ed3ed363225fa2d8cf9dac59bb43b13","source":{"kind":"arxiv","id":"1306.2182","version":2},"attestation_state":"computed","paper":{"title":"Extending Partial Representations of Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jan Kratochv\\'il, Pavel Klav\\'ik, Tom\\'a\\v{s} Vysko\\v{c}il, Toshiki Saitoh, Yota Otachi","submitted_at":"2013-06-10T12:30:31Z","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"},"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":"1306.2182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-10T12:30:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e240ee9ced1cde66b475315e6892b3505c71745e1a681f6e3996814d33a72e44","abstract_canon_sha256":"f47d1ca164911ab5add2d671cc0d3c0372484f6331a0556c5989133198229c10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:42.313508Z","signature_b64":"HsYtQshqZzV7IYbpOJf0zIcOAUPkoBuDcsoe56/ZBJ8gpJuzHdqTlV5zQ7rPvlYTbxSlsmsC6FWCiHj5t+MnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bba1538eef132781a507862575c2d2902ed3ed363225fa2d8cf9dac59bb43b13","last_reissued_at":"2026-05-18T02:51:42.313080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:42.313080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending Partial Representations of Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jan Kratochv\\'il, Pavel Klav\\'ik, Tom\\'a\\v{s} Vysko\\v{c}il, Toshiki Saitoh, Yota Otachi","submitted_at":"2013-06-10T12:30:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2182","kind":"arxiv","version":2},"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":"1306.2182","created_at":"2026-05-18T02:51:42.313139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2182v2","created_at":"2026-05-18T02:51:42.313139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2182","created_at":"2026-05-18T02:51:42.313139+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOQVHDXPCMTY","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOQVHDXPCMTYDJIH","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOQVHDXP","created_at":"2026-05-18T12:28:06.772260+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/XOQVHDXPCMTYDJIHQYSXLQWSSA","json":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA.json","graph_json":"https://pith.science/api/pith-number/XOQVHDXPCMTYDJIHQYSXLQWSSA/graph.json","events_json":"https://pith.science/api/pith-number/XOQVHDXPCMTYDJIHQYSXLQWSSA/events.json","paper":"https://pith.science/paper/XOQVHDXP"},"agent_actions":{"view_html":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA","download_json":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA.json","view_paper":"https://pith.science/paper/XOQVHDXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2182&json=true","fetch_graph":"https://pith.science/api/pith-number/XOQVHDXPCMTYDJIHQYSXLQWSSA/graph.json","fetch_events":"https://pith.science/api/pith-number/XOQVHDXPCMTYDJIHQYSXLQWSSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA/action/storage_attestation","attest_author":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA/action/author_attestation","sign_citation":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA/action/citation_signature","submit_replication":"https://pith.science/pith/XOQVHDXPCMTYDJIHQYSXLQWSSA/action/replication_record"}},"created_at":"2026-05-18T02:51:42.313139+00:00","updated_at":"2026-05-18T02:51:42.313139+00:00"}