{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3UKZQ3NZYE4T2BANUATHGVZDTC","short_pith_number":"pith:3UKZQ3NZ","canonical_record":{"source":{"id":"2412.00346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-30T04:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"eea3cc735cbff6eb754ba5e57f0e89ac816bf438ff03be00b913fa3a6a7253d1","abstract_canon_sha256":"6f0cd433d53ac37970fcfe79374abb15bf988b4412b3436b2f29ba1fdc8de529"},"schema_version":"1.0"},"canonical_sha256":"dd15986db9c1393d040da02673572398a6ed35dfc9344e45cb6ac054df66582b","source":{"kind":"arxiv","id":"2412.00346","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00346","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00346v1","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00346","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"3UKZQ3NZYE4T","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_16","alias_value":"3UKZQ3NZYE4T2BAN","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_8","alias_value":"3UKZQ3NZ","created_at":"2026-07-05T09:42:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3UKZQ3NZYE4T2BANUATHGVZDTC","target":"record","payload":{"canonical_record":{"source":{"id":"2412.00346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-30T04:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"eea3cc735cbff6eb754ba5e57f0e89ac816bf438ff03be00b913fa3a6a7253d1","abstract_canon_sha256":"6f0cd433d53ac37970fcfe79374abb15bf988b4412b3436b2f29ba1fdc8de529"},"schema_version":"1.0"},"canonical_sha256":"dd15986db9c1393d040da02673572398a6ed35dfc9344e45cb6ac054df66582b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:39.901260Z","signature_b64":"0hzVEDrW1zvKbKq5DJ9FVyI44+oToFSHqiUw/B3uZR7qfg7UMMVsMvlZv0PNd8Q5ifx4t+Vdm4+TU7XlyNb9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd15986db9c1393d040da02673572398a6ed35dfc9344e45cb6ac054df66582b","last_reissued_at":"2026-07-05T09:42:39.900850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:39.900850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.00346","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-05T09:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/J67e6h6zK8R7fECv60R13HW+8IDQ4R6y8Qu94bP6PhIaTgVljA7ObB1hzVnzRMSN9yI4/iSTeltFLhLJJmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:32:38.942306Z"},"content_sha256":"2e7296e5794daaab8e361fbb68827f47db1bdea7f9e20a51cbf22875714b3b78","schema_version":"1.0","event_id":"sha256:2e7296e5794daaab8e361fbb68827f47db1bdea7f9e20a51cbf22875714b3b78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3UKZQ3NZYE4T2BANUATHGVZDTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fei Liu, Han Li, Yu Zhang, Zhenkun Wang, Zhi Zheng","submitted_at":"2024-11-30T04:11:36Z","abstract_excerpt":"Vehicle Routing Problems (VRPs) are significant Combinatorial Optimization (CO) problems holding substantial practical importance. Recently, Neural Combinatorial Optimization (NCO), which involves training deep learning models on extensive data to learn vehicle routing heuristics, has emerged as a promising approach due to its efficiency and the reduced need for manual algorithm design. However, applying NCO across diverse real-world scenarios with various constraints necessitates cross-problem capabilities. Current NCO methods typically employ a unified model lacking a constraint-specific str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00346","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/2412.00346/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-05T09:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BU86L7bSobypiDxX2Ktk69/RwjwDva+r55mMGe6Oa0kHzpOG5ODgXB3qSeDcX0IBcownzDkfmS3OQeysfXMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:32:38.942796Z"},"content_sha256":"1fb514a223c4fb3306104c01567795853e22f27f9ec0f4dcbb1d6398ac092d12","schema_version":"1.0","event_id":"sha256:1fb514a223c4fb3306104c01567795853e22f27f9ec0f4dcbb1d6398ac092d12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UKZQ3NZYE4T2BANUATHGVZDTC/bundle.json","state_url":"https://pith.science/pith/3UKZQ3NZYE4T2BANUATHGVZDTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UKZQ3NZYE4T2BANUATHGVZDTC/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-14T14:32:38Z","links":{"resolver":"https://pith.science/pith/3UKZQ3NZYE4T2BANUATHGVZDTC","bundle":"https://pith.science/pith/3UKZQ3NZYE4T2BANUATHGVZDTC/bundle.json","state":"https://pith.science/pith/3UKZQ3NZYE4T2BANUATHGVZDTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UKZQ3NZYE4T2BANUATHGVZDTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3UKZQ3NZYE4T2BANUATHGVZDTC","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":"6f0cd433d53ac37970fcfe79374abb15bf988b4412b3436b2f29ba1fdc8de529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-30T04:11:36Z","title_canon_sha256":"eea3cc735cbff6eb754ba5e57f0e89ac816bf438ff03be00b913fa3a6a7253d1"},"schema_version":"1.0","source":{"id":"2412.00346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.00346","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"2412.00346v1","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00346","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"3UKZQ3NZYE4T","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_16","alias_value":"3UKZQ3NZYE4T2BAN","created_at":"2026-07-05T09:42:39Z"},{"alias_kind":"pith_short_8","alias_value":"3UKZQ3NZ","created_at":"2026-07-05T09:42:39Z"}],"graph_snapshots":[{"event_id":"sha256:1fb514a223c4fb3306104c01567795853e22f27f9ec0f4dcbb1d6398ac092d12","target":"graph","created_at":"2026-07-05T09:42:39Z","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/2412.00346/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vehicle Routing Problems (VRPs) are significant Combinatorial Optimization (CO) problems holding substantial practical importance. Recently, Neural Combinatorial Optimization (NCO), which involves training deep learning models on extensive data to learn vehicle routing heuristics, has emerged as a promising approach due to its efficiency and the reduced need for manual algorithm design. However, applying NCO across diverse real-world scenarios with various constraints necessitates cross-problem capabilities. Current NCO methods typically employ a unified model lacking a constraint-specific str","authors_text":"Fei Liu, Han Li, Yu Zhang, Zhenkun Wang, Zhi Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00346","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:2e7296e5794daaab8e361fbb68827f47db1bdea7f9e20a51cbf22875714b3b78","target":"record","created_at":"2026-07-05T09:42:39Z","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":"6f0cd433d53ac37970fcfe79374abb15bf988b4412b3436b2f29ba1fdc8de529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-11-30T04:11:36Z","title_canon_sha256":"eea3cc735cbff6eb754ba5e57f0e89ac816bf438ff03be00b913fa3a6a7253d1"},"schema_version":"1.0","source":{"id":"2412.00346","kind":"arxiv","version":1}},"canonical_sha256":"dd15986db9c1393d040da02673572398a6ed35dfc9344e45cb6ac054df66582b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd15986db9c1393d040da02673572398a6ed35dfc9344e45cb6ac054df66582b","first_computed_at":"2026-07-05T09:42:39.900850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:39.900850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0hzVEDrW1zvKbKq5DJ9FVyI44+oToFSHqiUw/B3uZR7qfg7UMMVsMvlZv0PNd8Q5ifx4t+Vdm4+TU7XlyNb9CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:39.901260Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.00346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7296e5794daaab8e361fbb68827f47db1bdea7f9e20a51cbf22875714b3b78","sha256:1fb514a223c4fb3306104c01567795853e22f27f9ec0f4dcbb1d6398ac092d12"],"state_sha256":"f45e554847ea78f660594169442b97b3b4584991d042403866bd01ac1ead3945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtlRXXaKk9FII5l867QiWlxxRb/7SgToEbCdGI6n73V1QUUsRjoYGrChFucz5CZiRNAvLdjELpjA4AwQk5QOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T14:32:38.946996Z","bundle_sha256":"c47ddd57ab64f6c23c1506b1370aa25714dc09b52ce69e80ae38fd393c9b997e"}}