{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:4MQW4KIVTFILLDMUUXQFEMHJAL","short_pith_number":"pith:4MQW4KIV","canonical_record":{"source":{"id":"2503.10421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-13T14:42:44Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"25047661d048d3f3c90f5d8261923b388f74c0774fad4dc6f10e48e55b60f248","abstract_canon_sha256":"701c5f0c66103080e9e3c55dfe5035db9c3a547f7b5084d4ef98f9f3359a3392"},"schema_version":"1.0"},"canonical_sha256":"e3216e29159950b58d94a5e05230e902e12256292e98716ac6267aa173c9f38c","source":{"kind":"arxiv","id":"2503.10421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10421","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10421v1","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10421","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"4MQW4KIVTFIL","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_16","alias_value":"4MQW4KIVTFILLDMU","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_8","alias_value":"4MQW4KIV","created_at":"2026-07-05T10:30:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:4MQW4KIVTFILLDMUUXQFEMHJAL","target":"record","payload":{"canonical_record":{"source":{"id":"2503.10421","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-13T14:42:44Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"25047661d048d3f3c90f5d8261923b388f74c0774fad4dc6f10e48e55b60f248","abstract_canon_sha256":"701c5f0c66103080e9e3c55dfe5035db9c3a547f7b5084d4ef98f9f3359a3392"},"schema_version":"1.0"},"canonical_sha256":"e3216e29159950b58d94a5e05230e902e12256292e98716ac6267aa173c9f38c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:45.067239Z","signature_b64":"gkFj+HqWbQSwgLO6mcIN071Oo0OnxG6hvj2FQ9rWsRY0PXUHkfz8a82Jtb4LqRfNKHnpVTAtrF4GGMbxExFpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3216e29159950b58d94a5e05230e902e12256292e98716ac6267aa173c9f38c","last_reissued_at":"2026-07-05T10:30:45.066534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:45.066534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.10421","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-05T10:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIUELgAlomhLmPaSpS1bAYEwxrFH5FI4xhby4M13NcuXWVwpZX0ZgFzdtmhI4f3fmOhuMv/znycPFtAtM6uUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:02:51.494878Z"},"content_sha256":"b9d791ee125f5ef11d26585d64b29eb9bea7eda07793273a5e88220fb73f83a0","schema_version":"1.0","event_id":"sha256:b9d791ee125f5ef11d26585d64b29eb9bea7eda07793273a5e88220fb73f83a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:4MQW4KIVTFILLDMUUXQFEMHJAL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Constraint-Based Adaptive Hypergraph Learning for Solving Vehicle Routing: An End-to-End Solution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Ruibin Bai, Tiehua Zhang, Zhenwei Wang","submitted_at":"2025-03-13T14:42:44Z","abstract_excerpt":"The application of learning based methods to vehicle routing problems has emerged as a pivotal area of research in combinatorial optimization. These problems are characterized by vast solution spaces and intricate constraints, making traditional approaches such as exact mathematical models or heuristic methods prone to high computational overhead or reliant on the design of complex heuristic operators to achieve optimal or near optimal solutions. Meanwhile, although some recent learning-based methods can produce good performance for VRP with straightforward constraint scenarios, they often fai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10421","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/2503.10421/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-05T10:30:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhAdKC+C5vVSOymqtGGKoCbTgYrcfFztJ/VEH/hpsojVmMlzevUoe4KO8JBanOjwPJ4gqpEBj/dcswdNW4yXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:02:51.495264Z"},"content_sha256":"254293f0714eeb802aedd32e3e7fb76d405cd9d1b780be5ec846811931225a61","schema_version":"1.0","event_id":"sha256:254293f0714eeb802aedd32e3e7fb76d405cd9d1b780be5ec846811931225a61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MQW4KIVTFILLDMUUXQFEMHJAL/bundle.json","state_url":"https://pith.science/pith/4MQW4KIVTFILLDMUUXQFEMHJAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MQW4KIVTFILLDMUUXQFEMHJAL/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-07-07T11:02:51Z","links":{"resolver":"https://pith.science/pith/4MQW4KIVTFILLDMUUXQFEMHJAL","bundle":"https://pith.science/pith/4MQW4KIVTFILLDMUUXQFEMHJAL/bundle.json","state":"https://pith.science/pith/4MQW4KIVTFILLDMUUXQFEMHJAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MQW4KIVTFILLDMUUXQFEMHJAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:4MQW4KIVTFILLDMUUXQFEMHJAL","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":"701c5f0c66103080e9e3c55dfe5035db9c3a547f7b5084d4ef98f9f3359a3392","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-13T14:42:44Z","title_canon_sha256":"25047661d048d3f3c90f5d8261923b388f74c0774fad4dc6f10e48e55b60f248"},"schema_version":"1.0","source":{"id":"2503.10421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.10421","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"arxiv_version","alias_value":"2503.10421v1","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10421","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_12","alias_value":"4MQW4KIVTFIL","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_16","alias_value":"4MQW4KIVTFILLDMU","created_at":"2026-07-05T10:30:45Z"},{"alias_kind":"pith_short_8","alias_value":"4MQW4KIV","created_at":"2026-07-05T10:30:45Z"}],"graph_snapshots":[{"event_id":"sha256:254293f0714eeb802aedd32e3e7fb76d405cd9d1b780be5ec846811931225a61","target":"graph","created_at":"2026-07-05T10:30:45Z","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/2503.10421/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The application of learning based methods to vehicle routing problems has emerged as a pivotal area of research in combinatorial optimization. These problems are characterized by vast solution spaces and intricate constraints, making traditional approaches such as exact mathematical models or heuristic methods prone to high computational overhead or reliant on the design of complex heuristic operators to achieve optimal or near optimal solutions. Meanwhile, although some recent learning-based methods can produce good performance for VRP with straightforward constraint scenarios, they often fai","authors_text":"Ruibin Bai, Tiehua Zhang, Zhenwei Wang","cross_cats":["cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-13T14:42:44Z","title":"Towards Constraint-Based Adaptive Hypergraph Learning for Solving Vehicle Routing: An End-to-End Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10421","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:b9d791ee125f5ef11d26585d64b29eb9bea7eda07793273a5e88220fb73f83a0","target":"record","created_at":"2026-07-05T10:30:45Z","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":"701c5f0c66103080e9e3c55dfe5035db9c3a547f7b5084d4ef98f9f3359a3392","cross_cats_sorted":["cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-13T14:42:44Z","title_canon_sha256":"25047661d048d3f3c90f5d8261923b388f74c0774fad4dc6f10e48e55b60f248"},"schema_version":"1.0","source":{"id":"2503.10421","kind":"arxiv","version":1}},"canonical_sha256":"e3216e29159950b58d94a5e05230e902e12256292e98716ac6267aa173c9f38c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3216e29159950b58d94a5e05230e902e12256292e98716ac6267aa173c9f38c","first_computed_at":"2026-07-05T10:30:45.066534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:30:45.066534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gkFj+HqWbQSwgLO6mcIN071Oo0OnxG6hvj2FQ9rWsRY0PXUHkfz8a82Jtb4LqRfNKHnpVTAtrF4GGMbxExFpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:30:45.067239Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.10421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9d791ee125f5ef11d26585d64b29eb9bea7eda07793273a5e88220fb73f83a0","sha256:254293f0714eeb802aedd32e3e7fb76d405cd9d1b780be5ec846811931225a61"],"state_sha256":"f9bc02d61406b64f23e768cde18defd8a4b4f7fea189374a02b6763ea1a6952e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHCxbMO922Dj5w8EF3lWMB68Yt3Bzcu/y8UnCBZ/2WGw0NaRktCwH83lgxMerMnBFyuNAIp+GiykA3yfDlKiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:02:51.498492Z","bundle_sha256":"e4d5d7a8c7e28bcb41bb79f14fdeed4012b734533dd427a58b3b696bc021413d"}}