{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WBE6SGVBC22DKP2K6OZE4EDB4Z","short_pith_number":"pith:WBE6SGVB","schema_version":"1.0","canonical_sha256":"b049e91aa116b4353f4af3b24e1061e66ebe36f6536de34dbcecda10757bae23","source":{"kind":"arxiv","id":"2402.04915","version":3},"attestation_state":"computed","paper":{"title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniela Thyssens, Lars Schmidt-Thieme, Maximilian Stubbemann, S\\\"oren Dittrich, Tim Dernedde","submitted_at":"2024-02-07T14:41:17Z","abstract_excerpt":"Relevant combinatorial optimization problems (COPs) are often NP-hard. While they have been tackled mainly via handcrafted heuristics in the past, advances in neural networks have motivated the development of general methods to learn heuristics from data. Many approaches utilize a neural network to directly construct a solution, but are limited in further improving based on already constructed solutions at inference time. Our approach, Moco, defines a lightweight solution construction procedure, guided by a single continuous vector $\\theta$ (called heatmap) and learns a neural network to updat"},"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":"2402.04915","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T14:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"ec883737e0fe8590c8c194ab23683d91104727c7fddc4a50d612b7e0320c25fc","abstract_canon_sha256":"2782cf545cffc6e59c19cad9742dc24c4ae497211463df7be0a9462605de617c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:26.277636Z","signature_b64":"ZDHSFt2tqHjIMM3Dn01SXqnpLMQVocmmffOTEIkwU+SvJsRkWhAehyPK5EUqhb46C00nc9tZRFIiXWB8lcpACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b049e91aa116b4353f4af3b24e1061e66ebe36f6536de34dbcecda10757bae23","last_reissued_at":"2026-07-05T12:04:26.277126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:26.277126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniela Thyssens, Lars Schmidt-Thieme, Maximilian Stubbemann, S\\\"oren Dittrich, Tim Dernedde","submitted_at":"2024-02-07T14:41:17Z","abstract_excerpt":"Relevant combinatorial optimization problems (COPs) are often NP-hard. While they have been tackled mainly via handcrafted heuristics in the past, advances in neural networks have motivated the development of general methods to learn heuristics from data. Many approaches utilize a neural network to directly construct a solution, but are limited in further improving based on already constructed solutions at inference time. Our approach, Moco, defines a lightweight solution construction procedure, guided by a single continuous vector $\\theta$ (called heatmap) and learns a neural network to updat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.04915","kind":"arxiv","version":3},"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/2402.04915/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":"2402.04915","created_at":"2026-07-05T12:04:26.277183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.04915v3","created_at":"2026-07-05T12:04:26.277183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.04915","created_at":"2026-07-05T12:04:26.277183+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBE6SGVBC22D","created_at":"2026-07-05T12:04:26.277183+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBE6SGVBC22DKP2K","created_at":"2026-07-05T12:04:26.277183+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBE6SGVB","created_at":"2026-07-05T12:04:26.277183+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/WBE6SGVBC22DKP2K6OZE4EDB4Z","json":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z.json","graph_json":"https://pith.science/api/pith-number/WBE6SGVBC22DKP2K6OZE4EDB4Z/graph.json","events_json":"https://pith.science/api/pith-number/WBE6SGVBC22DKP2K6OZE4EDB4Z/events.json","paper":"https://pith.science/paper/WBE6SGVB"},"agent_actions":{"view_html":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z","download_json":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z.json","view_paper":"https://pith.science/paper/WBE6SGVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.04915&json=true","fetch_graph":"https://pith.science/api/pith-number/WBE6SGVBC22DKP2K6OZE4EDB4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/WBE6SGVBC22DKP2K6OZE4EDB4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z/action/storage_attestation","attest_author":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z/action/author_attestation","sign_citation":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z/action/citation_signature","submit_replication":"https://pith.science/pith/WBE6SGVBC22DKP2K6OZE4EDB4Z/action/replication_record"}},"created_at":"2026-07-05T12:04:26.277183+00:00","updated_at":"2026-07-05T12:04:26.277183+00:00"}