{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2PYPWPGUXFZVTBYCEJQRSNF6NC","short_pith_number":"pith:2PYPWPGU","canonical_record":{"source":{"id":"1402.0851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-04T20:13:32Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"c61602119365863d7ed806d9cf1b033c1cb3e3ac90fc695d8bdfd11cd42961cd","abstract_canon_sha256":"6f562bd21e0203114ef9b3fef29f793bbe09b0ecba287c1fba43fe2219ee9b3a"},"schema_version":"1.0"},"canonical_sha256":"d3f0fb3cd4b97359870222611934be6884115493f9a017cc9f3543afd289ae67","source":{"kind":"arxiv","id":"1402.0851","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0851","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0851v2","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0851","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"2PYPWPGUXFZV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2PYPWPGUXFZVTBYC","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2PYPWPGU","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2PYPWPGUXFZVTBYCEJQRSNF6NC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-04T20:13:32Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"c61602119365863d7ed806d9cf1b033c1cb3e3ac90fc695d8bdfd11cd42961cd","abstract_canon_sha256":"6f562bd21e0203114ef9b3fef29f793bbe09b0ecba287c1fba43fe2219ee9b3a"},"schema_version":"1.0"},"canonical_sha256":"d3f0fb3cd4b97359870222611934be6884115493f9a017cc9f3543afd289ae67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:09.027296Z","signature_b64":"sAId1mSuZKwrzby+P5iYLOBnVmTHO4KqXl79/Lw/SKUwP34PcrQXNJIIDSp628gHLBTkTMuJnjryaX6Jhm/LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3f0fb3cd4b97359870222611934be6884115493f9a017cc9f3543afd289ae67","last_reissued_at":"2026-05-18T01:23:09.026849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:09.026849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0851","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-18T01:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k97L6m56nsw/3+xIbGB3B2yIetl8CNy112cCH9QoeR/4qd562/M1roIQgFfJfDgjTH075L0CGUFQ07ye6y/GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:50.050195Z"},"content_sha256":"437a570160cdc85c89681428e9020a5cc8185c6ca3bf8155ba39c070396a3101","schema_version":"1.0","event_id":"sha256:437a570160cdc85c89681428e9020a5cc8185c6ca3bf8155ba39c070396a3101"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2PYPWPGUXFZVTBYCEJQRSNF6NC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval scheduling and colorful independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Mathias Weller, Matthias Mnich, Ren\\'e van Bevern, Rolf Niedermeier","submitted_at":"2014-02-04T20:13:32Z","abstract_excerpt":"Numerous applications in scheduling, such as resource allocation or steel manufacturing, can be modeled using the NP-hard Independent Set problem (given an undirected graph and an integer k, find a set of at least k pairwise non-adjacent vertices). Here, one encounters special graph classes like 2-union graphs (edge-wise unions of two interval graphs) and strip graphs (edge-wise unions of an interval graph and a cluster graph), on which Independent Set remains NP-hard but admits constant-ratio approximations in polynomial time. We study the parameterized complexity of Independent Set on 2-unio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0851","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-18T01:23:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYu6G2CJPMb5tYYB5y170EjCoF8ZI3qJRHD2NEOEJ92fzBJS/H8GBAijDJlFLcPZutNYNNvUsi88+aaDniI4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:50.050584Z"},"content_sha256":"8ece588de9d1840866f3779ee6d6d2da696105d98dff3bd5f8e4f5e3363b296c","schema_version":"1.0","event_id":"sha256:8ece588de9d1840866f3779ee6d6d2da696105d98dff3bd5f8e4f5e3363b296c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC/bundle.json","state_url":"https://pith.science/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC/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-30T08:23:50Z","links":{"resolver":"https://pith.science/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC","bundle":"https://pith.science/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC/bundle.json","state":"https://pith.science/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PYPWPGUXFZVTBYCEJQRSNF6NC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2PYPWPGUXFZVTBYCEJQRSNF6NC","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":"6f562bd21e0203114ef9b3fef29f793bbe09b0ecba287c1fba43fe2219ee9b3a","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-04T20:13:32Z","title_canon_sha256":"c61602119365863d7ed806d9cf1b033c1cb3e3ac90fc695d8bdfd11cd42961cd"},"schema_version":"1.0","source":{"id":"1402.0851","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0851","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0851v2","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0851","created_at":"2026-05-18T01:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"2PYPWPGUXFZV","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2PYPWPGUXFZVTBYC","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2PYPWPGU","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:8ece588de9d1840866f3779ee6d6d2da696105d98dff3bd5f8e4f5e3363b296c","target":"graph","created_at":"2026-05-18T01:23: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":"Numerous applications in scheduling, such as resource allocation or steel manufacturing, can be modeled using the NP-hard Independent Set problem (given an undirected graph and an integer k, find a set of at least k pairwise non-adjacent vertices). Here, one encounters special graph classes like 2-union graphs (edge-wise unions of two interval graphs) and strip graphs (edge-wise unions of an interval graph and a cluster graph), on which Independent Set remains NP-hard but admits constant-ratio approximations in polynomial time. We study the parameterized complexity of Independent Set on 2-unio","authors_text":"Mathias Weller, Matthias Mnich, Ren\\'e van Bevern, Rolf Niedermeier","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-04T20:13:32Z","title":"Interval scheduling and colorful independent sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0851","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:437a570160cdc85c89681428e9020a5cc8185c6ca3bf8155ba39c070396a3101","target":"record","created_at":"2026-05-18T01:23: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":"6f562bd21e0203114ef9b3fef29f793bbe09b0ecba287c1fba43fe2219ee9b3a","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-04T20:13:32Z","title_canon_sha256":"c61602119365863d7ed806d9cf1b033c1cb3e3ac90fc695d8bdfd11cd42961cd"},"schema_version":"1.0","source":{"id":"1402.0851","kind":"arxiv","version":2}},"canonical_sha256":"d3f0fb3cd4b97359870222611934be6884115493f9a017cc9f3543afd289ae67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3f0fb3cd4b97359870222611934be6884115493f9a017cc9f3543afd289ae67","first_computed_at":"2026-05-18T01:23:09.026849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:09.026849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAId1mSuZKwrzby+P5iYLOBnVmTHO4KqXl79/Lw/SKUwP34PcrQXNJIIDSp628gHLBTkTMuJnjryaX6Jhm/LBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:09.027296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0851","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:437a570160cdc85c89681428e9020a5cc8185c6ca3bf8155ba39c070396a3101","sha256:8ece588de9d1840866f3779ee6d6d2da696105d98dff3bd5f8e4f5e3363b296c"],"state_sha256":"a4ed1c537e2fb6bb4a693eaa7762c43d0f62a9a1d6ba9e7d9d7ed64fc075f70d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6/8qmCnfcCtgsE25zBnGHh/TcV6ih6RRq7nNz6JOcEMOZzk5haQ6Jl/I1CRBwR5Sfzgnzd6U3pQoIb+i47VAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:23:50.052932Z","bundle_sha256":"8894af352eac52a720ca2590b84b9934865c411694528c1db9b4ef2d2ad51d29"}}