{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DXK5GOTXDPAI2ZEUNVHBYPPNV4","short_pith_number":"pith:DXK5GOTX","canonical_record":{"source":{"id":"1112.3244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-14T15:06:52Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"98aa401341ccc107f997e57247afd8b2a60e1b7ca267e062d29cccc9632b0eb7","abstract_canon_sha256":"a13eca1ab6332126efd11b70f28e6d9ff1bb99f8032b5db26928d54e76c1255e"},"schema_version":"1.0"},"canonical_sha256":"1dd5d33a771bc08d64946d4e1c3dedaf05fb8acc01a512d8eaf5bf594cc94f41","source":{"kind":"arxiv","id":"1112.3244","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3244","created_at":"2026-05-18T04:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3244v2","created_at":"2026-05-18T04:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3244","created_at":"2026-05-18T04:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"DXK5GOTXDPAI","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DXK5GOTXDPAI2ZEU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DXK5GOTX","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DXK5GOTXDPAI2ZEUNVHBYPPNV4","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-14T15:06:52Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"98aa401341ccc107f997e57247afd8b2a60e1b7ca267e062d29cccc9632b0eb7","abstract_canon_sha256":"a13eca1ab6332126efd11b70f28e6d9ff1bb99f8032b5db26928d54e76c1255e"},"schema_version":"1.0"},"canonical_sha256":"1dd5d33a771bc08d64946d4e1c3dedaf05fb8acc01a512d8eaf5bf594cc94f41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:09.218624Z","signature_b64":"g70DUs7Yq2H+ZfjcyG85SldPDfzI3+l1WPEvgaMLPp+fLA2M1u9osUnRf7QxKTAZMfmQogbAhxu1xLlR73lmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd5d33a771bc08d64946d4e1c3dedaf05fb8acc01a512d8eaf5bf594cc94f41","last_reissued_at":"2026-05-18T04:06:09.218109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:09.218109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3244","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:06:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oBnkCVf0h3yZdyMqFBLDpSPJMmgD96zml4yPLJdBHeA09hkmNpyLv6m4fF2EdXZu9g44mN5jm/J6vXrYt9kCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:00.920625Z"},"content_sha256":"3b56a6858566a62e79a956c4bd7ff0d699591ac5842b4f17d9ad000c0037e546","schema_version":"1.0","event_id":"sha256:3b56a6858566a62e79a956c4bd7ff0d699591ac5842b4f17d9ad000c0037e546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DXK5GOTXDPAI2ZEUNVHBYPPNV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-Gap Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Erik Jan van Leeuwen, Fedor V. Fomin, Karol Suchan, Martin Vatshelle, Petr Golovach, Serge Gaspers, Stefan Szeider, Yngve Villanger","submitted_at":"2011-12-14T15:06:52Z","abstract_excerpt":"We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty intersection with an interval associated to the other vertex. A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n+k intervals in total. In order to scale up the nice algorithmic properties of interval graphs (where k=0), we parameterize graph problems by k,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3244","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:06:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBENM2kP8w6tahUgZRGynrTcSD3GqM3ACzGL+xFghSBaTNLmnRcv5i8rsKHtrAXjqfHkLvOanWskXkzip9H+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:00.920974Z"},"content_sha256":"34aeb299e1c4caea3efd705ba5c7b7ec39611421e3924ff53248ff0c9fa30f5a","schema_version":"1.0","event_id":"sha256:34aeb299e1c4caea3efd705ba5c7b7ec39611421e3924ff53248ff0c9fa30f5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4/bundle.json","state_url":"https://pith.science/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T18:15:00Z","links":{"resolver":"https://pith.science/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4","bundle":"https://pith.science/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4/bundle.json","state":"https://pith.science/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXK5GOTXDPAI2ZEUNVHBYPPNV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DXK5GOTXDPAI2ZEUNVHBYPPNV4","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":"a13eca1ab6332126efd11b70f28e6d9ff1bb99f8032b5db26928d54e76c1255e","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-14T15:06:52Z","title_canon_sha256":"98aa401341ccc107f997e57247afd8b2a60e1b7ca267e062d29cccc9632b0eb7"},"schema_version":"1.0","source":{"id":"1112.3244","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3244","created_at":"2026-05-18T04:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3244v2","created_at":"2026-05-18T04:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3244","created_at":"2026-05-18T04:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"DXK5GOTXDPAI","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DXK5GOTXDPAI2ZEU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DXK5GOTX","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:34aeb299e1c4caea3efd705ba5c7b7ec39611421e3924ff53248ff0c9fa30f5a","target":"graph","created_at":"2026-05-18T04:06:09Z","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":"We initiate the study of a new parameterization of graph problems. In a multiple interval representation of a graph, each vertex is associated to at least one interval of the real line, with an edge between two vertices if and only if an interval associated to one vertex has a nonempty intersection with an interval associated to the other vertex. A graph on n vertices is a k-gap interval graph if it has a multiple interval representation with at most n+k intervals in total. In order to scale up the nice algorithmic properties of interval graphs (where k=0), we parameterize graph problems by k,","authors_text":"Erik Jan van Leeuwen, Fedor V. Fomin, Karol Suchan, Martin Vatshelle, Petr Golovach, Serge Gaspers, Stefan Szeider, Yngve Villanger","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-14T15:06:52Z","title":"k-Gap Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3244","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:3b56a6858566a62e79a956c4bd7ff0d699591ac5842b4f17d9ad000c0037e546","target":"record","created_at":"2026-05-18T04:06:09Z","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":"a13eca1ab6332126efd11b70f28e6d9ff1bb99f8032b5db26928d54e76c1255e","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-14T15:06:52Z","title_canon_sha256":"98aa401341ccc107f997e57247afd8b2a60e1b7ca267e062d29cccc9632b0eb7"},"schema_version":"1.0","source":{"id":"1112.3244","kind":"arxiv","version":2}},"canonical_sha256":"1dd5d33a771bc08d64946d4e1c3dedaf05fb8acc01a512d8eaf5bf594cc94f41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dd5d33a771bc08d64946d4e1c3dedaf05fb8acc01a512d8eaf5bf594cc94f41","first_computed_at":"2026-05-18T04:06:09.218109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:09.218109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g70DUs7Yq2H+ZfjcyG85SldPDfzI3+l1WPEvgaMLPp+fLA2M1u9osUnRf7QxKTAZMfmQogbAhxu1xLlR73lmDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:09.218624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3244","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b56a6858566a62e79a956c4bd7ff0d699591ac5842b4f17d9ad000c0037e546","sha256:34aeb299e1c4caea3efd705ba5c7b7ec39611421e3924ff53248ff0c9fa30f5a"],"state_sha256":"0512a0ffa80d6eae35e632dfa732f596e4f8f162ad7bad1e9a6d0405757a459c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZW97GX+Fbc6LmuoDiMZ9ZsDEufT/wRw0ylQAG6tRkpCnwTaS8b/tY2Xpy+SJ/paetzJDuHHRVI9HSfCM+5IBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:15:01.089234Z","bundle_sha256":"b0b037722d9f05d6cde42e706e7f84f1f82492ed3ab0ac6a1ce0a1f8cc1eefee"}}