{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PJRCAEY2ZN5IU5JIMKZXJBLAUP","short_pith_number":"pith:PJRCAEY2","schema_version":"1.0","canonical_sha256":"7a6220131acb7a8a752862b3748560a3d0fd4f16b96b30707fcf48efeca0c29b","source":{"kind":"arxiv","id":"2203.01741","version":2},"attestation_state":"computed","paper":{"title":"Structural Results for High-Multiplicity Scheduling on Uniform Machines","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Fischer, Hauke Brinkop, Klaus Jansen","submitted_at":"2022-03-03T14:33:45Z","abstract_excerpt":"Parameterizing by the largest processing time $p_{max}$ and the number of different job processing times $d$, we propose a proximity technique for High-Multiplicity Scheduling on Uniform Machines for the objectives Makespan Minimization ($C_{max}$) and Santa Claus ($C_{min}$) to obtain new structural results for these problems. The novelty in our approach is that we deal with a fractional solution for only a sub-instance, where the sub-instance itself is not known a priori. While the construction and computation of the fractional solution -- in contrast to usual proximity techniques -- is not "},"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":"2203.01741","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-03-03T14:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"dae76513e822ac5677422525fd85ca90f7b71bd3cd587101cce306eaf4083a15","abstract_canon_sha256":"b58f1ed7c130fcc5fb833246bed039da1c65d887bb2a8a32cf4df62b6d6f85c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:28.463775Z","signature_b64":"H6epWou6VsGtB+5AN+IzGF37kitVBjWwdjqlWk9sr3AkVZpZWMKQHSFlSCKk+VL8TrtxurcDLKP/YPEa8yv/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a6220131acb7a8a752862b3748560a3d0fd4f16b96b30707fcf48efeca0c29b","last_reissued_at":"2026-07-05T09:10:28.463291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:28.463291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Results for High-Multiplicity Scheduling on Uniform Machines","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Fischer, Hauke Brinkop, Klaus Jansen","submitted_at":"2022-03-03T14:33:45Z","abstract_excerpt":"Parameterizing by the largest processing time $p_{max}$ and the number of different job processing times $d$, we propose a proximity technique for High-Multiplicity Scheduling on Uniform Machines for the objectives Makespan Minimization ($C_{max}$) and Santa Claus ($C_{min}$) to obtain new structural results for these problems. The novelty in our approach is that we deal with a fractional solution for only a sub-instance, where the sub-instance itself is not known a priori. While the construction and computation of the fractional solution -- in contrast to usual proximity techniques -- is not "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.01741","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.01741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2203.01741","created_at":"2026-07-05T09:10:28.463353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.01741v2","created_at":"2026-07-05T09:10:28.463353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.01741","created_at":"2026-07-05T09:10:28.463353+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJRCAEY2ZN5I","created_at":"2026-07-05T09:10:28.463353+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJRCAEY2ZN5IU5JI","created_at":"2026-07-05T09:10:28.463353+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJRCAEY2","created_at":"2026-07-05T09:10:28.463353+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04859","citing_title":"ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP","json":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP.json","graph_json":"https://pith.science/api/pith-number/PJRCAEY2ZN5IU5JIMKZXJBLAUP/graph.json","events_json":"https://pith.science/api/pith-number/PJRCAEY2ZN5IU5JIMKZXJBLAUP/events.json","paper":"https://pith.science/paper/PJRCAEY2"},"agent_actions":{"view_html":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP","download_json":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP.json","view_paper":"https://pith.science/paper/PJRCAEY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.01741&json=true","fetch_graph":"https://pith.science/api/pith-number/PJRCAEY2ZN5IU5JIMKZXJBLAUP/graph.json","fetch_events":"https://pith.science/api/pith-number/PJRCAEY2ZN5IU5JIMKZXJBLAUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP/action/storage_attestation","attest_author":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP/action/author_attestation","sign_citation":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP/action/citation_signature","submit_replication":"https://pith.science/pith/PJRCAEY2ZN5IU5JIMKZXJBLAUP/action/replication_record"}},"created_at":"2026-07-05T09:10:28.463353+00:00","updated_at":"2026-07-05T09:10:28.463353+00:00"}