{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:V2QYRL734DNUAOL3SSNINQOCKJ","short_pith_number":"pith:V2QYRL73","canonical_record":{"source":{"id":"2411.17245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T09:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"2668eebc0d0ed02072344b5ac862ce594c8516ed56fe5faeb66009e0b65c7f19","abstract_canon_sha256":"f1536a142b620b46820547579d1ba3e8a247ac5006695a43a02806629f961dae"},"schema_version":"1.0"},"canonical_sha256":"aea188affbe0db40397b949a86c1c2525e7c12760ba2690810bdaadd4b227c4d","source":{"kind":"arxiv","id":"2411.17245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17245","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17245v1","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17245","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"V2QYRL734DNU","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"pith_short_16","alias_value":"V2QYRL734DNUAOL3","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"pith_short_8","alias_value":"V2QYRL73","created_at":"2026-07-05T09:40:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:V2QYRL734DNUAOL3SSNINQOCKJ","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T09:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"2668eebc0d0ed02072344b5ac862ce594c8516ed56fe5faeb66009e0b65c7f19","abstract_canon_sha256":"f1536a142b620b46820547579d1ba3e8a247ac5006695a43a02806629f961dae"},"schema_version":"1.0"},"canonical_sha256":"aea188affbe0db40397b949a86c1c2525e7c12760ba2690810bdaadd4b227c4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:29.454232Z","signature_b64":"aHnsT9gw/bcFx/OVz3rYPBVbzioAZQ36vDIFKOzwKU5wV8xevmoH0Zoyx1LZJmAY7GDzd1umSI8Lcr9gXS1DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea188affbe0db40397b949a86c1c2525e7c12760ba2690810bdaadd4b227c4d","last_reissued_at":"2026-07-05T09:40:29.453742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:29.453742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17245","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-07-05T09:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fflFd7h8eNnFxiyurpV2VnT5WOclxTAv/zm5kEZsN3jM3CG1dJJ/M+zy+G+VEIrTDvKXoWF6+uyrZeaVl/TAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:39:15.804234Z"},"content_sha256":"d84e278c23ec21b85988acdf5132e9d7ec3b341c437d357d66f213af2b987c67","schema_version":"1.0","event_id":"sha256:d84e278c23ec21b85988acdf5132e9d7ec3b341c437d357d66f213af2b987c67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:V2QYRL734DNUAOL3SSNINQOCKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Analysis of the k-Swap Neighborhood 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-11-26T09:22:14Z","abstract_excerpt":"Local search is a widely used technique for tackling challenging optimization problems, offering simplicity and strong empirical performance across various 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, by considering a local search neighborhood, called $k$-swap. A $k$-swap neighbor is obtained by interchanging the machine allocations of at most $k$ jobs scheduled on two machines. While local search algorithms often perform well in practice, they can exhibit poor worst-case performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17245","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.17245/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"},"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-07-05T09:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk1AdtxF3bRhvPau2WTwom7bqED1hIJpKcv+R8acF2nY7ekSR3aKS3byuJobcm8+Tr+W/8vudBwHdswvyqcLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:39:15.805165Z"},"content_sha256":"264bee09f34a79eed9557e95be9c860dc3fabe7c9bce0dbea433edf97d96d7fe","schema_version":"1.0","event_id":"sha256:264bee09f34a79eed9557e95be9c860dc3fabe7c9bce0dbea433edf97d96d7fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2QYRL734DNUAOL3SSNINQOCKJ/bundle.json","state_url":"https://pith.science/pith/V2QYRL734DNUAOL3SSNINQOCKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2QYRL734DNUAOL3SSNINQOCKJ/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-08-13T01:39:15Z","links":{"resolver":"https://pith.science/pith/V2QYRL734DNUAOL3SSNINQOCKJ","bundle":"https://pith.science/pith/V2QYRL734DNUAOL3SSNINQOCKJ/bundle.json","state":"https://pith.science/pith/V2QYRL734DNUAOL3SSNINQOCKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2QYRL734DNUAOL3SSNINQOCKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:V2QYRL734DNUAOL3SSNINQOCKJ","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":"f1536a142b620b46820547579d1ba3e8a247ac5006695a43a02806629f961dae","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T09:22:14Z","title_canon_sha256":"2668eebc0d0ed02072344b5ac862ce594c8516ed56fe5faeb66009e0b65c7f19"},"schema_version":"1.0","source":{"id":"2411.17245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17245","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17245v1","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17245","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"V2QYRL734DNU","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"pith_short_16","alias_value":"V2QYRL734DNUAOL3","created_at":"2026-07-05T09:40:29Z"},{"alias_kind":"pith_short_8","alias_value":"V2QYRL73","created_at":"2026-07-05T09:40:29Z"}],"graph_snapshots":[{"event_id":"sha256:264bee09f34a79eed9557e95be9c860dc3fabe7c9bce0dbea433edf97d96d7fe","target":"graph","created_at":"2026-07-05T09:40:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Local search is a widely used technique for tackling challenging optimization problems, offering simplicity and strong empirical performance across various 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, by considering a local search neighborhood, called $k$-swap. A $k$-swap neighbor is obtained by interchanging the machine allocations of at most $k$ jobs scheduled on two machines. While local search algorithms often perform well in practice, they can exhibit poor worst-case performan","authors_text":"Ashkan Safari, Lars Rohwedder, Tjark Vredeveld","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T09:22:14Z","title":"Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17245","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:d84e278c23ec21b85988acdf5132e9d7ec3b341c437d357d66f213af2b987c67","target":"record","created_at":"2026-07-05T09:40:29Z","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":"f1536a142b620b46820547579d1ba3e8a247ac5006695a43a02806629f961dae","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-26T09:22:14Z","title_canon_sha256":"2668eebc0d0ed02072344b5ac862ce594c8516ed56fe5faeb66009e0b65c7f19"},"schema_version":"1.0","source":{"id":"2411.17245","kind":"arxiv","version":1}},"canonical_sha256":"aea188affbe0db40397b949a86c1c2525e7c12760ba2690810bdaadd4b227c4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aea188affbe0db40397b949a86c1c2525e7c12760ba2690810bdaadd4b227c4d","first_computed_at":"2026-07-05T09:40:29.453742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:29.453742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHnsT9gw/bcFx/OVz3rYPBVbzioAZQ36vDIFKOzwKU5wV8xevmoH0Zoyx1LZJmAY7GDzd1umSI8Lcr9gXS1DAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:29.454232Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d84e278c23ec21b85988acdf5132e9d7ec3b341c437d357d66f213af2b987c67","sha256:264bee09f34a79eed9557e95be9c860dc3fabe7c9bce0dbea433edf97d96d7fe"],"state_sha256":"1be8603372ca1866782457c459ee59fc045eeb700bbd88d4bf4ce37780def7c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpCTPadIT/MNx7hiIgbQe5goH6HzInQ/q8CXw+GmSMkQIQNUOcrcPYcEeZk4H3kXlPdejqFtMWLv5Lm1RVcMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:39:15.811566Z","bundle_sha256":"9bde0d1094e474816df1d1710361dc0e01dc90340e94efa667917b5818149579"}}