{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CXIUSDRFHV6TKBX2PGAHMHJ3FL","short_pith_number":"pith:CXIUSDRF","schema_version":"1.0","canonical_sha256":"15d1490e253d7d3506fa7980761d3b2acb6c202200206f15834afbd104f51165","source":{"kind":"arxiv","id":"1406.6228","version":3},"attestation_state":"computed","paper":{"title":"Minimal Obstructions for Partial Representations of Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Saumell, Pavel Klav\\'ik","submitted_at":"2014-06-24T13:15:06Z","abstract_excerpt":"Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solving this problem.\n  In this paper, we characterize the minimal obstructions which make partial representations non-extendible. This generalizes Lekkerkerker and Boland's characterization of the minimal for"},"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":"1406.6228","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-24T13:15:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"17d9e93b2cf4b7006c6386020c61bbd702ecf5b5162dae9a847f583531d6b829","abstract_canon_sha256":"440c917db2ee6a45ea63dc8036e3103aa63f7ee6469f880d630eb60a8d84b47f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:21.245635Z","signature_b64":"fwgEuS8g9rt5O95CRbxeGtLIJQ8NfgmDblYJKw1yQtowM9ly4tc2wIhyE1yj3FFD9KQHDMGkKrnGfmcRUvcwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d1490e253d7d3506fa7980761d3b2acb6c202200206f15834afbd104f51165","last_reissued_at":"2026-05-18T01:20:21.245179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:21.245179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Obstructions for Partial Representations of Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Saumell, Pavel Klav\\'ik","submitted_at":"2014-06-24T13:15:06Z","abstract_excerpt":"Interval graphs are intersection graphs of closed intervals. A generalization of recognition called partial representation extension was introduced recently. The input gives an interval graph with a partial representation specifying some pre-drawn intervals. We ask whether the remaining intervals can be added to create an extending representation. Two linear-time algorithms are known for solving this problem.\n  In this paper, we characterize the minimal obstructions which make partial representations non-extendible. This generalizes Lekkerkerker and Boland's characterization of the minimal for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6228","kind":"arxiv","version":3},"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":"1406.6228","created_at":"2026-05-18T01:20:21.245241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6228v3","created_at":"2026-05-18T01:20:21.245241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6228","created_at":"2026-05-18T01:20:21.245241+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXIUSDRFHV6T","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXIUSDRFHV6TKBX2","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXIUSDRF","created_at":"2026-05-18T12:28:25.294606+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/CXIUSDRFHV6TKBX2PGAHMHJ3FL","json":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL.json","graph_json":"https://pith.science/api/pith-number/CXIUSDRFHV6TKBX2PGAHMHJ3FL/graph.json","events_json":"https://pith.science/api/pith-number/CXIUSDRFHV6TKBX2PGAHMHJ3FL/events.json","paper":"https://pith.science/paper/CXIUSDRF"},"agent_actions":{"view_html":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL","download_json":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL.json","view_paper":"https://pith.science/paper/CXIUSDRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6228&json=true","fetch_graph":"https://pith.science/api/pith-number/CXIUSDRFHV6TKBX2PGAHMHJ3FL/graph.json","fetch_events":"https://pith.science/api/pith-number/CXIUSDRFHV6TKBX2PGAHMHJ3FL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL/action/storage_attestation","attest_author":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL/action/author_attestation","sign_citation":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL/action/citation_signature","submit_replication":"https://pith.science/pith/CXIUSDRFHV6TKBX2PGAHMHJ3FL/action/replication_record"}},"created_at":"2026-05-18T01:20:21.245241+00:00","updated_at":"2026-05-18T01:20:21.245241+00:00"}