{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QMPRP4KP6USPGKMJRWSQ43SQNO","short_pith_number":"pith:QMPRP4KP","canonical_record":{"source":{"id":"1509.02384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T14:26:31Z","cross_cats_sorted":[],"title_canon_sha256":"a82355aa42b4a8862d689330e0fb069aaf9bff75fce165efb17f163eea0f87e1","abstract_canon_sha256":"7d6b744fb398baadb9e8f34b66c280a00caff2411be30ba6a0bda48100832a11"},"schema_version":"1.0"},"canonical_sha256":"831f17f14ff524f329898da50e6e506badbfd68677619ef43d78d424f610aa70","source":{"kind":"arxiv","id":"1509.02384","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02384","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02384v3","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02384","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"QMPRP4KP6USP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QMPRP4KP6USPGKMJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QMPRP4KP","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QMPRP4KP6USPGKMJRWSQ43SQNO","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T14:26:31Z","cross_cats_sorted":[],"title_canon_sha256":"a82355aa42b4a8862d689330e0fb069aaf9bff75fce165efb17f163eea0f87e1","abstract_canon_sha256":"7d6b744fb398baadb9e8f34b66c280a00caff2411be30ba6a0bda48100832a11"},"schema_version":"1.0"},"canonical_sha256":"831f17f14ff524f329898da50e6e506badbfd68677619ef43d78d424f610aa70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:08.920344Z","signature_b64":"25wZnIJ5tq6kvcjK0wFf6FC326+Ya69IaB4BQ8GnmpctBsBr0K2S3ht6x4AIpiPoxHg4i7cFTvVff7uVXP4RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"831f17f14ff524f329898da50e6e506badbfd68677619ef43d78d424f610aa70","last_reissued_at":"2026-05-18T00:53:08.919391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:08.919391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02384","source_version":3,"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-18T00:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tfaOm/LCUSQxSBhHGXQKUHJFaUiHLu5Nctz11n0jykIi/ocRmC1oPgBibdkq3dofDG0q8jfwZhYGMustDf/LCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:20:34.442236Z"},"content_sha256":"f7be8c43850ffa6fd4c5e9841717246ea3d7324abe2142f9f3552fc908ee0844","schema_version":"1.0","event_id":"sha256:f7be8c43850ffa6fd4c5e9841717246ea3d7324abe2142f9f3552fc908ee0844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QMPRP4KP6USPGKMJRWSQ43SQNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand Subramanian, Arthur Kramer","submitted_at":"2015-09-08T14:26:31Z","abstract_excerpt":"This work proposes a unified heuristic algorithm for a large class of earliness-tardiness (E-T) scheduling problems. We consider single/parallel machine E-T problems that may or may not consider some additional features such as idle time, setup times and release dates. In addition, we also consider those problems whose objective is to minimize either the total (average) weighted completion time or the total (average) weighted flow time, which arise as particular cases when the due dates of all jobs are either set to zero or to their associated release dates, respectively. The developed local s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02384","kind":"arxiv","version":3},"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-18T00:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWJBC4sT/GYBLKNwvKPsJHHsimsvn8AEGWjHPawH9JyKU0InFVs0f5IMbVgnwgoJMERUYLnB2t7bKjSqZEhnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:20:34.443034Z"},"content_sha256":"84a2fa4d1c515a2ef146a85f78410047ea39cfa2c520613ae4df3277504007c6","schema_version":"1.0","event_id":"sha256:84a2fa4d1c515a2ef146a85f78410047ea39cfa2c520613ae4df3277504007c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMPRP4KP6USPGKMJRWSQ43SQNO/bundle.json","state_url":"https://pith.science/pith/QMPRP4KP6USPGKMJRWSQ43SQNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMPRP4KP6USPGKMJRWSQ43SQNO/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-12T02:20:34Z","links":{"resolver":"https://pith.science/pith/QMPRP4KP6USPGKMJRWSQ43SQNO","bundle":"https://pith.science/pith/QMPRP4KP6USPGKMJRWSQ43SQNO/bundle.json","state":"https://pith.science/pith/QMPRP4KP6USPGKMJRWSQ43SQNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMPRP4KP6USPGKMJRWSQ43SQNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QMPRP4KP6USPGKMJRWSQ43SQNO","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":"7d6b744fb398baadb9e8f34b66c280a00caff2411be30ba6a0bda48100832a11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T14:26:31Z","title_canon_sha256":"a82355aa42b4a8862d689330e0fb069aaf9bff75fce165efb17f163eea0f87e1"},"schema_version":"1.0","source":{"id":"1509.02384","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02384","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02384v3","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02384","created_at":"2026-05-18T00:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"QMPRP4KP6USP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QMPRP4KP6USPGKMJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QMPRP4KP","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:84a2fa4d1c515a2ef146a85f78410047ea39cfa2c520613ae4df3277504007c6","target":"graph","created_at":"2026-05-18T00:53:08Z","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 work proposes a unified heuristic algorithm for a large class of earliness-tardiness (E-T) scheduling problems. We consider single/parallel machine E-T problems that may or may not consider some additional features such as idle time, setup times and release dates. In addition, we also consider those problems whose objective is to minimize either the total (average) weighted completion time or the total (average) weighted flow time, which arise as particular cases when the due dates of all jobs are either set to zero or to their associated release dates, respectively. The developed local s","authors_text":"Anand Subramanian, Arthur Kramer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T14:26:31Z","title":"A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02384","kind":"arxiv","version":3},"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:f7be8c43850ffa6fd4c5e9841717246ea3d7324abe2142f9f3552fc908ee0844","target":"record","created_at":"2026-05-18T00:53:08Z","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":"7d6b744fb398baadb9e8f34b66c280a00caff2411be30ba6a0bda48100832a11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-09-08T14:26:31Z","title_canon_sha256":"a82355aa42b4a8862d689330e0fb069aaf9bff75fce165efb17f163eea0f87e1"},"schema_version":"1.0","source":{"id":"1509.02384","kind":"arxiv","version":3}},"canonical_sha256":"831f17f14ff524f329898da50e6e506badbfd68677619ef43d78d424f610aa70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"831f17f14ff524f329898da50e6e506badbfd68677619ef43d78d424f610aa70","first_computed_at":"2026-05-18T00:53:08.919391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:08.919391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"25wZnIJ5tq6kvcjK0wFf6FC326+Ya69IaB4BQ8GnmpctBsBr0K2S3ht6x4AIpiPoxHg4i7cFTvVff7uVXP4RAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:08.920344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02384","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7be8c43850ffa6fd4c5e9841717246ea3d7324abe2142f9f3552fc908ee0844","sha256:84a2fa4d1c515a2ef146a85f78410047ea39cfa2c520613ae4df3277504007c6"],"state_sha256":"7659d4a599d4d4c76e1d362608d620b55dbfc85a6d90eb27c858ef6472228912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KhO6ICoqI7i9BGjhAaqpEFbVllZ2666brlsBPFBiktfHJfeJybD4GZIXaIhub7Qmam69hioJ6SSWQC2dbFlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:20:34.447166Z","bundle_sha256":"30f4cbcefcbc893815b1035a3a055a4788d8948bf81e80c65d9bb36a600ff31c"}}