{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CAXFHGE26QMC2DRMBRHEGTGCB4","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":"50efbe2998ad2b7b7aa12637037806577b9b131f117bbc9d6c778a32a74c967d","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T19:55:15Z","title_canon_sha256":"8a490a8a87256ca241b9a53cd266f0f8055c7306bf6f0d723ffc8dc164a81b4f"},"schema_version":"1.0","source":{"id":"2310.01604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01604","created_at":"2026-07-05T06:56:42Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01604v1","created_at":"2026-07-05T06:56:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01604","created_at":"2026-07-05T06:56:42Z"},{"alias_kind":"pith_short_12","alias_value":"CAXFHGE26QMC","created_at":"2026-07-05T06:56:42Z"},{"alias_kind":"pith_short_16","alias_value":"CAXFHGE26QMC2DRM","created_at":"2026-07-05T06:56:42Z"},{"alias_kind":"pith_short_8","alias_value":"CAXFHGE2","created_at":"2026-07-05T06:56:42Z"}],"graph_snapshots":[{"event_id":"sha256:80d75f7db224aea9848938a1a10b449615111d2d143aea21c8581945d15097ed","target":"graph","created_at":"2026-07-05T06:56:42Z","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/2310.01604/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quadratic Assignment Problem (QAP) is an NP-hard problem which has proven particularly challenging to solve: unlike other combinatorial problems like the traveling salesman problem (TSP), which can be solved to optimality for instances with hundreds or even thousands of locations using advanced integer programming techniques, no methods are known to exactly solve QAP instances of size greater than 30. Solving the QAP is nevertheless important because of its many critical applications, such as electronic wiring design and facility layout selection. We propose a method to solve the original ","authors_text":"Arthur Delarue, Puneet S. Bagga","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T19:55:15Z","title":"Solving the Quadratic Assignment Problem using Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01604","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:45a3dd80b2e206b45931ce9140b1159e7862bcdd67b743611d7729d95b79b569","target":"record","created_at":"2026-07-05T06:56:42Z","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":"50efbe2998ad2b7b7aa12637037806577b9b131f117bbc9d6c778a32a74c967d","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T19:55:15Z","title_canon_sha256":"8a490a8a87256ca241b9a53cd266f0f8055c7306bf6f0d723ffc8dc164a81b4f"},"schema_version":"1.0","source":{"id":"2310.01604","kind":"arxiv","version":1}},"canonical_sha256":"102e53989af4182d0e2c0c4e434cc20f1157dfcc4af1063b6f846abf9510c746","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"102e53989af4182d0e2c0c4e434cc20f1157dfcc4af1063b6f846abf9510c746","first_computed_at":"2026-07-05T06:56:42.883224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:56:42.883224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T9DzFD6s3AonMYDYD82K5Vjh4XV1lVMYzLPRbeb8J8CPfebSyOx8qhuby9lYPzCaavWTCn8ZCoMhIlz5T+0ABg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:56:42.883730Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.01604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45a3dd80b2e206b45931ce9140b1159e7862bcdd67b743611d7729d95b79b569","sha256:80d75f7db224aea9848938a1a10b449615111d2d143aea21c8581945d15097ed"],"state_sha256":"22fe8a319d78eb5296aaa59730ec924082bc6b0b7a2af0f3b7a81c19a3ce9707"}