{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6Z4QQVKNBJ3IZEBY26PE4A2CN6","short_pith_number":"pith:6Z4QQVKN","canonical_record":{"source":{"id":"1604.04146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T13:25:42Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"fbb7722e466e48be1a330af8e54dd28a5510c524e543735be03afa1c14f845be","abstract_canon_sha256":"e8710ad317c607a186c356c6d9668842cffa3720ff6adc806a32d1de68fdc690"},"schema_version":"1.0"},"canonical_sha256":"f67908554d0a768c9038d79e4e03426fae7d0601630692e9a8e9d4da97268895","source":{"kind":"arxiv","id":"1604.04146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04146","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04146v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04146","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"6Z4QQVKNBJ3I","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6Z4QQVKNBJ3IZEBY","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6Z4QQVKN","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6Z4QQVKNBJ3IZEBY26PE4A2CN6","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T13:25:42Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"fbb7722e466e48be1a330af8e54dd28a5510c524e543735be03afa1c14f845be","abstract_canon_sha256":"e8710ad317c607a186c356c6d9668842cffa3720ff6adc806a32d1de68fdc690"},"schema_version":"1.0"},"canonical_sha256":"f67908554d0a768c9038d79e4e03426fae7d0601630692e9a8e9d4da97268895","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.475163Z","signature_b64":"7iggCLyrXp7XOAzExYLAIJNWAEIznoIVxZ825qzCUYfNVFk82mIARcES1o5qy4PAVU0MaULNNeIRc8eiq9jhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67908554d0a768c9038d79e4e03426fae7d0601630692e9a8e9d4da97268895","last_reissued_at":"2026-05-18T01:17:06.474215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.474215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04146","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-05-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+O9bgibaDC99Nsvav7a9ljL9zwvG5GPUxaBPzMgJkhnc3trVByIE1/FQhmXA17hY11BVgLks0J3LGHRyeKdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:09:09.474880Z"},"content_sha256":"8d726e966458ef03e7440eb99a83787b58b8fed0be3754aecb6879f1084c0683","schema_version":"1.0","event_id":"sha256:8d726e966458ef03e7440eb99a83787b58b8fed0be3754aecb6879f1084c0683"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6Z4QQVKNBJ3IZEBY26PE4A2CN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem Modelling a Newspaper Distribution System with Recycling Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.NE","authors_text":"A. D. Masegosa, A. Perallos, E. Onieva, E. Osaba, F. Diaz, Xin-She Yang","submitted_at":"2016-04-14T13:25:42Z","abstract_excerpt":"A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04146","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":""},"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-05-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03++4SmWcIwY4aL6ZfU1CB1aXsrINztQvvcscEwHltCrx8G7Whl2x9scZrmqebJ367PsOgnqfIZhCePcYskIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:09:09.475887Z"},"content_sha256":"478ba2a86c1607b5fb07e6f8c3ed13ea846d5dafd2e7dcc5635dcea213d0702c","schema_version":"1.0","event_id":"sha256:478ba2a86c1607b5fb07e6f8c3ed13ea846d5dafd2e7dcc5635dcea213d0702c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6/bundle.json","state_url":"https://pith.science/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6/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-05-31T08:09:09Z","links":{"resolver":"https://pith.science/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6","bundle":"https://pith.science/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6/bundle.json","state":"https://pith.science/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z4QQVKNBJ3IZEBY26PE4A2CN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6Z4QQVKNBJ3IZEBY26PE4A2CN6","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":"e8710ad317c607a186c356c6d9668842cffa3720ff6adc806a32d1de68fdc690","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T13:25:42Z","title_canon_sha256":"fbb7722e466e48be1a330af8e54dd28a5510c524e543735be03afa1c14f845be"},"schema_version":"1.0","source":{"id":"1604.04146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04146","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04146v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04146","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"6Z4QQVKNBJ3I","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6Z4QQVKNBJ3IZEBY","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6Z4QQVKN","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:478ba2a86c1607b5fb07e6f8c3ed13ea846d5dafd2e7dcc5635dcea213d0702c","target":"graph","created_at":"2026-05-18T01:17:06Z","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"},"paper":{"abstract_excerpt":"A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographica","authors_text":"A. D. Masegosa, A. Perallos, E. Onieva, E. Osaba, F. Diaz, Xin-She Yang","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T13:25:42Z","title":"A Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem Modelling a Newspaper Distribution System with Recycling Policy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04146","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:8d726e966458ef03e7440eb99a83787b58b8fed0be3754aecb6879f1084c0683","target":"record","created_at":"2026-05-18T01:17:06Z","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":"e8710ad317c607a186c356c6d9668842cffa3720ff6adc806a32d1de68fdc690","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-04-14T13:25:42Z","title_canon_sha256":"fbb7722e466e48be1a330af8e54dd28a5510c524e543735be03afa1c14f845be"},"schema_version":"1.0","source":{"id":"1604.04146","kind":"arxiv","version":1}},"canonical_sha256":"f67908554d0a768c9038d79e4e03426fae7d0601630692e9a8e9d4da97268895","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f67908554d0a768c9038d79e4e03426fae7d0601630692e9a8e9d4da97268895","first_computed_at":"2026-05-18T01:17:06.474215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.474215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7iggCLyrXp7XOAzExYLAIJNWAEIznoIVxZ825qzCUYfNVFk82mIARcES1o5qy4PAVU0MaULNNeIRc8eiq9jhAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.475163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d726e966458ef03e7440eb99a83787b58b8fed0be3754aecb6879f1084c0683","sha256:478ba2a86c1607b5fb07e6f8c3ed13ea846d5dafd2e7dcc5635dcea213d0702c"],"state_sha256":"6be1ffbc22bc4f1d28af73681ebe9c050ab5077e9b54a992a00b4488ec5bdfbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iH9YhaMHAPJuEwaSEZp06b3vP95TIYVWUiOl4WNRooBdBiCH6D4wRwyt3Ja5EiXcrDU9FPIWP+tuXNPp4shkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:09:09.480954Z","bundle_sha256":"ef27533827adaa035d59f01288ea785ea0b07b7c6b16d565146b0b711ee2f06b"}}