{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:K3OXZX5SHXEIPBTQIPRY3SZ3PM","short_pith_number":"pith:K3OXZX5S","canonical_record":{"source":{"id":"1311.2879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T14:33:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"84987f924f3a2d657fd177bf8390b8e10bae22bb26c7c12523d48a9faf82e4c4","abstract_canon_sha256":"575e4c93599a499f804a7aef91e7e7037a22f85da943fdd0933febd1a4d4a2ab"},"schema_version":"1.0"},"canonical_sha256":"56dd7cdfb23dc887867043e38dcb3b7b0bdae91e6abc86ffb14270cc7c63257c","source":{"kind":"arxiv","id":"1311.2879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2879","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2879v1","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2879","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"K3OXZX5SHXEI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K3OXZX5SHXEIPBTQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K3OXZX5S","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:K3OXZX5SHXEIPBTQIPRY3SZ3PM","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T14:33:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"84987f924f3a2d657fd177bf8390b8e10bae22bb26c7c12523d48a9faf82e4c4","abstract_canon_sha256":"575e4c93599a499f804a7aef91e7e7037a22f85da943fdd0933febd1a4d4a2ab"},"schema_version":"1.0"},"canonical_sha256":"56dd7cdfb23dc887867043e38dcb3b7b0bdae91e6abc86ffb14270cc7c63257c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:21.624334Z","signature_b64":"nr7mHqoDtX+lfunCI+vNHCU73WdoFJ6qxtKdl7RySsfirXXaiMOs4FAi/jISG+7StB7Wp6oGWFDslTaAojypAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56dd7cdfb23dc887867043e38dcb3b7b0bdae91e6abc86ffb14270cc7c63257c","last_reissued_at":"2026-05-18T03:07:21.623553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:21.623553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2879","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:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5w8NHs8tBUgzYfEsx0qDMxBzez4FsGOqN3gMB+u2g0d1p1n/KeEh+WaHT1IhNcX+dzqXwfvlWsmYzFxQrE0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T05:21:39.816386Z"},"content_sha256":"6892f1141cd84e990904400239b71b7e9ebca3ee96b6bbfd559fb47ed040062f","schema_version":"1.0","event_id":"sha256:6892f1141cd84e990904400239b71b7e9ebca3ee96b6bbfd559fb47ed040062f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:K3OXZX5SHXEIPBTQIPRY3SZ3PM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence","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":"2013-10-26T14:33:44Z","abstract_excerpt":"This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence or single and parallel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2879","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:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpwV9Rvpu1hx+boCROT/SQAWiSIn7OHg1Q3Tz4/TQu1ys9cxuQa9D2zuBxm3LcTSbsY85aVJ4NRbiHx5Ucu2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T05:21:39.816731Z"},"content_sha256":"b19fa71ff3e2d987a90c7d0c70e018e724110a279b83ca23ea91fc19a393798c","schema_version":"1.0","event_id":"sha256:b19fa71ff3e2d987a90c7d0c70e018e724110a279b83ca23ea91fc19a393798c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM/bundle.json","state_url":"https://pith.science/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM/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-21T05:21:39Z","links":{"resolver":"https://pith.science/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM","bundle":"https://pith.science/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM/bundle.json","state":"https://pith.science/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3OXZX5SHXEIPBTQIPRY3SZ3PM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K3OXZX5SHXEIPBTQIPRY3SZ3PM","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":"575e4c93599a499f804a7aef91e7e7037a22f85da943fdd0933febd1a4d4a2ab","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T14:33:44Z","title_canon_sha256":"84987f924f3a2d657fd177bf8390b8e10bae22bb26c7c12523d48a9faf82e4c4"},"schema_version":"1.0","source":{"id":"1311.2879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2879","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2879v1","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2879","created_at":"2026-05-18T03:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"K3OXZX5SHXEI","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K3OXZX5SHXEIPBTQ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K3OXZX5S","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:b19fa71ff3e2d987a90c7d0c70e018e724110a279b83ca23ea91fc19a393798c","target":"graph","created_at":"2026-05-18T03:07:21Z","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":"This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later than the due date. The objective of the problem is to find the assignment of jobs to machines, the processing sequence of jobs and the time at which they are processed, which minimizes the total penalty incurred due to tardiness or earliness of the jobs. This work presents exact polynomial algorithms for optimizing a given job sequence or single and parallel ","authors_text":"Abhishek Awasthi, J\\\"org L\\\"assig, Oliver Kramer","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T14:33:44Z","title":"Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2879","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:6892f1141cd84e990904400239b71b7e9ebca3ee96b6bbfd559fb47ed040062f","target":"record","created_at":"2026-05-18T03:07:21Z","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":"575e4c93599a499f804a7aef91e7e7037a22f85da943fdd0933febd1a4d4a2ab","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-26T14:33:44Z","title_canon_sha256":"84987f924f3a2d657fd177bf8390b8e10bae22bb26c7c12523d48a9faf82e4c4"},"schema_version":"1.0","source":{"id":"1311.2879","kind":"arxiv","version":1}},"canonical_sha256":"56dd7cdfb23dc887867043e38dcb3b7b0bdae91e6abc86ffb14270cc7c63257c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56dd7cdfb23dc887867043e38dcb3b7b0bdae91e6abc86ffb14270cc7c63257c","first_computed_at":"2026-05-18T03:07:21.623553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:21.623553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nr7mHqoDtX+lfunCI+vNHCU73WdoFJ6qxtKdl7RySsfirXXaiMOs4FAi/jISG+7StB7Wp6oGWFDslTaAojypAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:21.624334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6892f1141cd84e990904400239b71b7e9ebca3ee96b6bbfd559fb47ed040062f","sha256:b19fa71ff3e2d987a90c7d0c70e018e724110a279b83ca23ea91fc19a393798c"],"state_sha256":"c55e078afdc9961ad4a5035133ad4bcbd27d201c18690dbc3a164fee0bdc3cb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dB1wxR2qu+C0m6EHgYt7l2azZyerLAdfViQ6HM5J3zS0l4zKLL1i5QFOAO+PfwbjDGgE+44GHuEAl7wYin8OBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T05:21:39.819584Z","bundle_sha256":"6e9485427e4217052b53fe71849360140c6efe347ff32859a4f0db64f2f41ec7"}}