{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2PSDHCD3KPTVON5UXY2JEHHRSY","short_pith_number":"pith:2PSDHCD3","schema_version":"1.0","canonical_sha256":"d3e433887b53e75737b4be34921cf19632a77bf70dd855a38ea68941ae953de5","source":{"kind":"arxiv","id":"1205.0974","version":1},"attestation_state":"computed","paper":{"title":"Scheduling Unrelated Machines of Few Different Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Vincenzo Bonifaci","submitted_at":"2012-05-04T15:12:46Z","abstract_excerpt":"A very well-known machine model in scheduling allows the machines to be unrelated, modelling jobs that might have different characteristics on each machine. Due to its generality, many optimization problems of this form are very difficult to tackle and typically APX-hard. However, in many applications the number of different types of machines, such as processor cores, GPUs, etc. is very limited. In this paper, we address this point and study the assignment of jobs to unrelated machines in the case that each machine belongs to one of a fixed number of types and the machines of each type are ide"},"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":"1205.0974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-04T15:12:46Z","cross_cats_sorted":[],"title_canon_sha256":"a3e215c04fc2b177d975a738c367265d1d4909758886809d2170a6e886caa14f","abstract_canon_sha256":"64ce4f2fd154fb729887fba64a0fd595f742ffb49211cf18b6dee6b3c1b6b153"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:23.430115Z","signature_b64":"0E1kzFBKFkgz1bP7C5KSC2eoJJG5ro/gc/wPeoBsivL4iUGNF/O0L3pehJlw1kTv0Rcp4g6tqgwzAleoshlHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3e433887b53e75737b4be34921cf19632a77bf70dd855a38ea68941ae953de5","last_reissued_at":"2026-05-18T03:56:23.429454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:23.429454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Unrelated Machines of Few Different Types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Vincenzo Bonifaci","submitted_at":"2012-05-04T15:12:46Z","abstract_excerpt":"A very well-known machine model in scheduling allows the machines to be unrelated, modelling jobs that might have different characteristics on each machine. Due to its generality, many optimization problems of this form are very difficult to tackle and typically APX-hard. However, in many applications the number of different types of machines, such as processor cores, GPUs, etc. is very limited. In this paper, we address this point and study the assignment of jobs to unrelated machines in the case that each machine belongs to one of a fixed number of types and the machines of each type are ide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0974","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":"1205.0974","created_at":"2026-05-18T03:56:23.429555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0974v1","created_at":"2026-05-18T03:56:23.429555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0974","created_at":"2026-05-18T03:56:23.429555+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PSDHCD3KPTV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PSDHCD3KPTVON5U","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PSDHCD3","created_at":"2026-05-18T12:26:50.516681+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/2PSDHCD3KPTVON5UXY2JEHHRSY","json":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY.json","graph_json":"https://pith.science/api/pith-number/2PSDHCD3KPTVON5UXY2JEHHRSY/graph.json","events_json":"https://pith.science/api/pith-number/2PSDHCD3KPTVON5UXY2JEHHRSY/events.json","paper":"https://pith.science/paper/2PSDHCD3"},"agent_actions":{"view_html":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY","download_json":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY.json","view_paper":"https://pith.science/paper/2PSDHCD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0974&json=true","fetch_graph":"https://pith.science/api/pith-number/2PSDHCD3KPTVON5UXY2JEHHRSY/graph.json","fetch_events":"https://pith.science/api/pith-number/2PSDHCD3KPTVON5UXY2JEHHRSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY/action/storage_attestation","attest_author":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY/action/author_attestation","sign_citation":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY/action/citation_signature","submit_replication":"https://pith.science/pith/2PSDHCD3KPTVON5UXY2JEHHRSY/action/replication_record"}},"created_at":"2026-05-18T03:56:23.429555+00:00","updated_at":"2026-05-18T03:56:23.429555+00:00"}