{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5PCVB5KA6XVJ4TDCWL4YEBTZCM","short_pith_number":"pith:5PCVB5KA","schema_version":"1.0","canonical_sha256":"ebc550f540f5ea9e4c62b2f9820679133a463d885b4542b1976dfddf5e2b27bc","source":{"kind":"arxiv","id":"1507.00748","version":1},"attestation_state":"computed","paper":{"title":"Approximate Deadline-Scheduling with Precedence Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Malec, Hamid Mahini, Hossein Efsandiari, Jochen Koenemann, Laura Sanita, MohammadTaghi Hajiaghyi","submitted_at":"2015-07-02T20:22:22Z","abstract_excerpt":"We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan [Annals of Disc. Math., 1977] in their seminal work introduced this problem and showed that it is strongly NP-hard, even when all processing times and weights are 1. We study the approximability of the problem and our main result "},"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":"1507.00748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-02T20:22:22Z","cross_cats_sorted":[],"title_canon_sha256":"9902491c8d7cfc2839e651fc93516ffb4f2d019b6d54a8fb6a13f1e78aef267e","abstract_canon_sha256":"de5e30bcfcbb41450c62a14dcacd5aad9c44feaa56789de81e749596f32a2514"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:22.808090Z","signature_b64":"HDdt7YdcghJUkGZlYZgeFMOrdyN2aD7iLx+1BnfBEDjtCLLKADMz23TXBCZdaAx2BToSlMYV4/V7XltSHFB5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc550f540f5ea9e4c62b2f9820679133a463d885b4542b1976dfddf5e2b27bc","last_reissued_at":"2026-05-18T01:37:22.807414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:22.807414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Deadline-Scheduling with Precedence Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Malec, Hamid Mahini, Hossein Efsandiari, Jochen Koenemann, Laura Sanita, MohammadTaghi Hajiaghyi","submitted_at":"2015-07-02T20:22:22Z","abstract_excerpt":"We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan [Annals of Disc. Math., 1977] in their seminal work introduced this problem and showed that it is strongly NP-hard, even when all processing times and weights are 1. We study the approximability of the problem and our main result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00748","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":"1507.00748","created_at":"2026-05-18T01:37:22.807517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00748v1","created_at":"2026-05-18T01:37:22.807517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00748","created_at":"2026-05-18T01:37:22.807517+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PCVB5KA6XVJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PCVB5KA6XVJ4TDC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PCVB5KA","created_at":"2026-05-18T12:29:05.191682+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/5PCVB5KA6XVJ4TDCWL4YEBTZCM","json":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM.json","graph_json":"https://pith.science/api/pith-number/5PCVB5KA6XVJ4TDCWL4YEBTZCM/graph.json","events_json":"https://pith.science/api/pith-number/5PCVB5KA6XVJ4TDCWL4YEBTZCM/events.json","paper":"https://pith.science/paper/5PCVB5KA"},"agent_actions":{"view_html":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM","download_json":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM.json","view_paper":"https://pith.science/paper/5PCVB5KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00748&json=true","fetch_graph":"https://pith.science/api/pith-number/5PCVB5KA6XVJ4TDCWL4YEBTZCM/graph.json","fetch_events":"https://pith.science/api/pith-number/5PCVB5KA6XVJ4TDCWL4YEBTZCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM/action/storage_attestation","attest_author":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM/action/author_attestation","sign_citation":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM/action/citation_signature","submit_replication":"https://pith.science/pith/5PCVB5KA6XVJ4TDCWL4YEBTZCM/action/replication_record"}},"created_at":"2026-05-18T01:37:22.807517+00:00","updated_at":"2026-05-18T01:37:22.807517+00:00"}