{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XMAXONFZYTTR55PBPZQWTFILHU","short_pith_number":"pith:XMAXONFZ","schema_version":"1.0","canonical_sha256":"bb017734b9c4e71ef5e17e6169950b3d32302aee9e07f4740bcb696d29220650","source":{"kind":"arxiv","id":"2401.05956","version":2},"attestation_state":"computed","paper":{"title":"A k-swap Local Search for Makespan Scheduling","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Safari, Lars Rohwedder, Tjark Vredeveld","submitted_at":"2024-01-11T14:53:26Z","abstract_excerpt":"Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong empirical behavior across a wide range of problem domains. In this paper, we address the problem of scheduling a set of jobs on identical parallel machines with the objective of makespan minimization. For this problem, we consider a local search neighborhood, called $k$-swap, which is a generalized version of the widely-used swap and jump neighborhoods. The $k$-swap neighborhood is obtained by swapping at most $k$ job"},"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":"2401.05956","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-01-11T14:53:26Z","cross_cats_sorted":[],"title_canon_sha256":"d8f56d9fbff2b1234e3511b2d0020204d96da9d5b30c5c093a2be7fb9adc1d00","abstract_canon_sha256":"743f0045465d7f166e7d0e41cc17600095900cae7c85dbbebcff59ed39f5339b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:10.032710Z","signature_b64":"w+rbISxKMN8f4M9zpyCRVS7W5fYMOv2Aoa18n789+dkWufj/5N0zsnMHmnbdnP2Mi9icsfcHR95Kabi1wVQUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb017734b9c4e71ef5e17e6169950b3d32302aee9e07f4740bcb696d29220650","last_reissued_at":"2026-07-05T11:02:10.032276Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:10.032276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A k-swap Local Search for Makespan Scheduling","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Safari, Lars Rohwedder, Tjark Vredeveld","submitted_at":"2024-01-11T14:53:26Z","abstract_excerpt":"Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong empirical behavior across a wide range of problem domains. In this paper, we address the problem of scheduling a set of jobs on identical parallel machines with the objective of makespan minimization. For this problem, we consider a local search neighborhood, called $k$-swap, which is a generalized version of the widely-used swap and jump neighborhoods. The $k$-swap neighborhood is obtained by swapping at most $k$ job"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05956","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/2401.05956/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":"2401.05956","created_at":"2026-07-05T11:02:10.032342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.05956v2","created_at":"2026-07-05T11:02:10.032342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05956","created_at":"2026-07-05T11:02:10.032342+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMAXONFZYTTR","created_at":"2026-07-05T11:02:10.032342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMAXONFZYTTR55PB","created_at":"2026-07-05T11:02:10.032342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMAXONFZ","created_at":"2026-07-05T11:02:10.032342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17245","citing_title":"Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU","json":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU.json","graph_json":"https://pith.science/api/pith-number/XMAXONFZYTTR55PBPZQWTFILHU/graph.json","events_json":"https://pith.science/api/pith-number/XMAXONFZYTTR55PBPZQWTFILHU/events.json","paper":"https://pith.science/paper/XMAXONFZ"},"agent_actions":{"view_html":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU","download_json":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU.json","view_paper":"https://pith.science/paper/XMAXONFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.05956&json=true","fetch_graph":"https://pith.science/api/pith-number/XMAXONFZYTTR55PBPZQWTFILHU/graph.json","fetch_events":"https://pith.science/api/pith-number/XMAXONFZYTTR55PBPZQWTFILHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU/action/storage_attestation","attest_author":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU/action/author_attestation","sign_citation":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU/action/citation_signature","submit_replication":"https://pith.science/pith/XMAXONFZYTTR55PBPZQWTFILHU/action/replication_record"}},"created_at":"2026-07-05T11:02:10.032342+00:00","updated_at":"2026-07-05T11:02:10.032342+00:00"}