{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CAXFHGE26QMC2DRMBRHEGTGCB4","short_pith_number":"pith:CAXFHGE2","canonical_record":{"source":{"id":"2310.01604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T19:55:15Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"8a490a8a87256ca241b9a53cd266f0f8055c7306bf6f0d723ffc8dc164a81b4f","abstract_canon_sha256":"50efbe2998ad2b7b7aa12637037806577b9b131f117bbc9d6c778a32a74c967d"},"schema_version":"1.0"},"canonical_sha256":"102e53989af4182d0e2c0c4e434cc20f1157dfcc4af1063b6f846abf9510c746","source":{"kind":"arxiv","id":"2310.01604","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CAXFHGE26QMC2DRMBRHEGTGCB4","target":"record","payload":{"canonical_record":{"source":{"id":"2310.01604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T19:55:15Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"8a490a8a87256ca241b9a53cd266f0f8055c7306bf6f0d723ffc8dc164a81b4f","abstract_canon_sha256":"50efbe2998ad2b7b7aa12637037806577b9b131f117bbc9d6c778a32a74c967d"},"schema_version":"1.0"},"canonical_sha256":"102e53989af4182d0e2c0c4e434cc20f1157dfcc4af1063b6f846abf9510c746","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:56:42.883730Z","signature_b64":"T9DzFD6s3AonMYDYD82K5Vjh4XV1lVMYzLPRbeb8J8CPfebSyOx8qhuby9lYPzCaavWTCn8ZCoMhIlz5T+0ABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"102e53989af4182d0e2c0c4e434cc20f1157dfcc4af1063b6f846abf9510c746","last_reissued_at":"2026-07-05T06:56:42.883224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:56:42.883224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.01604","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-05T06:56:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vb3mc9OQta4Hu7frn/mQept83Bm5EQcxdvX7oLwX7kuRp9EUNw6smvrpqTFLt3YRoKjXi+WpawwgmmwConkyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:55:04.977297Z"},"content_sha256":"45a3dd80b2e206b45931ce9140b1159e7862bcdd67b743611d7729d95b79b569","schema_version":"1.0","event_id":"sha256:45a3dd80b2e206b45931ce9140b1159e7862bcdd67b743611d7729d95b79b569"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CAXFHGE26QMC2DRMBRHEGTGCB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Quadratic Assignment Problem using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Arthur Delarue, Puneet S. Bagga","submitted_at":"2023-10-02T19:55:15Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01604","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/2310.01604/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-05T06:56:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fi3aPhi1cM+hZo+/YqHLcHGu6Bmf60geRHz8Vq3hkcmYtBdq1vwB8wr+mjkk6mXe9y7V45Zk4/LrS2lg1oYLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:55:04.978015Z"},"content_sha256":"80d75f7db224aea9848938a1a10b449615111d2d143aea21c8581945d15097ed","schema_version":"1.0","event_id":"sha256:80d75f7db224aea9848938a1a10b449615111d2d143aea21c8581945d15097ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAXFHGE26QMC2DRMBRHEGTGCB4/bundle.json","state_url":"https://pith.science/pith/CAXFHGE26QMC2DRMBRHEGTGCB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAXFHGE26QMC2DRMBRHEGTGCB4/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-14T01:55:04Z","links":{"resolver":"https://pith.science/pith/CAXFHGE26QMC2DRMBRHEGTGCB4","bundle":"https://pith.science/pith/CAXFHGE26QMC2DRMBRHEGTGCB4/bundle.json","state":"https://pith.science/pith/CAXFHGE26QMC2DRMBRHEGTGCB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAXFHGE26QMC2DRMBRHEGTGCB4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iwX8qfjqb4xmwdDrxlC6/sn3cIMcF/uYRTcR4ZeOHAiQb6bhpDnzOLzKB80CNWjGKVt60i5gqlYDMqZzoFKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T01:55:04.984471Z","bundle_sha256":"03ad253cf43e72bcad3b6c05986c8a0108570603af359360307808dc30ac39b3"}}