{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PSBPDG56MWUXW42TJVEV5GETK2","short_pith_number":"pith:PSBPDG56","canonical_record":{"source":{"id":"1605.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-03T13:37:56Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"534aad6ab4bbdd891e5570483a9d85ea2b2e1f603a69b78b27aa3dbc32b7156f","abstract_canon_sha256":"75ba8b8b77aafc6f724297ef5f66d2e588df9ffc47f4b21a28ca95677ab2de8f"},"schema_version":"1.0"},"canonical_sha256":"7c82f19bbe65a97b73534d495e989356b9ce4adefb7ec1cf787dda9a19e7a139","source":{"kind":"arxiv","id":"1605.00901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00901","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00901v1","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00901","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"PSBPDG56MWUX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PSBPDG56MWUXW42T","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PSBPDG56","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PSBPDG56MWUXW42TJVEV5GETK2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-03T13:37:56Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"534aad6ab4bbdd891e5570483a9d85ea2b2e1f603a69b78b27aa3dbc32b7156f","abstract_canon_sha256":"75ba8b8b77aafc6f724297ef5f66d2e588df9ffc47f4b21a28ca95677ab2de8f"},"schema_version":"1.0"},"canonical_sha256":"7c82f19bbe65a97b73534d495e989356b9ce4adefb7ec1cf787dda9a19e7a139","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:47.711403Z","signature_b64":"3xHK9NZ1SUupyLP6DApX2wnFD/F4IpJ3XnTNIrbIaC4YV0rMhoCRksy1xodNmxm+CGxQvnbm9ZP5u7wJ/JlACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c82f19bbe65a97b73534d495e989356b9ce4adefb7ec1cf787dda9a19e7a139","last_reissued_at":"2026-05-18T01:15:47.710892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:47.710892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00901","source_version":1,"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:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XkbP6LgZmb+CA2EPDSHrfT+WEHvNBj7hGojSkCP2MjqI8simgkGuFe3xqtbVL+5ElIc2SX/pcoIo76KsCwKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:27:27.933367Z"},"content_sha256":"3ffffdcd441275af9ce370723a04ba50b30c36ddafc3276dd78d09bdfcad12ed","schema_version":"1.0","event_id":"sha256:3ffffdcd441275af9ce370723a04ba50b30c36ddafc3276dd78d09bdfcad12ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PSBPDG56MWUXW42TJVEV5GETK2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precedence-constrained scheduling problems parameterized by partial order width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Christian Komusiewicz, Gerhard J. Woeginger, Laurent Bulteau, Nimrod Talmon, Ren\\'e van Bevern, Robert Bredereck","submitted_at":"2016-05-03T13:37:56Z","abstract_excerpt":"Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\\in}\\{1,2\\}$|$C_{\\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 and 2 on two parallel identical machines, is W[2]-hard parameterized by the width of the partial order giving the precedence constraints. To this end, we show that Shuffle Product, the problem of deciding whether a given word can be obtained by interleaving the letters of $k$ other given words, is W[2]-hard parameterized by $k$, thus additional"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00901","kind":"arxiv","version":1},"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:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvqM5f6VW+tQE/Lut4jboynJH+9KtUC+Dtrp82xOUW/gGdscdzgkQJ3Oi5jJIfvDVlk0Ys4i0T/fU7f6RshHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:27:27.933741Z"},"content_sha256":"58faae462fc7a76d7f4cb73a81dcdbb28a3d9675f0356a3f25c8450350072368","schema_version":"1.0","event_id":"sha256:58faae462fc7a76d7f4cb73a81dcdbb28a3d9675f0356a3f25c8450350072368"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSBPDG56MWUXW42TJVEV5GETK2/bundle.json","state_url":"https://pith.science/pith/PSBPDG56MWUXW42TJVEV5GETK2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSBPDG56MWUXW42TJVEV5GETK2/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-06-02T02:27:27Z","links":{"resolver":"https://pith.science/pith/PSBPDG56MWUXW42TJVEV5GETK2","bundle":"https://pith.science/pith/PSBPDG56MWUXW42TJVEV5GETK2/bundle.json","state":"https://pith.science/pith/PSBPDG56MWUXW42TJVEV5GETK2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSBPDG56MWUXW42TJVEV5GETK2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PSBPDG56MWUXW42TJVEV5GETK2","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":"75ba8b8b77aafc6f724297ef5f66d2e588df9ffc47f4b21a28ca95677ab2de8f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-03T13:37:56Z","title_canon_sha256":"534aad6ab4bbdd891e5570483a9d85ea2b2e1f603a69b78b27aa3dbc32b7156f"},"schema_version":"1.0","source":{"id":"1605.00901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00901","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00901v1","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00901","created_at":"2026-05-18T01:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"PSBPDG56MWUX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PSBPDG56MWUXW42T","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PSBPDG56","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:58faae462fc7a76d7f4cb73a81dcdbb28a3d9675f0356a3f25c8450350072368","target":"graph","created_at":"2026-05-18T01:15:47Z","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":"Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\\in}\\{1,2\\}$|$C_{\\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 and 2 on two parallel identical machines, is W[2]-hard parameterized by the width of the partial order giving the precedence constraints. To this end, we show that Shuffle Product, the problem of deciding whether a given word can be obtained by interleaving the letters of $k$ other given words, is W[2]-hard parameterized by $k$, thus additional","authors_text":"Christian Komusiewicz, Gerhard J. Woeginger, Laurent Bulteau, Nimrod Talmon, Ren\\'e van Bevern, Robert Bredereck","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-03T13:37:56Z","title":"Precedence-constrained scheduling problems parameterized by partial order width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00901","kind":"arxiv","version":1},"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:3ffffdcd441275af9ce370723a04ba50b30c36ddafc3276dd78d09bdfcad12ed","target":"record","created_at":"2026-05-18T01:15:47Z","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":"75ba8b8b77aafc6f724297ef5f66d2e588df9ffc47f4b21a28ca95677ab2de8f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-03T13:37:56Z","title_canon_sha256":"534aad6ab4bbdd891e5570483a9d85ea2b2e1f603a69b78b27aa3dbc32b7156f"},"schema_version":"1.0","source":{"id":"1605.00901","kind":"arxiv","version":1}},"canonical_sha256":"7c82f19bbe65a97b73534d495e989356b9ce4adefb7ec1cf787dda9a19e7a139","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c82f19bbe65a97b73534d495e989356b9ce4adefb7ec1cf787dda9a19e7a139","first_computed_at":"2026-05-18T01:15:47.710892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:47.710892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3xHK9NZ1SUupyLP6DApX2wnFD/F4IpJ3XnTNIrbIaC4YV0rMhoCRksy1xodNmxm+CGxQvnbm9ZP5u7wJ/JlACA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:47.711403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ffffdcd441275af9ce370723a04ba50b30c36ddafc3276dd78d09bdfcad12ed","sha256:58faae462fc7a76d7f4cb73a81dcdbb28a3d9675f0356a3f25c8450350072368"],"state_sha256":"a61ef68e979cd4fa7a85754970cd185b6361740285665cee899dd9c96201df96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eegOg+LeI52hzU3NrCYYGmcPty2hbbyx88FAhglEpiEJPtZEbi368nA5MnJmoQNYeaDy13IdwDWUWAJKbczBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:27:27.935601Z","bundle_sha256":"7c19c4c8c9745daaaad0f10e7b5276c349598641f64305f317fce7bfdeee74b7"}}