{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XFHP5NRECCZZNMLR2QCAI3FBEJ","short_pith_number":"pith:XFHP5NRE","canonical_record":{"source":{"id":"2506.01065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T16:08:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"935f20cfd91392ca661d4a141df248060fd05e691d633236901f15f0b60a8dd9","abstract_canon_sha256":"a0c00fc6837661f056197c367323f6fb72b2f3a9e3fea65ccac1fb9132571ebf"},"schema_version":"1.0"},"canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","source":{"kind":"arxiv","id":"2506.01065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01065","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01065v1","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01065","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"XFHP5NRECCZZ","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_16","alias_value":"XFHP5NRECCZZNMLR","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_8","alias_value":"XFHP5NRE","created_at":"2026-07-05T11:13:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XFHP5NRECCZZNMLR2QCAI3FBEJ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T16:08:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"935f20cfd91392ca661d4a141df248060fd05e691d633236901f15f0b60a8dd9","abstract_canon_sha256":"a0c00fc6837661f056197c367323f6fb72b2f3a9e3fea65ccac1fb9132571ebf"},"schema_version":"1.0"},"canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:45.373039Z","signature_b64":"gCBa7mL1jQUMmltaQvmA+b5Ea80Y+/4oF51I9l8AsR9sM7Z5oLZ23SZ34HdJjXwcHS4OR67Ad5xljCLxU72tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","last_reissued_at":"2026-07-05T11:13:45.372612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:45.372612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01065","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-05T11:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QH0DSRhgRvc5fXCjiuMR3l62Dfu8aYCTVvsbnR0RfXE6sQQuoNTRb0imzqqhMzrmXYCfmf/oNOA/qEjbWbUfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:03:46.482421Z"},"content_sha256":"603b3fffae1798e760b025d2daad07b394044c3d48f1278c8774c87593406324","schema_version":"1.0","event_id":"sha256:603b3fffae1798e760b025d2daad07b394044c3d48f1278c8774c87593406324"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XFHP5NRECCZZNMLR2QCAI3FBEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trilevel Memetic Algorithm for the Electric Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Ivan Milinovi\\'c, Leon Stjepan Uroi\\'c, Marko {\\DJ}urasevi\\'c","submitted_at":"2025-06-01T16:08:43Z","abstract_excerpt":"The Electric Vehicle Routing Problem (EVRP) extends the capacitated vehicle routing problem by incorporating battery constraints and charging stations, posing significant optimization challenges. This paper introduces a Trilevel Memetic Algorithm (TMA) that hierarchically optimizes customer sequences, route assignments, and charging station insertions. The method combines genetic algorithms with dynamic programming, ensuring efficient and high-quality solutions. Benchmark tests on WCCI2020 instances show competitive performance, matching best-known results for small-scale cases. While computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01065","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/2506.01065/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-05T11:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/Lz6TKk46G4Zpf4LXNdS8nFxA+gC7YMBu1a2chv/IDVy0c2vPNyvIQgmYetSq7TEiSa8d2qOS4UQmsPIxlTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:03:46.483428Z"},"content_sha256":"53f4f74ff0de9777a6b38fffa6c298361209b9f0be051d7e07dcdc275efe84c9","schema_version":"1.0","event_id":"sha256:53f4f74ff0de9777a6b38fffa6c298361209b9f0be051d7e07dcdc275efe84c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/bundle.json","state_url":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/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-08T08:03:46Z","links":{"resolver":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ","bundle":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/bundle.json","state":"https://pith.science/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFHP5NRECCZZNMLR2QCAI3FBEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XFHP5NRECCZZNMLR2QCAI3FBEJ","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":"a0c00fc6837661f056197c367323f6fb72b2f3a9e3fea65ccac1fb9132571ebf","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T16:08:43Z","title_canon_sha256":"935f20cfd91392ca661d4a141df248060fd05e691d633236901f15f0b60a8dd9"},"schema_version":"1.0","source":{"id":"2506.01065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01065","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01065v1","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01065","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"XFHP5NRECCZZ","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_16","alias_value":"XFHP5NRECCZZNMLR","created_at":"2026-07-05T11:13:45Z"},{"alias_kind":"pith_short_8","alias_value":"XFHP5NRE","created_at":"2026-07-05T11:13:45Z"}],"graph_snapshots":[{"event_id":"sha256:53f4f74ff0de9777a6b38fffa6c298361209b9f0be051d7e07dcdc275efe84c9","target":"graph","created_at":"2026-07-05T11:13: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/2506.01065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Electric Vehicle Routing Problem (EVRP) extends the capacitated vehicle routing problem by incorporating battery constraints and charging stations, posing significant optimization challenges. This paper introduces a Trilevel Memetic Algorithm (TMA) that hierarchically optimizes customer sequences, route assignments, and charging station insertions. The method combines genetic algorithms with dynamic programming, ensuring efficient and high-quality solutions. Benchmark tests on WCCI2020 instances show competitive performance, matching best-known results for small-scale cases. While computat","authors_text":"Ivan Milinovi\\'c, Leon Stjepan Uroi\\'c, Marko {\\DJ}urasevi\\'c","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T16:08:43Z","title":"Trilevel Memetic Algorithm for the Electric Vehicle Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01065","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:603b3fffae1798e760b025d2daad07b394044c3d48f1278c8774c87593406324","target":"record","created_at":"2026-07-05T11:13: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":"a0c00fc6837661f056197c367323f6fb72b2f3a9e3fea65ccac1fb9132571ebf","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-06-01T16:08:43Z","title_canon_sha256":"935f20cfd91392ca661d4a141df248060fd05e691d633236901f15f0b60a8dd9"},"schema_version":"1.0","source":{"id":"2506.01065","kind":"arxiv","version":1}},"canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b94efeb62410b396b171d404046ca12242ebf4330aa062addacf6a330a9ce5d7","first_computed_at":"2026-07-05T11:13:45.372612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:45.372612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gCBa7mL1jQUMmltaQvmA+b5Ea80Y+/4oF51I9l8AsR9sM7Z5oLZ23SZ34HdJjXwcHS4OR67Ad5xljCLxU72tCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:45.373039Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:603b3fffae1798e760b025d2daad07b394044c3d48f1278c8774c87593406324","sha256:53f4f74ff0de9777a6b38fffa6c298361209b9f0be051d7e07dcdc275efe84c9"],"state_sha256":"afbf099a1d4f1172592678dcb6c3f10292e2d33509303983191aaf0410e9d47c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7pUR26erZAwQgF3RSbpKJ8B9aIKxezyF9SOzXApsmhVBL9HHVvbi+Kp8Pcq9HG5lnM1qnFxg78U3hm0kryLBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:03:46.489912Z","bundle_sha256":"5ecb8fdeed028812a5d58d73fa21ecc15dda7845081bfc35939cd04e37e7bee1"}}