{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XH4U22UVLJS4WNF3JVVTL6FWCL","short_pith_number":"pith:XH4U22UV","schema_version":"1.0","canonical_sha256":"b9f94d6a955a65cb34bb4d6b35f8b612f7102425e8c9872d9991f1f175e47f62","source":{"kind":"arxiv","id":"1311.4021","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.4021","created_at":"2026-05-18T03:06:53.911526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4021v1","created_at":"2026-05-18T03:06:53.911526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4021","created_at":"2026-05-18T03:06:53.911526+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH4U22UVLJS4","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH4U22UVLJS4WNF3","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH4U22UV","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL","json":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL.json","graph_json":"https://pith.science/api/pith-number/XH4U22UVLJS4WNF3JVVTL6FWCL/graph.json","events_json":"https://pith.science/api/pith-number/XH4U22UVLJS4WNF3JVVTL6FWCL/events.json","paper":"https://pith.science/paper/XH4U22UV"},"agent_actions":{"view_html":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL","download_json":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL.json","view_paper":"https://pith.science/paper/XH4U22UV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4021&json=true","fetch_graph":"https://pith.science/api/pith-number/XH4U22UVLJS4WNF3JVVTL6FWCL/graph.json","fetch_events":"https://pith.science/api/pith-number/XH4U22UVLJS4WNF3JVVTL6FWCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/action/storage_attestation","attest_author":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/action/author_attestation","sign_citation":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/action/citation_signature","submit_replication":"https://pith.science/pith/XH4U22UVLJS4WNF3JVVTL6FWCL/action/replication_record"}},"created_at":"2026-05-18T03:06:53.911526+00:00","updated_at":"2026-05-18T03:06:53.911526+00:00"}