{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P6GMAID72AK32EIVYNIZJ6HWGZ","short_pith_number":"pith:P6GMAID7","schema_version":"1.0","canonical_sha256":"7f8cc0207fd015bd1115c35194f8f63674106df8ad6ba6678c2c267297d7ee49","source":{"kind":"arxiv","id":"1908.04522","version":1},"attestation_state":"computed","paper":{"title":"A proximal DC approach for quadratic assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chao Ding, Xinyuan Zhao, Zhuoxuan Jiang","submitted_at":"2019-08-13T07:34:57Z","abstract_excerpt":"In this paper, we show that the quadratic assignment problem (QAP) can be reformulated to an equivalent rank constrained doubly nonnegative (DNN) problem. Under the framework of the difference of convex functions (DC) approach, a semi-proximal DC algorithm (DCA) is proposed for solving the relaxation of the rank constrained DNN problem whose subproblems can be solved by the semi-proximal augmented Lagrangian method (sPALM). We show that the generated sequence converges to a stationary point of the corresponding DC problem, which is feasible to the rank constrained DNN problem. Moreover, numeri"},"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":"1908.04522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-13T07:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"689fcb785ab768a24e11952e5a19d30b96daa5a14ee0b88074999a5de30612ae","abstract_canon_sha256":"c098988fb20b389d0024470aee0a761fea0f8f4b1637a2d2c65f4267d8ed632e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:14.503783Z","signature_b64":"8GT7hVkIBhLUZBACP8ngvOqObH1Z0fOo1BYZcY96bkqe3SMYpOkdRaEGnrWoXlN2ViecVgzRwdJmN4IvNYe1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f8cc0207fd015bd1115c35194f8f63674106df8ad6ba6678c2c267297d7ee49","last_reissued_at":"2026-07-04T23:55:14.503379Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:14.503379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proximal DC approach for quadratic assignment problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chao Ding, Xinyuan Zhao, Zhuoxuan Jiang","submitted_at":"2019-08-13T07:34:57Z","abstract_excerpt":"In this paper, we show that the quadratic assignment problem (QAP) can be reformulated to an equivalent rank constrained doubly nonnegative (DNN) problem. Under the framework of the difference of convex functions (DC) approach, a semi-proximal DC algorithm (DCA) is proposed for solving the relaxation of the rank constrained DNN problem whose subproblems can be solved by the semi-proximal augmented Lagrangian method (sPALM). We show that the generated sequence converges to a stationary point of the corresponding DC problem, which is feasible to the rank constrained DNN problem. Moreover, numeri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04522","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/1908.04522/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":"1908.04522","created_at":"2026-07-04T23:55:14.503434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04522v1","created_at":"2026-07-04T23:55:14.503434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04522","created_at":"2026-07-04T23:55:14.503434+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6GMAID72AK3","created_at":"2026-07-04T23:55:14.503434+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6GMAID72AK32EIV","created_at":"2026-07-04T23:55:14.503434+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6GMAID7","created_at":"2026-07-04T23:55:14.503434+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/P6GMAID72AK32EIVYNIZJ6HWGZ","json":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ.json","graph_json":"https://pith.science/api/pith-number/P6GMAID72AK32EIVYNIZJ6HWGZ/graph.json","events_json":"https://pith.science/api/pith-number/P6GMAID72AK32EIVYNIZJ6HWGZ/events.json","paper":"https://pith.science/paper/P6GMAID7"},"agent_actions":{"view_html":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ","download_json":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ.json","view_paper":"https://pith.science/paper/P6GMAID7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04522&json=true","fetch_graph":"https://pith.science/api/pith-number/P6GMAID72AK32EIVYNIZJ6HWGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/P6GMAID72AK32EIVYNIZJ6HWGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ/action/storage_attestation","attest_author":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ/action/author_attestation","sign_citation":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ/action/citation_signature","submit_replication":"https://pith.science/pith/P6GMAID72AK32EIVYNIZJ6HWGZ/action/replication_record"}},"created_at":"2026-07-04T23:55:14.503434+00:00","updated_at":"2026-07-04T23:55:14.503434+00:00"}