{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RKUCX42TE6XHJOQU3CG4DSZGLG","short_pith_number":"pith:RKUCX42T","canonical_record":{"source":{"id":"1603.02611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T18:11:14Z","cross_cats_sorted":[],"title_canon_sha256":"ee41d39735a1c848d8a755ddebb5d1d7819c909eaa5b1ccc26baa87629780259","abstract_canon_sha256":"a87df59c9a7392145e0c8cec2b2327c8c024310001a9c3224590ee43ab0d2de2"},"schema_version":"1.0"},"canonical_sha256":"8aa82bf35327ae74ba14d88dc1cb2659ae3592f8fabe9df25c255eb4c499e2d7","source":{"kind":"arxiv","id":"1603.02611","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02611","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02611v2","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02611","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"RKUCX42TE6XH","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RKUCX42TE6XHJOQU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RKUCX42T","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RKUCX42TE6XHJOQU3CG4DSZGLG","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T18:11:14Z","cross_cats_sorted":[],"title_canon_sha256":"ee41d39735a1c848d8a755ddebb5d1d7819c909eaa5b1ccc26baa87629780259","abstract_canon_sha256":"a87df59c9a7392145e0c8cec2b2327c8c024310001a9c3224590ee43ab0d2de2"},"schema_version":"1.0"},"canonical_sha256":"8aa82bf35327ae74ba14d88dc1cb2659ae3592f8fabe9df25c255eb4c499e2d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:37.948376Z","signature_b64":"S1QrkPg3iqQ7YDdbhr/UYWDieZLiNJd6TS++nAUU+G8CQ4n1bSzsi7muvfwT9sOIG11MhR3u/YoF5IRtrXKpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aa82bf35327ae74ba14d88dc1cb2659ae3592f8fabe9df25c255eb4c499e2d7","last_reissued_at":"2026-05-18T00:26:37.947552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:37.947552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02611","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-18T00:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCORgBOm5Kx03cqHi+SqgKmFYp4sefquK8aB8mEiSbCw2AM3BJ3oV7RRMhFFVgvFoLy6A9Z81TabwZMD47XGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:31:14.714829Z"},"content_sha256":"4388684143de8171c213647c966c29db862a05fdde2f9c6fb7e1e3650ad57f68","schema_version":"1.0","event_id":"sha256:4388684143de8171c213647c966c29db862a05fdde2f9c6fb7e1e3650ad57f68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RKUCX42TE6XHJOQU3CG4DSZGLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling meets n-fold Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Du\\v{s}an Knop, Martin Kouteck\\'y","submitted_at":"2016-03-08T18:11:14Z","abstract_excerpt":"Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact solutions when some part of the input is a fixed parameter. In 2014, Mnich and Wiese initiated a systematic study in this direction.\n  In this paper we continue this study and show that several additional cases of fundamental scheduling problems are fixed parameter tractable for some natural parameters. Our main tool is n-fold integer programming, a recent variable dimension technique which we believe to be highly r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02611","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-18T00:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rz2N1jfcF/mEBxiZ8DCXacTHmykYnji5nypKFW6r7z2xAyrRVxEBSoBWXPPm3zeQmUM/+Gio5hFkAX+MkafABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:31:14.715397Z"},"content_sha256":"39e89194b949ea2e8aad8796e7867cd9e95897318e8c50e427d6cabfc03a4a0d","schema_version":"1.0","event_id":"sha256:39e89194b949ea2e8aad8796e7867cd9e95897318e8c50e427d6cabfc03a4a0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RKUCX42TE6XHJOQU3CG4DSZGLG/bundle.json","state_url":"https://pith.science/pith/RKUCX42TE6XHJOQU3CG4DSZGLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RKUCX42TE6XHJOQU3CG4DSZGLG/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-29T19:31:14Z","links":{"resolver":"https://pith.science/pith/RKUCX42TE6XHJOQU3CG4DSZGLG","bundle":"https://pith.science/pith/RKUCX42TE6XHJOQU3CG4DSZGLG/bundle.json","state":"https://pith.science/pith/RKUCX42TE6XHJOQU3CG4DSZGLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RKUCX42TE6XHJOQU3CG4DSZGLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RKUCX42TE6XHJOQU3CG4DSZGLG","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":"a87df59c9a7392145e0c8cec2b2327c8c024310001a9c3224590ee43ab0d2de2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T18:11:14Z","title_canon_sha256":"ee41d39735a1c848d8a755ddebb5d1d7819c909eaa5b1ccc26baa87629780259"},"schema_version":"1.0","source":{"id":"1603.02611","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02611","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02611v2","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02611","created_at":"2026-05-18T00:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"RKUCX42TE6XH","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RKUCX42TE6XHJOQU","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RKUCX42T","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:39e89194b949ea2e8aad8796e7867cd9e95897318e8c50e427d6cabfc03a4a0d","target":"graph","created_at":"2026-05-18T00:26:37Z","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":"Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact solutions when some part of the input is a fixed parameter. In 2014, Mnich and Wiese initiated a systematic study in this direction.\n  In this paper we continue this study and show that several additional cases of fundamental scheduling problems are fixed parameter tractable for some natural parameters. Our main tool is n-fold integer programming, a recent variable dimension technique which we believe to be highly r","authors_text":"Du\\v{s}an Knop, Martin Kouteck\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T18:11:14Z","title":"Scheduling meets n-fold Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02611","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:4388684143de8171c213647c966c29db862a05fdde2f9c6fb7e1e3650ad57f68","target":"record","created_at":"2026-05-18T00:26:37Z","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":"a87df59c9a7392145e0c8cec2b2327c8c024310001a9c3224590ee43ab0d2de2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T18:11:14Z","title_canon_sha256":"ee41d39735a1c848d8a755ddebb5d1d7819c909eaa5b1ccc26baa87629780259"},"schema_version":"1.0","source":{"id":"1603.02611","kind":"arxiv","version":2}},"canonical_sha256":"8aa82bf35327ae74ba14d88dc1cb2659ae3592f8fabe9df25c255eb4c499e2d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8aa82bf35327ae74ba14d88dc1cb2659ae3592f8fabe9df25c255eb4c499e2d7","first_computed_at":"2026-05-18T00:26:37.947552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:37.947552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S1QrkPg3iqQ7YDdbhr/UYWDieZLiNJd6TS++nAUU+G8CQ4n1bSzsi7muvfwT9sOIG11MhR3u/YoF5IRtrXKpAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:37.948376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02611","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4388684143de8171c213647c966c29db862a05fdde2f9c6fb7e1e3650ad57f68","sha256:39e89194b949ea2e8aad8796e7867cd9e95897318e8c50e427d6cabfc03a4a0d"],"state_sha256":"7180f380e12589f02a0a84ea16404d58058cb282f6423ee0de8c88da66f52a7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gj7TBNwuQVWaVw5cRjSh1hKioVu4NkUJzDfeAx7e9jnDXajCTDrrQoMnaFyIj1YEb9kWn8W8B3JdEMV38uFvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:31:14.718016Z","bundle_sha256":"4056d925aa28953b9b30d99f76393dea96fe94afd3d681094ceefc0c53b72269"}}