{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XH4U22UVLJS4WNF3JVVTL6FWCL","short_pith_number":"pith:XH4U22UV","canonical_record":{"source":{"id":"1311.4021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T05:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"435049f8ed2f4825d9af766ac553c40224eee16fbc74e8b4988cf70e1c292ff1","abstract_canon_sha256":"52137b84fc353157e6d5a63f00d3911962f8c8a6394230623ff245a0ce377900"},"schema_version":"1.0"},"canonical_sha256":"b9f94d6a955a65cb34bb4d6b35f8b612f7102425e8c9872d9991f1f175e47f62","source":{"kind":"arxiv","id":"1311.4021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4021","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4021v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4021","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"XH4U22UVLJS4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XH4U22UVLJS4WNF3","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XH4U22UV","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XH4U22UVLJS4WNF3JVVTL6FWCL","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T05:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"435049f8ed2f4825d9af766ac553c40224eee16fbc74e8b4988cf70e1c292ff1","abstract_canon_sha256":"52137b84fc353157e6d5a63f00d3911962f8c8a6394230623ff245a0ce377900"},"schema_version":"1.0"},"canonical_sha256":"b9f94d6a955a65cb34bb4d6b35f8b612f7102425e8c9872d9991f1f175e47f62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:53.912109Z","signature_b64":"gXW3PgZ4K6xzYiBOUeeDVm+4Ovfd2xbvHLhyJyvWfF87WJY0YTzVN3KMlGl5/kxCFT8KgTWgM2/GYBzBH3WhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f94d6a955a65cb34bb4d6b35f8b612f7102425e8c9872d9991f1f175e47f62","last_reissued_at":"2026-05-18T03:06:53.911405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:53.911405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4021","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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//VumW5Jh3C5uE0E5D02FaPzQCzx8UfOkOk+u4EUcECW638LL9uavkVtmkIjmwsbw30jRvI7dRApfjPpVpt9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:50:12.371422Z"},"content_sha256":"fcdd96e4062fc169dc5bc569094ab9938f83b749673eb281afd17d436b0417b7","schema_version":"1.0","event_id":"sha256:fcdd96e4062fc169dc5bc569094ab9938f83b749673eb281afd17d436b0417b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XH4U22UVLJS4WNF3JVVTL6FWCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Meets Fixed-Parameter Tractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Matthias Mnich","submitted_at":"2013-11-16T05:50:21Z","abstract_excerpt":"Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems.\n  In this paper we present the first fixed-parameter algorithms for classical scheduling problems such as makespan minimization, scheduling with job-dependent cost functions-one important example being weighted flow time-and scheduling with rejection. To this end, we iden"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4021","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-18T03:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5OPboWIhHaCGKQwCNJpwGoW/EjjPHSc9jF2juqr1Fuf1knv+Z2jpKpAGwhVWObQQ+sHr9LQgqFvC4RmhdHmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:50:12.371786Z"},"content_sha256":"2ae0b4577741a32d8d440eceda5c4f4badcdfd5bcce39d294176ac6ba8f0e72b","schema_version":"1.0","event_id":"sha256:2ae0b4577741a32d8d440eceda5c4f4badcdfd5bcce39d294176ac6ba8f0e72b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/bundle.json","state_url":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/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-30T03:50:12Z","links":{"resolver":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL","bundle":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/bundle.json","state":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XH4U22UVLJS4WNF3JVVTL6FWCL","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":"52137b84fc353157e6d5a63f00d3911962f8c8a6394230623ff245a0ce377900","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T05:50:21Z","title_canon_sha256":"435049f8ed2f4825d9af766ac553c40224eee16fbc74e8b4988cf70e1c292ff1"},"schema_version":"1.0","source":{"id":"1311.4021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4021","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4021v1","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4021","created_at":"2026-05-18T03:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"XH4U22UVLJS4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XH4U22UVLJS4WNF3","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XH4U22UV","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:2ae0b4577741a32d8d440eceda5c4f4badcdfd5bcce39d294176ac6ba8f0e72b","target":"graph","created_at":"2026-05-18T03:06:53Z","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":"Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems.\n  In this paper we present the first fixed-parameter algorithms for classical scheduling problems such as makespan minimization, scheduling with job-dependent cost functions-one important example being weighted flow time-and scheduling with rejection. To this end, we iden","authors_text":"Andreas Wiese, Matthias Mnich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T05:50:21Z","title":"Scheduling Meets Fixed-Parameter Tractability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4021","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:fcdd96e4062fc169dc5bc569094ab9938f83b749673eb281afd17d436b0417b7","target":"record","created_at":"2026-05-18T03:06:53Z","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":"52137b84fc353157e6d5a63f00d3911962f8c8a6394230623ff245a0ce377900","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-16T05:50:21Z","title_canon_sha256":"435049f8ed2f4825d9af766ac553c40224eee16fbc74e8b4988cf70e1c292ff1"},"schema_version":"1.0","source":{"id":"1311.4021","kind":"arxiv","version":1}},"canonical_sha256":"b9f94d6a955a65cb34bb4d6b35f8b612f7102425e8c9872d9991f1f175e47f62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9f94d6a955a65cb34bb4d6b35f8b612f7102425e8c9872d9991f1f175e47f62","first_computed_at":"2026-05-18T03:06:53.911405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:53.911405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXW3PgZ4K6xzYiBOUeeDVm+4Ovfd2xbvHLhyJyvWfF87WJY0YTzVN3KMlGl5/kxCFT8KgTWgM2/GYBzBH3WhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:53.912109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcdd96e4062fc169dc5bc569094ab9938f83b749673eb281afd17d436b0417b7","sha256:2ae0b4577741a32d8d440eceda5c4f4badcdfd5bcce39d294176ac6ba8f0e72b"],"state_sha256":"e420a26d0e2dc95c3772d55f6e232d7b34623a6a59a8771edb70c21356f03d0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gavqgshYVQgcRIAhR0Dug1IxlFojOUCiljXQjBpcU+1qMvTxZagRtDlTEoJmk8VksRtKc7w2ICvI3+Ykkn4fBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:50:12.373878Z","bundle_sha256":"53c29235bb729b705a826a256ea82b61be2801f480da4727e14b172c1a43c02b"}}