{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/an-exact-method-for-computing-the-frustration","title":"An exact method for computing the frustration index in signed networks using binary programming","arxiv_id":"1611.09030","date":null,"proceeding":null,"authors":[],"abstract":null,"url_abs":"https://arxiv.org/abs/1611.09030v3","url_pdf":"https://arxiv.org/pdf/1611.09030v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only"},"code_links":[{"paper_slug":"an-exact-method-for-computing-the-frustration","repo_url":"https://github.com/saref/frustration-index-XOR","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"an-exact-method-for-computing-the-frustration","repo_url":"https://github.com/saref/frustration-index-UBQP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}