{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WWR5RL3LX7SQRWGH3FBCS66JM2","short_pith_number":"pith:WWR5RL3L","schema_version":"1.0","canonical_sha256":"b5a3d8af6bbfe508d8c7d942297bc9669006eb220aec502c11d9d3b82b9a02d0","source":{"kind":"arxiv","id":"1405.1234","version":1},"attestation_state":"computed","paper":{"title":"A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Abhishek Awasthi, J\\\"org L\\\"assig, Oliver Kramer","submitted_at":"2014-05-06T11:40:02Z","abstract_excerpt":"This paper presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or parallel machines where all the jobs possess different processing times but a common due-date. The objective of the problem is to minimize the total penalty incurred due to earliness or tardiness of the job completions. This work presents exact polynomial algorithms for optimizing a given job sequence for single and identical parallel machines with the run-time complexities of $O(n \\log n)$ for both cases, where $n$ is th"},"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":"1405.1234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-06T11:40:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"446dc7688cf5ac48e4c9185f620908e52602a0085e131315cb269ac30dac4aca","abstract_canon_sha256":"354d3569d561fae18f0ade04dcda25d013665f5f3ad7fce6161c852c25a12a7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:33.225615Z","signature_b64":"KUpTx7txqaWHp2wnycQroCOJGTUSfkfnD5H8MsR65/n8SKXJox7OVIQOGEZfg51wMs8NtAsgFUu5R6UlYUG0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a3d8af6bbfe508d8c7d942297bc9669006eb220aec502c11d9d3b82b9a02d0","last_reissued_at":"2026-05-18T02:52:33.224927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:33.224927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Abhishek Awasthi, J\\\"org L\\\"assig, Oliver Kramer","submitted_at":"2014-05-06T11:40:02Z","abstract_excerpt":"This paper presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or parallel machines where all the jobs possess different processing times but a common due-date. The objective of the problem is to minimize the total penalty incurred due to earliness or tardiness of the job completions. This work presents exact polynomial algorithms for optimizing a given job sequence for single and identical parallel machines with the run-time complexities of $O(n \\log n)$ for both cases, where $n$ is th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1234","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":"1405.1234","created_at":"2026-05-18T02:52:33.225035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1234v1","created_at":"2026-05-18T02:52:33.225035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1234","created_at":"2026-05-18T02:52:33.225035+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWR5RL3LX7SQ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWR5RL3LX7SQRWGH","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWR5RL3L","created_at":"2026-05-18T12:28:54.890064+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/WWR5RL3LX7SQRWGH3FBCS66JM2","json":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2.json","graph_json":"https://pith.science/api/pith-number/WWR5RL3LX7SQRWGH3FBCS66JM2/graph.json","events_json":"https://pith.science/api/pith-number/WWR5RL3LX7SQRWGH3FBCS66JM2/events.json","paper":"https://pith.science/paper/WWR5RL3L"},"agent_actions":{"view_html":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2","download_json":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2.json","view_paper":"https://pith.science/paper/WWR5RL3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1234&json=true","fetch_graph":"https://pith.science/api/pith-number/WWR5RL3LX7SQRWGH3FBCS66JM2/graph.json","fetch_events":"https://pith.science/api/pith-number/WWR5RL3LX7SQRWGH3FBCS66JM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2/action/storage_attestation","attest_author":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2/action/author_attestation","sign_citation":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2/action/citation_signature","submit_replication":"https://pith.science/pith/WWR5RL3LX7SQRWGH3FBCS66JM2/action/replication_record"}},"created_at":"2026-05-18T02:52:33.225035+00:00","updated_at":"2026-05-18T02:52:33.225035+00:00"}