{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MAYNPU43CDJTPXTWJJTT2X65ME","short_pith_number":"pith:MAYNPU43","canonical_record":{"source":{"id":"2107.13641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2021-07-28T20:54:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6aa0e0567af268cf206b3f5b2b0d4a779efea925e719cb8af81335bc68dc410d","abstract_canon_sha256":"31a05e3ebc4935bbba52a680ddaf0cd6c5f9790f9b5a96ae2d47b60ccd32866b"},"schema_version":"1.0"},"canonical_sha256":"6030d7d39b10d337de764a673d5fdd612629abe509b59c270351e179b3e69998","source":{"kind":"arxiv","id":"2107.13641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.13641","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"2107.13641v1","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.13641","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"MAYNPU43CDJT","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"MAYNPU43CDJTPXTW","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"MAYNPU43","created_at":"2026-07-05T05:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MAYNPU43CDJTPXTWJJTT2X65ME","target":"record","payload":{"canonical_record":{"source":{"id":"2107.13641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2021-07-28T20:54:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6aa0e0567af268cf206b3f5b2b0d4a779efea925e719cb8af81335bc68dc410d","abstract_canon_sha256":"31a05e3ebc4935bbba52a680ddaf0cd6c5f9790f9b5a96ae2d47b60ccd32866b"},"schema_version":"1.0"},"canonical_sha256":"6030d7d39b10d337de764a673d5fdd612629abe509b59c270351e179b3e69998","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:25.270118Z","signature_b64":"5UhY7hA1jnF9WkuTRGIqJe7lxonfnPEwOdzcbvpZNNLILULVDXa3kJ4ju25y2AJbBAmSi3uDgye2z0IVkngMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6030d7d39b10d337de764a673d5fdd612629abe509b59c270351e179b3e69998","last_reissued_at":"2026-07-05T05:30:25.269621Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:25.269621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.13641","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-05T05:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Da0pHV4NO/9A8ETIX071q29+8pIQRvBmeaTPj4+LnlNKifUp1TzvXX/5BspCkKKX+DFp67Xv7gMSv4x6+7SRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T06:31:37.772752Z"},"content_sha256":"c0ae4ae1a5e73fbf48f8a585e86015eb3296d5a750cdad5bb0701d18634f2673","schema_version":"1.0","event_id":"sha256:c0ae4ae1a5e73fbf48f8a585e86015eb3296d5a750cdad5bb0701d18634f2673"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MAYNPU43CDJTPXTWJJTT2X65ME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learned upper bounds for the Time-Dependent Travelling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.AI","authors_text":"Emanuela Guerriero, Gianpaolo Ghiani, Pierpaolo Greco, Tommaso Adamo","submitted_at":"2021-07-28T20:54:59Z","abstract_excerpt":"Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem consists in finding a Hamiltonian tour of least total duration covering the vertices of the graph. The main goal of this work is to define tight upper bounds for this problem by reusing the information gained when solving instances with similar features. This is customary in distribution management, where vehicle routes have to be generated over and over again with similar input data. To this aim, we devise an upper bounding technique based on the solution of a classical (and simpler) time-in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.13641","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/2107.13641/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-05T05:30:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59yAiGkkOoNsV2qRSDvEYC3gloNlXzjL/OGpnGwPbF78ZY0DH1ULdkmq29zM4LUTyXbX0AsoLupsfRHJz0KhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T06:31:37.773136Z"},"content_sha256":"cd78f1f8c0bcbc0b25a99d0f041ad7eddd2d1d3cc661fe7fe12e3e5a3cfab3dc","schema_version":"1.0","event_id":"sha256:cd78f1f8c0bcbc0b25a99d0f041ad7eddd2d1d3cc661fe7fe12e3e5a3cfab3dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAYNPU43CDJTPXTWJJTT2X65ME/bundle.json","state_url":"https://pith.science/pith/MAYNPU43CDJTPXTWJJTT2X65ME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAYNPU43CDJTPXTWJJTT2X65ME/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-12T06:31:37Z","links":{"resolver":"https://pith.science/pith/MAYNPU43CDJTPXTWJJTT2X65ME","bundle":"https://pith.science/pith/MAYNPU43CDJTPXTWJJTT2X65ME/bundle.json","state":"https://pith.science/pith/MAYNPU43CDJTPXTWJJTT2X65ME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAYNPU43CDJTPXTWJJTT2X65ME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MAYNPU43CDJTPXTWJJTT2X65ME","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":"31a05e3ebc4935bbba52a680ddaf0cd6c5f9790f9b5a96ae2d47b60ccd32866b","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2021-07-28T20:54:59Z","title_canon_sha256":"6aa0e0567af268cf206b3f5b2b0d4a779efea925e719cb8af81335bc68dc410d"},"schema_version":"1.0","source":{"id":"2107.13641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.13641","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"arxiv_version","alias_value":"2107.13641v1","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.13641","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"pith_short_12","alias_value":"MAYNPU43CDJT","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"MAYNPU43CDJTPXTW","created_at":"2026-07-05T05:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"MAYNPU43","created_at":"2026-07-05T05:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:cd78f1f8c0bcbc0b25a99d0f041ad7eddd2d1d3cc661fe7fe12e3e5a3cfab3dc","target":"graph","created_at":"2026-07-05T05:30:25Z","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/2107.13641/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem consists in finding a Hamiltonian tour of least total duration covering the vertices of the graph. The main goal of this work is to define tight upper bounds for this problem by reusing the information gained when solving instances with similar features. This is customary in distribution management, where vehicle routes have to be generated over and over again with similar input data. To this aim, we devise an upper bounding technique based on the solution of a classical (and simpler) time-in","authors_text":"Emanuela Guerriero, Gianpaolo Ghiani, Pierpaolo Greco, Tommaso Adamo","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2021-07-28T20:54:59Z","title":"Learned upper bounds for the Time-Dependent Travelling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.13641","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:c0ae4ae1a5e73fbf48f8a585e86015eb3296d5a750cdad5bb0701d18634f2673","target":"record","created_at":"2026-07-05T05:30:25Z","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":"31a05e3ebc4935bbba52a680ddaf0cd6c5f9790f9b5a96ae2d47b60ccd32866b","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2021-07-28T20:54:59Z","title_canon_sha256":"6aa0e0567af268cf206b3f5b2b0d4a779efea925e719cb8af81335bc68dc410d"},"schema_version":"1.0","source":{"id":"2107.13641","kind":"arxiv","version":1}},"canonical_sha256":"6030d7d39b10d337de764a673d5fdd612629abe509b59c270351e179b3e69998","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6030d7d39b10d337de764a673d5fdd612629abe509b59c270351e179b3e69998","first_computed_at":"2026-07-05T05:30:25.269621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:30:25.269621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5UhY7hA1jnF9WkuTRGIqJe7lxonfnPEwOdzcbvpZNNLILULVDXa3kJ4ju25y2AJbBAmSi3uDgye2z0IVkngMAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:30:25.270118Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.13641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0ae4ae1a5e73fbf48f8a585e86015eb3296d5a750cdad5bb0701d18634f2673","sha256:cd78f1f8c0bcbc0b25a99d0f041ad7eddd2d1d3cc661fe7fe12e3e5a3cfab3dc"],"state_sha256":"a3a2d1759d9c1dfa6f320fb013c9fe04bba77eca3efe6ae1cd9c8160622edbe3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/geyr44BonXh7buRSfAlBz5ED7xTBKPGIW/+yHWBOrQHATQBUSKuYLo2FITglU+o+MG8qLlT+WKr7HGdhb+VBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T06:31:37.775588Z","bundle_sha256":"d0c07b41e78b05d982cfc3899c8b5834a4b1a3c426af328c7e4da3d70dbbdd71"}}