{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5B5HXNHGX7L6QJFI2JVY4J7O47","short_pith_number":"pith:5B5HXNHG","schema_version":"1.0","canonical_sha256":"e87a7bb4e6bfd7e824a8d26b8e27eee7e835dffddeb3bbf77b33bd5556c1a66f","source":{"kind":"arxiv","id":"1706.07450","version":2},"attestation_state":"computed","paper":{"title":"Revised Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Afonso S. Bandeira, Alex Nowak, Joan Bruna, Soledad Villar","submitted_at":"2017-06-22T18:18:58Z","abstract_excerpt":"Inverse problems correspond to a certain type of optimization problems formulated over appropriate input distributions. Recently, there has been a growing interest in understanding the computational hardness of these optimization problems, not only in the worst case, but in an average-complexity sense under this same input distribution.\n  In this revised note, we are interested in studying another aspect of hardness, related to the ability to learn how to solve a problem by simply observing a collection of previously solved instances. These 'planted solutions' are used to supervise the trainin"},"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":"1706.07450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-22T18:18:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"36569cad97a8a207438043c655860e31833022cc31f4b808c66acc860b7066f8","abstract_canon_sha256":"c4893c3d8d1bc7572ded705214e61f42c3d86594603d6dfe1f93833fb8f3d015"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:48.505046Z","signature_b64":"k1+vK2JNvZbqduPfiriBHSj+w7+o3pgdqsjS7NTgxPii2qPnM1WUoBwgv7A+kUdw7DT3iUtxFSNcgTGfRgSaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e87a7bb4e6bfd7e824a8d26b8e27eee7e835dffddeb3bbf77b33bd5556c1a66f","last_reissued_at":"2026-05-18T00:06:48.504532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:48.504532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revised Note on Learning Algorithms for Quadratic Assignment with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Afonso S. Bandeira, Alex Nowak, Joan Bruna, Soledad Villar","submitted_at":"2017-06-22T18:18:58Z","abstract_excerpt":"Inverse problems correspond to a certain type of optimization problems formulated over appropriate input distributions. Recently, there has been a growing interest in understanding the computational hardness of these optimization problems, not only in the worst case, but in an average-complexity sense under this same input distribution.\n  In this revised note, we are interested in studying another aspect of hardness, related to the ability to learn how to solve a problem by simply observing a collection of previously solved instances. These 'planted solutions' are used to supervise the trainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07450","kind":"arxiv","version":2},"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":"1706.07450","created_at":"2026-05-18T00:06:48.504610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.07450v2","created_at":"2026-05-18T00:06:48.504610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07450","created_at":"2026-05-18T00:06:48.504610+00:00"},{"alias_kind":"pith_short_12","alias_value":"5B5HXNHGX7L6","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5B5HXNHGX7L6QJFI","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5B5HXNHG","created_at":"2026-05-18T12:31:00.734936+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/5B5HXNHGX7L6QJFI2JVY4J7O47","json":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47.json","graph_json":"https://pith.science/api/pith-number/5B5HXNHGX7L6QJFI2JVY4J7O47/graph.json","events_json":"https://pith.science/api/pith-number/5B5HXNHGX7L6QJFI2JVY4J7O47/events.json","paper":"https://pith.science/paper/5B5HXNHG"},"agent_actions":{"view_html":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47","download_json":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47.json","view_paper":"https://pith.science/paper/5B5HXNHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.07450&json=true","fetch_graph":"https://pith.science/api/pith-number/5B5HXNHGX7L6QJFI2JVY4J7O47/graph.json","fetch_events":"https://pith.science/api/pith-number/5B5HXNHGX7L6QJFI2JVY4J7O47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47/action/storage_attestation","attest_author":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47/action/author_attestation","sign_citation":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47/action/citation_signature","submit_replication":"https://pith.science/pith/5B5HXNHGX7L6QJFI2JVY4J7O47/action/replication_record"}},"created_at":"2026-05-18T00:06:48.504610+00:00","updated_at":"2026-05-18T00:06:48.504610+00:00"}