{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YQ6NCE2OT3VNTEW3Z7SBHQ4THY","short_pith_number":"pith:YQ6NCE2O","schema_version":"1.0","canonical_sha256":"c43cd1134e9eead992dbcfe413c3933e04f8ad70d6f134969508303866c6f849","source":{"kind":"arxiv","id":"2110.10942","version":2},"attestation_state":"computed","paper":{"title":"Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aleksandar Bojchevski, Jan Schuchardt, Johanna Sommer, Simon Geisler, Stephan G\\\"unnemann","submitted_at":"2021-10-21T07:28:11Z","abstract_excerpt":"End-to-end (geometric) deep learning has seen first successes in approximating the solution of combinatorial optimization problems. However, generating data in the realm of NP-hard/-complete tasks brings practical and theoretical challenges, resulting in evaluation protocols that are too optimistic. Specifically, most datasets only capture a simpler subproblem and likely suffer from spurious features. We investigate these effects by studying adversarial robustness - a local generalization property - to reveal hard, model-specific instances and spurious features. For this purpose, we derive per"},"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":"2110.10942","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-21T07:28:11Z","cross_cats_sorted":[],"title_canon_sha256":"06d326829e158737411db01fb48158d1528751c92b0fd313a0ff44619833ceef","abstract_canon_sha256":"2970f10eef4c41e4808571fd6d961597f3547f3a97d299b9cbb97c663de91843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:46.280928Z","signature_b64":"aRJp2D1qrcvdgA/QqNOWOAsa/XyaHP2hCewW7O4xHxNLDYNHXnDmLIHPsvYeSckHaCo2VIq/Yy+o9OEy8yX+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c43cd1134e9eead992dbcfe413c3933e04f8ad70d6f134969508303866c6f849","last_reissued_at":"2026-07-05T04:06:46.280486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:46.280486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aleksandar Bojchevski, Jan Schuchardt, Johanna Sommer, Simon Geisler, Stephan G\\\"unnemann","submitted_at":"2021-10-21T07:28:11Z","abstract_excerpt":"End-to-end (geometric) deep learning has seen first successes in approximating the solution of combinatorial optimization problems. However, generating data in the realm of NP-hard/-complete tasks brings practical and theoretical challenges, resulting in evaluation protocols that are too optimistic. Specifically, most datasets only capture a simpler subproblem and likely suffer from spurious features. We investigate these effects by studying adversarial robustness - a local generalization property - to reveal hard, model-specific instances and spurious features. For this purpose, we derive per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10942","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.10942/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2110.10942","created_at":"2026-07-05T04:06:46.280544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10942v2","created_at":"2026-07-05T04:06:46.280544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10942","created_at":"2026-07-05T04:06:46.280544+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQ6NCE2OT3VN","created_at":"2026-07-05T04:06:46.280544+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQ6NCE2OT3VNTEW3","created_at":"2026-07-05T04:06:46.280544+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQ6NCE2O","created_at":"2026-07-05T04:06:46.280544+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/YQ6NCE2OT3VNTEW3Z7SBHQ4THY","json":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY.json","graph_json":"https://pith.science/api/pith-number/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/graph.json","events_json":"https://pith.science/api/pith-number/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/events.json","paper":"https://pith.science/paper/YQ6NCE2O"},"agent_actions":{"view_html":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY","download_json":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY.json","view_paper":"https://pith.science/paper/YQ6NCE2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10942&json=true","fetch_graph":"https://pith.science/api/pith-number/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/graph.json","fetch_events":"https://pith.science/api/pith-number/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/action/storage_attestation","attest_author":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/action/author_attestation","sign_citation":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/action/citation_signature","submit_replication":"https://pith.science/pith/YQ6NCE2OT3VNTEW3Z7SBHQ4THY/action/replication_record"}},"created_at":"2026-07-05T04:06:46.280544+00:00","updated_at":"2026-07-05T04:06:46.280544+00:00"}