{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GKMDVGGRF2UXBUXNIVVPN36572","short_pith_number":"pith:GKMDVGGR","schema_version":"1.0","canonical_sha256":"32983a98d12ea970d2ed456af6efddfea57d32b9cb13dbbef25fa41c94624536","source":{"kind":"arxiv","id":"2101.09629","version":1},"attestation_state":"computed","paper":{"title":"Solving Challenging Large Scale QAPs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Koichi Fujii, Masakazu Kojima, Naoki Ito, Sunyoung Kim, Yuji Shinano","submitted_at":"2021-01-24T02:13:33Z","abstract_excerpt":"We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization problems such as QAPs is a parallel branch-and-bound method efficiently implemented on a powerful computer system using the Ubiquity Generator (UG) framework that can utilize more than 100,000 cores. Lower bounding procedures incorporated in the branch-and-bound method play a crucial role in solving the problems. For a strong lower bounding procedure, we employ the Lagrangian doubly nonnegative (DNN) relaxation and the Ne"},"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":"2101.09629","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-24T02:13:33Z","cross_cats_sorted":[],"title_canon_sha256":"8ee17dff52db56d46e1d1bd5fa188fb977afbf952d4843ce9594c55c2580108a","abstract_canon_sha256":"9c7414d7b4e58751e4e3068afe0ff755c6465d222f1eb5025fd14eade3abc8f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:21.233023Z","signature_b64":"KNtSbTJJ1/y53J+akEr27rW41/S979Q9OdUkCfl5MPu2e86oqYpslUC9BqWYkVA/7G13kKnd1Ryrs+FYnitrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32983a98d12ea970d2ed456af6efddfea57d32b9cb13dbbef25fa41c94624536","last_reissued_at":"2026-07-05T02:09:21.232647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:21.232647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Challenging Large Scale QAPs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Koichi Fujii, Masakazu Kojima, Naoki Ito, Sunyoung Kim, Yuji Shinano","submitted_at":"2021-01-24T02:13:33Z","abstract_excerpt":"We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization problems such as QAPs is a parallel branch-and-bound method efficiently implemented on a powerful computer system using the Ubiquity Generator (UG) framework that can utilize more than 100,000 cores. Lower bounding procedures incorporated in the branch-and-bound method play a crucial role in solving the problems. For a strong lower bounding procedure, we employ the Lagrangian doubly nonnegative (DNN) relaxation and the Ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.09629","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/2101.09629/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":"2101.09629","created_at":"2026-07-05T02:09:21.232711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.09629v1","created_at":"2026-07-05T02:09:21.232711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.09629","created_at":"2026-07-05T02:09:21.232711+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKMDVGGRF2UX","created_at":"2026-07-05T02:09:21.232711+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKMDVGGRF2UXBUXN","created_at":"2026-07-05T02:09:21.232711+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKMDVGGR","created_at":"2026-07-05T02:09:21.232711+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/GKMDVGGRF2UXBUXNIVVPN36572","json":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572.json","graph_json":"https://pith.science/api/pith-number/GKMDVGGRF2UXBUXNIVVPN36572/graph.json","events_json":"https://pith.science/api/pith-number/GKMDVGGRF2UXBUXNIVVPN36572/events.json","paper":"https://pith.science/paper/GKMDVGGR"},"agent_actions":{"view_html":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572","download_json":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572.json","view_paper":"https://pith.science/paper/GKMDVGGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.09629&json=true","fetch_graph":"https://pith.science/api/pith-number/GKMDVGGRF2UXBUXNIVVPN36572/graph.json","fetch_events":"https://pith.science/api/pith-number/GKMDVGGRF2UXBUXNIVVPN36572/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572/action/storage_attestation","attest_author":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572/action/author_attestation","sign_citation":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572/action/citation_signature","submit_replication":"https://pith.science/pith/GKMDVGGRF2UXBUXNIVVPN36572/action/replication_record"}},"created_at":"2026-07-05T02:09:21.232711+00:00","updated_at":"2026-07-05T02:09:21.232711+00:00"}