{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UKMUFFMG56RVZCYOTAO4SPXWEZ","short_pith_number":"pith:UKMUFFMG","canonical_record":{"source":{"id":"2403.07028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-11T02:17:42Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"2d08384332e1f76f060063565e8313d85ce81a6c9a3917272baf54ddd6a33439","abstract_canon_sha256":"6f738caf87b90f017e6e746c5081cf5f490cc3e11ac2bb4d15c376490f5b7197"},"schema_version":"1.0"},"canonical_sha256":"a299429586efa35c8b0e981dc93ef6265160d06c778c2ba03dde336608fbbc4e","source":{"kind":"arxiv","id":"2403.07028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.07028","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"2403.07028v1","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07028","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"UKMUFFMG56RV","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"pith_short_16","alias_value":"UKMUFFMG56RVZCYO","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"pith_short_8","alias_value":"UKMUFFMG","created_at":"2026-07-05T07:54:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UKMUFFMG56RVZCYOTAO4SPXWEZ","target":"record","payload":{"canonical_record":{"source":{"id":"2403.07028","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-11T02:17:42Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"2d08384332e1f76f060063565e8313d85ce81a6c9a3917272baf54ddd6a33439","abstract_canon_sha256":"6f738caf87b90f017e6e746c5081cf5f490cc3e11ac2bb4d15c376490f5b7197"},"schema_version":"1.0"},"canonical_sha256":"a299429586efa35c8b0e981dc93ef6265160d06c778c2ba03dde336608fbbc4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:58.238131Z","signature_b64":"KiYdfr9qx4zdUKdSOseFVwMOOnVtybAstQDEYvRdv9JOPWF2D5EASfwg2hb8AVrsGSdmYcaf1WU/DeTK4ITCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a299429586efa35c8b0e981dc93ef6265160d06c778c2ba03dde336608fbbc4e","last_reissued_at":"2026-07-05T07:54:58.237705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:58.237705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.07028","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9s+P8Svee9FgPy41aCkUgzm32ubpmiGaL7NMg6M3uR4D07hBQt9IuCvHOQrFaVY+O1OADQGN5uPrebK1RmIvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:58:04.569619Z"},"content_sha256":"ff4f60d4abbc1eb004039908c5fcad743937cb11c09ec9e7e9dd6fd1d7dcc21d","schema_version":"1.0","event_id":"sha256:ff4f60d4abbc1eb004039908c5fcad743937cb11c09ec9e7e9dd6fd1d7dcc21d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UKMUFFMG56RVZCYOTAO4SPXWEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Anlong Ming, Feng Xue, Nicu Sebe, Runze Guo","submitted_at":"2024-03-11T02:17:42Z","abstract_excerpt":"Recently, neural networks (NN) have made great strides in combinatorial optimization. However, they face challenges when solving the capacitated arc routing problem (CARP) which is to find the minimum-cost tour covering all required edges on a graph, while within capacity constraints. In tackling CARP, NN-based approaches tend to lag behind advanced metaheuristics, since they lack directed arc modeling and efficient learning methods tailored for complex CARP. In this paper, we introduce an NN-based solver to significantly narrow the gap with advanced metaheuristics while exhibiting superior ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.07028/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuItdvrQvNq375MrIblEIZBKmbhVRLNYChnqClA1W+yOix+0BWyDHj4QE7cBbq+2izVI+0CpryNGnIv0IL1RDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:58:04.570219Z"},"content_sha256":"3b6c7612a8f9b19d463c5130b51d4ea02a6dc28b53afc4d9293fb3b475331aad","schema_version":"1.0","event_id":"sha256:3b6c7612a8f9b19d463c5130b51d4ea02a6dc28b53afc4d9293fb3b475331aad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ/bundle.json","state_url":"https://pith.science/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T12:58:04Z","links":{"resolver":"https://pith.science/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ","bundle":"https://pith.science/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ/bundle.json","state":"https://pith.science/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKMUFFMG56RVZCYOTAO4SPXWEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UKMUFFMG56RVZCYOTAO4SPXWEZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6f738caf87b90f017e6e746c5081cf5f490cc3e11ac2bb4d15c376490f5b7197","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-11T02:17:42Z","title_canon_sha256":"2d08384332e1f76f060063565e8313d85ce81a6c9a3917272baf54ddd6a33439"},"schema_version":"1.0","source":{"id":"2403.07028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.07028","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"2403.07028v1","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07028","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"UKMUFFMG56RV","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"pith_short_16","alias_value":"UKMUFFMG56RVZCYO","created_at":"2026-07-05T07:54:58Z"},{"alias_kind":"pith_short_8","alias_value":"UKMUFFMG","created_at":"2026-07-05T07:54:58Z"}],"graph_snapshots":[{"event_id":"sha256:3b6c7612a8f9b19d463c5130b51d4ea02a6dc28b53afc4d9293fb3b475331aad","target":"graph","created_at":"2026-07-05T07:54:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.07028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, neural networks (NN) have made great strides in combinatorial optimization. However, they face challenges when solving the capacitated arc routing problem (CARP) which is to find the minimum-cost tour covering all required edges on a graph, while within capacity constraints. In tackling CARP, NN-based approaches tend to lag behind advanced metaheuristics, since they lack directed arc modeling and efficient learning methods tailored for complex CARP. In this paper, we introduce an NN-based solver to significantly narrow the gap with advanced metaheuristics while exhibiting superior ef","authors_text":"Anlong Ming, Feng Xue, Nicu Sebe, Runze Guo","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-11T02:17:42Z","title":"An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07028","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ff4f60d4abbc1eb004039908c5fcad743937cb11c09ec9e7e9dd6fd1d7dcc21d","target":"record","created_at":"2026-07-05T07:54:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6f738caf87b90f017e6e746c5081cf5f490cc3e11ac2bb4d15c376490f5b7197","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-11T02:17:42Z","title_canon_sha256":"2d08384332e1f76f060063565e8313d85ce81a6c9a3917272baf54ddd6a33439"},"schema_version":"1.0","source":{"id":"2403.07028","kind":"arxiv","version":1}},"canonical_sha256":"a299429586efa35c8b0e981dc93ef6265160d06c778c2ba03dde336608fbbc4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a299429586efa35c8b0e981dc93ef6265160d06c778c2ba03dde336608fbbc4e","first_computed_at":"2026-07-05T07:54:58.237705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:54:58.237705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiYdfr9qx4zdUKdSOseFVwMOOnVtybAstQDEYvRdv9JOPWF2D5EASfwg2hb8AVrsGSdmYcaf1WU/DeTK4ITCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:54:58.238131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.07028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff4f60d4abbc1eb004039908c5fcad743937cb11c09ec9e7e9dd6fd1d7dcc21d","sha256:3b6c7612a8f9b19d463c5130b51d4ea02a6dc28b53afc4d9293fb3b475331aad"],"state_sha256":"794cef6fe53a8a82a6ba98d0485b81ad03ed2faf0956de8bfc83c1647c97a4b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOEUx6dYU6wjVv8fEtJG2Lu82bw5DRAD5xdL57qPC9I+yRbdW+WlZVI8eCeesABl/3Lk3GflH9g0io5sVSbDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T12:58:04.574216Z","bundle_sha256":"477450d8b1418ea2c648298436b954d8cbfb7ca416110fc653b7f5b34833e631"}}