{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VEK3BKTD77EWH32DIKB2THE5VM","short_pith_number":"pith:VEK3BKTD","schema_version":"1.0","canonical_sha256":"a915b0aa63ffc963ef434283a99c9dab121dfed1cb8b7a7c9bfbfa1017bd7217","source":{"kind":"arxiv","id":"1101.0779","version":1},"attestation_state":"computed","paper":{"title":"The Random Quadratic Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cond-mat.stat-mech","authors_text":"Gerald Paul, H. Eugene Stanley, Jia Shao","submitted_at":"2011-01-04T18:00:58Z","abstract_excerpt":"Optimal assignment of classes to classrooms \\cite{dickey}, design of DNA microarrays \\cite{carvalho}, cross species gene analysis \\cite{kolar}, creation of hospital layouts cite{elshafei}, and assignment of components to locations on circuit boards \\cite{steinberg} are a few of the many problems which have been formulated as a quadratic assignment problem (QAP). Originally formulated in 1957, the QAP is one of the most difficult of all combinatorial optimization problems. Here, we use statistical mechanical methods to study the asymptotic behavior of problems in which the entries of at least o"},"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":"1101.0779","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-01-04T18:00:58Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"824f714f5e899eb1dc7e6ac1796fb96dd1c431e5b0adfba11deabf2a124796a5","abstract_canon_sha256":"0f74497c8f391456255f61538a00936ddc1acf19e54ea2124da914ce1c0f8bee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:13.315687Z","signature_b64":"kjm9mMSfxPgG7fNjwsisGRUXS2aY3f2LvJIhscMcPlcQNxFowxJhmv/GIas5cxxR6dRlqWez+j8Yp0ZKPs33BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a915b0aa63ffc963ef434283a99c9dab121dfed1cb8b7a7c9bfbfa1017bd7217","last_reissued_at":"2026-05-18T02:04:13.314826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:13.314826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Random Quadratic Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cond-mat.stat-mech","authors_text":"Gerald Paul, H. Eugene Stanley, Jia Shao","submitted_at":"2011-01-04T18:00:58Z","abstract_excerpt":"Optimal assignment of classes to classrooms \\cite{dickey}, design of DNA microarrays \\cite{carvalho}, cross species gene analysis \\cite{kolar}, creation of hospital layouts cite{elshafei}, and assignment of components to locations on circuit boards \\cite{steinberg} are a few of the many problems which have been formulated as a quadratic assignment problem (QAP). Originally formulated in 1957, the QAP is one of the most difficult of all combinatorial optimization problems. Here, we use statistical mechanical methods to study the asymptotic behavior of problems in which the entries of at least o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0779","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":""},"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":"1101.0779","created_at":"2026-05-18T02:04:13.314956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0779v1","created_at":"2026-05-18T02:04:13.314956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0779","created_at":"2026-05-18T02:04:13.314956+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEK3BKTD77EW","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEK3BKTD77EWH32D","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEK3BKTD","created_at":"2026-05-18T12:26:44.992195+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/VEK3BKTD77EWH32DIKB2THE5VM","json":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM.json","graph_json":"https://pith.science/api/pith-number/VEK3BKTD77EWH32DIKB2THE5VM/graph.json","events_json":"https://pith.science/api/pith-number/VEK3BKTD77EWH32DIKB2THE5VM/events.json","paper":"https://pith.science/paper/VEK3BKTD"},"agent_actions":{"view_html":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM","download_json":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM.json","view_paper":"https://pith.science/paper/VEK3BKTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0779&json=true","fetch_graph":"https://pith.science/api/pith-number/VEK3BKTD77EWH32DIKB2THE5VM/graph.json","fetch_events":"https://pith.science/api/pith-number/VEK3BKTD77EWH32DIKB2THE5VM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM/action/storage_attestation","attest_author":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM/action/author_attestation","sign_citation":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM/action/citation_signature","submit_replication":"https://pith.science/pith/VEK3BKTD77EWH32DIKB2THE5VM/action/replication_record"}},"created_at":"2026-05-18T02:04:13.314956+00:00","updated_at":"2026-05-18T02:04:13.314956+00:00"}