{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EOCRII2N7DPATZRNKVOONVRPDP","short_pith_number":"pith:EOCRII2N","schema_version":"1.0","canonical_sha256":"238514234df8de09e62d555ce6d62f1bcec8b49ae77c9d4e8609bf96f8b08574","source":{"kind":"arxiv","id":"2504.00987","version":2},"attestation_state":"computed","paper":{"title":"New Improvements in Solving Large LABS Instances Using Massively Parallelizable Memetic Tabu Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jiayu Shen, Marco Pistoia, Niraj Kumar, Zhiwei Zhang","submitted_at":"2025-04-01T17:24:41Z","abstract_excerpt":"Low Autocorrelation Binary Sequences (LABS) is a particularly challenging binary optimization problem which quickly becomes intractable in finding the global optimum for problem sizes beyond 66. This aspect makes LABS appealing to use as a test-bed for meta-heuristic optimization solvers to target large problem sizes. In this work, we introduce a massively parallelized implementation of the memetic tabu search algorithm to tackle LABS problem for sizes up to 120. By effectively combining the block level and thread level parallelism framework within a single Nvidia-A100 GPU, and creating hyper "},"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":"2504.00987","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-04-01T17:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"7f852e4483543c05144d32437c8858c1c68aed664d27782f808e1c2c747aba6c","abstract_canon_sha256":"22e49d6c588d0f7c0cc688e0433d13073fb321b16bc6a4bf57723c481b758399"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:11.362308Z","signature_b64":"+gN2vCrP75ir1JE9dCpWMcH3BqPC1AL3NN0RAIlAyGFm5TdkNrAmTWegY03xTkm9/HlRq+/I6zwDtUBr4UieAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"238514234df8de09e62d555ce6d62f1bcec8b49ae77c9d4e8609bf96f8b08574","last_reissued_at":"2026-07-05T11:54:11.361872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:11.361872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Improvements in Solving Large LABS Instances Using Massively Parallelizable Memetic Tabu Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jiayu Shen, Marco Pistoia, Niraj Kumar, Zhiwei Zhang","submitted_at":"2025-04-01T17:24:41Z","abstract_excerpt":"Low Autocorrelation Binary Sequences (LABS) is a particularly challenging binary optimization problem which quickly becomes intractable in finding the global optimum for problem sizes beyond 66. This aspect makes LABS appealing to use as a test-bed for meta-heuristic optimization solvers to target large problem sizes. In this work, we introduce a massively parallelized implementation of the memetic tabu search algorithm to tackle LABS problem for sizes up to 120. By effectively combining the block level and thread level parallelism framework within a single Nvidia-A100 GPU, and creating hyper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.00987","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/2504.00987/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":"2504.00987","created_at":"2026-07-05T11:54:11.361927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.00987v2","created_at":"2026-07-05T11:54:11.361927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.00987","created_at":"2026-07-05T11:54:11.361927+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOCRII2N7DPA","created_at":"2026-07-05T11:54:11.361927+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOCRII2N7DPATZRN","created_at":"2026-07-05T11:54:11.361927+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOCRII2N","created_at":"2026-07-05T11:54:11.361927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":155,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP","json":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP.json","graph_json":"https://pith.science/api/pith-number/EOCRII2N7DPATZRNKVOONVRPDP/graph.json","events_json":"https://pith.science/api/pith-number/EOCRII2N7DPATZRNKVOONVRPDP/events.json","paper":"https://pith.science/paper/EOCRII2N"},"agent_actions":{"view_html":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP","download_json":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP.json","view_paper":"https://pith.science/paper/EOCRII2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.00987&json=true","fetch_graph":"https://pith.science/api/pith-number/EOCRII2N7DPATZRNKVOONVRPDP/graph.json","fetch_events":"https://pith.science/api/pith-number/EOCRII2N7DPATZRNKVOONVRPDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP/action/storage_attestation","attest_author":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP/action/author_attestation","sign_citation":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP/action/citation_signature","submit_replication":"https://pith.science/pith/EOCRII2N7DPATZRNKVOONVRPDP/action/replication_record"}},"created_at":"2026-07-05T11:54:11.361927+00:00","updated_at":"2026-07-05T11:54:11.361927+00:00"}