{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CFJNLFI6Y7Y5JVMTAE4I2G4R7J","short_pith_number":"pith:CFJNLFI6","canonical_record":{"source":{"id":"1212.1609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-07T14:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"f8d517dd4334bc3ae9c5d7b571acb762806dfdb8a89c4d5cc8290059a140b04a","abstract_canon_sha256":"afd1881bdde28ff3eec979002ea0d4eea3452ce80ce92bb743ef2a676b2469e8"},"schema_version":"1.0"},"canonical_sha256":"1152d5951ec7f1d4d59301388d1b91fa44ad56cdfb1ad4562f1a6329bcb11b87","source":{"kind":"arxiv","id":"1212.1609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1609","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1609v1","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1609","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"CFJNLFI6Y7Y5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFJNLFI6Y7Y5JVMT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFJNLFI6","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CFJNLFI6Y7Y5JVMTAE4I2G4R7J","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-07T14:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"f8d517dd4334bc3ae9c5d7b571acb762806dfdb8a89c4d5cc8290059a140b04a","abstract_canon_sha256":"afd1881bdde28ff3eec979002ea0d4eea3452ce80ce92bb743ef2a676b2469e8"},"schema_version":"1.0"},"canonical_sha256":"1152d5951ec7f1d4d59301388d1b91fa44ad56cdfb1ad4562f1a6329bcb11b87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:56.800076Z","signature_b64":"kS3IDPPGLqRt9QlvQxbqECbbzOnmoYaxQTeEb6VbO3Q47/+mCZTrtMDPHhK9GRX4t4U9q4mBOq9K+QpR7tgXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1152d5951ec7f1d4d59301388d1b91fa44ad56cdfb1ad4562f1a6329bcb11b87","last_reissued_at":"2026-05-18T03:38:56.799598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:56.799598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1609","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:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pmb6gAZVt9IBQnzlrLWbkXoRJHhpMMLhz0B6Hv2wYs9q1o8AL3stNI44JGx3O1NXK0ChLNQxruvmPQxo6pKBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:52:30.553846Z"},"content_sha256":"efb73278f5c7218e76806fa308f493565cf97106b6e7fd758b2497b1933ad51d","schema_version":"1.0","event_id":"sha256:efb73278f5c7218e76806fa308f493565cf97106b6e7fd758b2497b1933ad51d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CFJNLFI6Y7Y5JVMTAE4I2G4R7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The 2-valued case of makespan minimization with assignment constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Stavros G. Kolliopoulos, Yannis Moysoglou","submitted_at":"2012-12-07T14:03:44Z","abstract_excerpt":"We consider the following special case of minimizing makespan. A set of jobs $J$ and a set of machines $M$ are given. Each job $j \\in J$ can be scheduled on a machine from a subset $M_j$ of $M$. The processing time of $j$ is the same on all machines in $M_j.$ The jobs are of two sizes, namely $b$ (big) and $s$ (small). We present a polynomial-time algorithm that approximates the value of the optimal makespan within a factor of 1.883 and some further improvements when every job can be scheduled on at most two machines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1609","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:38:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WY1aG+Ll5+NM13ly18KdaFRlkRSnTCrkGN7vh+05Lgzd//d2K1cjIOTPJibelFJo/Bqt4S3M/IjhENoGEMmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:52:30.554391Z"},"content_sha256":"51206c6b120b17ce4da6083195b43f4b9e26da015281096401290253b3dbd372","schema_version":"1.0","event_id":"sha256:51206c6b120b17ce4da6083195b43f4b9e26da015281096401290253b3dbd372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J/bundle.json","state_url":"https://pith.science/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J/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-05T05:52:30Z","links":{"resolver":"https://pith.science/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J","bundle":"https://pith.science/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J/bundle.json","state":"https://pith.science/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFJNLFI6Y7Y5JVMTAE4I2G4R7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CFJNLFI6Y7Y5JVMTAE4I2G4R7J","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":"afd1881bdde28ff3eec979002ea0d4eea3452ce80ce92bb743ef2a676b2469e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-07T14:03:44Z","title_canon_sha256":"f8d517dd4334bc3ae9c5d7b571acb762806dfdb8a89c4d5cc8290059a140b04a"},"schema_version":"1.0","source":{"id":"1212.1609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1609","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1609v1","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1609","created_at":"2026-05-18T03:38:56Z"},{"alias_kind":"pith_short_12","alias_value":"CFJNLFI6Y7Y5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFJNLFI6Y7Y5JVMT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFJNLFI6","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:51206c6b120b17ce4da6083195b43f4b9e26da015281096401290253b3dbd372","target":"graph","created_at":"2026-05-18T03:38:56Z","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":"We consider the following special case of minimizing makespan. A set of jobs $J$ and a set of machines $M$ are given. Each job $j \\in J$ can be scheduled on a machine from a subset $M_j$ of $M$. The processing time of $j$ is the same on all machines in $M_j.$ The jobs are of two sizes, namely $b$ (big) and $s$ (small). We present a polynomial-time algorithm that approximates the value of the optimal makespan within a factor of 1.883 and some further improvements when every job can be scheduled on at most two machines.","authors_text":"Stavros G. Kolliopoulos, Yannis Moysoglou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-07T14:03:44Z","title":"The 2-valued case of makespan minimization with assignment constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1609","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:efb73278f5c7218e76806fa308f493565cf97106b6e7fd758b2497b1933ad51d","target":"record","created_at":"2026-05-18T03:38:56Z","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":"afd1881bdde28ff3eec979002ea0d4eea3452ce80ce92bb743ef2a676b2469e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-07T14:03:44Z","title_canon_sha256":"f8d517dd4334bc3ae9c5d7b571acb762806dfdb8a89c4d5cc8290059a140b04a"},"schema_version":"1.0","source":{"id":"1212.1609","kind":"arxiv","version":1}},"canonical_sha256":"1152d5951ec7f1d4d59301388d1b91fa44ad56cdfb1ad4562f1a6329bcb11b87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1152d5951ec7f1d4d59301388d1b91fa44ad56cdfb1ad4562f1a6329bcb11b87","first_computed_at":"2026-05-18T03:38:56.799598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:56.799598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kS3IDPPGLqRt9QlvQxbqECbbzOnmoYaxQTeEb6VbO3Q47/+mCZTrtMDPHhK9GRX4t4U9q4mBOq9K+QpR7tgXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:56.800076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efb73278f5c7218e76806fa308f493565cf97106b6e7fd758b2497b1933ad51d","sha256:51206c6b120b17ce4da6083195b43f4b9e26da015281096401290253b3dbd372"],"state_sha256":"65ffbb4310ca4ff73fd019146abcd0a438bd014f3c86c2112939b6529874be38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tD0+hnpqP45sWi68HPm0L693NSCf65NTgmmUQ4yLi+6EHF7RNKEWj1mwzbwpY3zugoCs26wkRJNpSkF9K4exCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:52:30.557158Z","bundle_sha256":"972f3b0491db0e2c06272a129cd2408ea14fa948d9fb3b5e7be1cae6df3b07e2"}}