{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GL3KFXF6HKOEH4XAJXEYH4DI7Q","short_pith_number":"pith:GL3KFXF6","canonical_record":{"source":{"id":"1709.04161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-13T07:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"7b55abdd6cf8f04a279ddbcf6f4a2263208bc1d70d666471f215cdda72f57498","abstract_canon_sha256":"650136fad92a317d535773ce16fb937060c3011652d4bc64e343ff15e631e62d"},"schema_version":"1.0"},"canonical_sha256":"32f6a2dcbe3a9c43f2e04dc983f068fc02a6c8f30d2f29607c8f515938fe4313","source":{"kind":"arxiv","id":"1709.04161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04161","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04161v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04161","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"GL3KFXF6HKOE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GL3KFXF6HKOEH4XA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GL3KFXF6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GL3KFXF6HKOEH4XAJXEYH4DI7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-13T07:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"7b55abdd6cf8f04a279ddbcf6f4a2263208bc1d70d666471f215cdda72f57498","abstract_canon_sha256":"650136fad92a317d535773ce16fb937060c3011652d4bc64e343ff15e631e62d"},"schema_version":"1.0"},"canonical_sha256":"32f6a2dcbe3a9c43f2e04dc983f068fc02a6c8f30d2f29607c8f515938fe4313","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.258226Z","signature_b64":"ldhVrfefdyIMXknOlU+ebvMOTsie1cXd5Jk6raw7dSSRVNH8r1sH2fBG2DOP9S0vWbKTNuryRwmj7TXACfw7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f6a2dcbe3a9c43f2e04dc983f068fc02a6c8f30d2f29607c8f515938fe4313","last_reissued_at":"2026-05-18T00:35:15.257683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.257683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04161","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-18T00:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ob+bZp9ZKK6XyD2XPIaAC5ige7YwT8hF8TlAAvKhf5MxxZJqhhA2505fSCNYKpydWInA7GymYaFG/N5UPZmTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:42:16.799386Z"},"content_sha256":"bbb8359936afa4dd84a6a4afb0e3f0c1d6c77aa842c40f47f54cb73eee52d3b0","schema_version":"1.0","event_id":"sha256:bbb8359936afa4dd84a6a4afb0e3f0c1d6c77aa842c40f47f54cb73eee52d3b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GL3KFXF6HKOEH4XAJXEYH4DI7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Dvir Shabtay, Gerhard Woeginger, Judith-Madeleine Kubitza, Nimrod Talmon","submitted_at":"2017-09-13T07:14:31Z","abstract_excerpt":"Scheduling theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attention of the community. Our aim is to bring these two areas closer together by studying the parameterized complexity of a class of single-machine two-agent scheduling problems. Our analysis focuses on the case where the number of jobs belonging to the second agent is considerably smaller than the number of jobs belonging to the first agent, and thus can be considered as a fixed parameter k. We study a variety of combinat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04161","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-18T00:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blirHdCL+/Xf9cMHBiYs3KCKzP3kn/7NgZUvhTJK5zN426JZzo/mTDpV4fsIcggQPNkDC0H9a0fEFQZqCnn/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:42:16.799731Z"},"content_sha256":"78298342d164b834a7289ca86b580a93a71dfa91ad85d8e4f748d84ec2e6830b","schema_version":"1.0","event_id":"sha256:78298342d164b834a7289ca86b580a93a71dfa91ad85d8e4f748d84ec2e6830b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q/bundle.json","state_url":"https://pith.science/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q/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-02T12:42:16Z","links":{"resolver":"https://pith.science/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q","bundle":"https://pith.science/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q/bundle.json","state":"https://pith.science/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GL3KFXF6HKOEH4XAJXEYH4DI7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GL3KFXF6HKOEH4XAJXEYH4DI7Q","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":"650136fad92a317d535773ce16fb937060c3011652d4bc64e343ff15e631e62d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-13T07:14:31Z","title_canon_sha256":"7b55abdd6cf8f04a279ddbcf6f4a2263208bc1d70d666471f215cdda72f57498"},"schema_version":"1.0","source":{"id":"1709.04161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04161","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04161v1","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04161","created_at":"2026-05-18T00:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"GL3KFXF6HKOE","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GL3KFXF6HKOEH4XA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GL3KFXF6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:78298342d164b834a7289ca86b580a93a71dfa91ad85d8e4f748d84ec2e6830b","target":"graph","created_at":"2026-05-18T00:35:15Z","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 theory is an old and well-established area in combinatorial optimization, whereas the much younger area of parameterized complexity has only recently gained the attention of the community. Our aim is to bring these two areas closer together by studying the parameterized complexity of a class of single-machine two-agent scheduling problems. Our analysis focuses on the case where the number of jobs belonging to the second agent is considerably smaller than the number of jobs belonging to the first agent, and thus can be considered as a fixed parameter k. We study a variety of combinat","authors_text":"Danny Hermelin, Dvir Shabtay, Gerhard Woeginger, Judith-Madeleine Kubitza, Nimrod Talmon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-13T07:14:31Z","title":"Scheduling Two Agents on a Single Machine: A Parameterized Analysis of NP-hard Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04161","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:bbb8359936afa4dd84a6a4afb0e3f0c1d6c77aa842c40f47f54cb73eee52d3b0","target":"record","created_at":"2026-05-18T00:35:15Z","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":"650136fad92a317d535773ce16fb937060c3011652d4bc64e343ff15e631e62d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-13T07:14:31Z","title_canon_sha256":"7b55abdd6cf8f04a279ddbcf6f4a2263208bc1d70d666471f215cdda72f57498"},"schema_version":"1.0","source":{"id":"1709.04161","kind":"arxiv","version":1}},"canonical_sha256":"32f6a2dcbe3a9c43f2e04dc983f068fc02a6c8f30d2f29607c8f515938fe4313","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32f6a2dcbe3a9c43f2e04dc983f068fc02a6c8f30d2f29607c8f515938fe4313","first_computed_at":"2026-05-18T00:35:15.257683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:15.257683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ldhVrfefdyIMXknOlU+ebvMOTsie1cXd5Jk6raw7dSSRVNH8r1sH2fBG2DOP9S0vWbKTNuryRwmj7TXACfw7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:15.258226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb8359936afa4dd84a6a4afb0e3f0c1d6c77aa842c40f47f54cb73eee52d3b0","sha256:78298342d164b834a7289ca86b580a93a71dfa91ad85d8e4f748d84ec2e6830b"],"state_sha256":"ac8dea3325fd7156fbd4efdc4c626eb5203a5e25536bf9205a11b460a447f416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1phplIIkmfa/aHKCHD4nQdfTOP6xIacuL0mfdL3ZU8rsvePbpJS7o/hJFqSBJWDDY2mWuXh4sOe+ijSLwftBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:42:16.801561Z","bundle_sha256":"8e7176f4ee693e5ffe15f7cc17c13742cd0c1967e4055299ef5677ec2a61d90a"}}