{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:JKHJDGA73SQ7XSHSE7POBWV2QI","short_pith_number":"pith:JKHJDGA7","canonical_record":{"source":{"id":"2012.07705","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T16:55:58Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"b87794208be574239059b2b9442a7d6d134c842bd55b4d08a97c8ef74d59e885","abstract_canon_sha256":"69a8ce049b132b95e1086071277d212b57acef4611b3e0df628893fc22129f3c"},"schema_version":"1.0"},"canonical_sha256":"4a8e91981fdca1fbc8f227dee0daba821aecfcda07db07bea67f0207ccc286fa","source":{"kind":"arxiv","id":"2012.07705","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07705","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07705v5","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07705","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"JKHJDGA73SQ7","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"pith_short_16","alias_value":"JKHJDGA73SQ7XSHS","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"pith_short_8","alias_value":"JKHJDGA7","created_at":"2026-07-05T03:44:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:JKHJDGA73SQ7XSHSE7POBWV2QI","target":"record","payload":{"canonical_record":{"source":{"id":"2012.07705","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T16:55:58Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"b87794208be574239059b2b9442a7d6d134c842bd55b4d08a97c8ef74d59e885","abstract_canon_sha256":"69a8ce049b132b95e1086071277d212b57acef4611b3e0df628893fc22129f3c"},"schema_version":"1.0"},"canonical_sha256":"4a8e91981fdca1fbc8f227dee0daba821aecfcda07db07bea67f0207ccc286fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:51.200413Z","signature_b64":"irP9rLwSgeRiPmbz4VyxyuEj33JqWrGMTDdDZJDMcH7o03CqiqhKQRiP0NtOpjXudNMCDl/0MNVI3XVop34ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a8e91981fdca1fbc8f227dee0daba821aecfcda07db07bea67f0207ccc286fa","last_reissued_at":"2026-07-05T03:44:51.199930Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:51.199930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.07705","source_version":5,"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-05T03:44:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y08KTtlHIMjj2HfpKdjGnNoOlOINf4H0PkJMPNwExoa8vTKisIt2tTfMahdNuIjzHcSa6pV0Vwy1mlNVgUicDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:12:42.335607Z"},"content_sha256":"d843b6b9cfeead3ca873046b8cb05c3c1cf0d8e11191ebd2e5f9b32e6a1733e5","schema_version":"1.0","event_id":"sha256:d843b6b9cfeead3ca873046b8cb05c3c1cf0d8e11191ebd2e5f9b32e6a1733e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:JKHJDGA73SQ7XSHSE7POBWV2QI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hybrid control framework for an optimal visiting problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Adriano Festa, Fabio Bagagiolo, Luciano Marzufero","submitted_at":"2020-12-14T16:55:58Z","abstract_excerpt":"The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close as possible to a collection of target points. The problem does not verify the dynamic programming principle, and it needs a specific formulation to keep track of the visited target points. In this paper, we introduce a hybrid approach by adding a discontinuous part of the trajectory switching between a group of discrete states related to the targets. Then, we show the well-posedness of the related Hamilton-Jacobi problem, by reformulating the optimal visiting as a collection of time-dependent op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07705","kind":"arxiv","version":5},"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/2012.07705/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-05T03:44:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6PVD0WvI6syyPdEwwVQOnWH3r+zggKKR1fDX9xF8GrlnqzZSD6ndzaBkNLuyK97HTDqUqVbkRdEq67u2ut1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:12:42.336017Z"},"content_sha256":"7cacb10bce44c71ddd1fdf852b239895f427646ee00e5665c5a77f1698692aa7","schema_version":"1.0","event_id":"sha256:7cacb10bce44c71ddd1fdf852b239895f427646ee00e5665c5a77f1698692aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKHJDGA73SQ7XSHSE7POBWV2QI/bundle.json","state_url":"https://pith.science/pith/JKHJDGA73SQ7XSHSE7POBWV2QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKHJDGA73SQ7XSHSE7POBWV2QI/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-07T04:12:42Z","links":{"resolver":"https://pith.science/pith/JKHJDGA73SQ7XSHSE7POBWV2QI","bundle":"https://pith.science/pith/JKHJDGA73SQ7XSHSE7POBWV2QI/bundle.json","state":"https://pith.science/pith/JKHJDGA73SQ7XSHSE7POBWV2QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKHJDGA73SQ7XSHSE7POBWV2QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JKHJDGA73SQ7XSHSE7POBWV2QI","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":"69a8ce049b132b95e1086071277d212b57acef4611b3e0df628893fc22129f3c","cross_cats_sorted":["math.AP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T16:55:58Z","title_canon_sha256":"b87794208be574239059b2b9442a7d6d134c842bd55b4d08a97c8ef74d59e885"},"schema_version":"1.0","source":{"id":"2012.07705","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07705","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07705v5","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07705","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"JKHJDGA73SQ7","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"pith_short_16","alias_value":"JKHJDGA73SQ7XSHS","created_at":"2026-07-05T03:44:51Z"},{"alias_kind":"pith_short_8","alias_value":"JKHJDGA7","created_at":"2026-07-05T03:44:51Z"}],"graph_snapshots":[{"event_id":"sha256:7cacb10bce44c71ddd1fdf852b239895f427646ee00e5665c5a77f1698692aa7","target":"graph","created_at":"2026-07-05T03:44:51Z","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/2012.07705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The optimal visiting problem is the optimization of a trajectory that has to touch or pass as close as possible to a collection of target points. The problem does not verify the dynamic programming principle, and it needs a specific formulation to keep track of the visited target points. In this paper, we introduce a hybrid approach by adding a discontinuous part of the trajectory switching between a group of discrete states related to the targets. Then, we show the well-posedness of the related Hamilton-Jacobi problem, by reformulating the optimal visiting as a collection of time-dependent op","authors_text":"Adriano Festa, Fabio Bagagiolo, Luciano Marzufero","cross_cats":["math.AP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T16:55:58Z","title":"A hybrid control framework for an optimal visiting problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07705","kind":"arxiv","version":5},"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:d843b6b9cfeead3ca873046b8cb05c3c1cf0d8e11191ebd2e5f9b32e6a1733e5","target":"record","created_at":"2026-07-05T03:44:51Z","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":"69a8ce049b132b95e1086071277d212b57acef4611b3e0df628893fc22129f3c","cross_cats_sorted":["math.AP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2020-12-14T16:55:58Z","title_canon_sha256":"b87794208be574239059b2b9442a7d6d134c842bd55b4d08a97c8ef74d59e885"},"schema_version":"1.0","source":{"id":"2012.07705","kind":"arxiv","version":5}},"canonical_sha256":"4a8e91981fdca1fbc8f227dee0daba821aecfcda07db07bea67f0207ccc286fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a8e91981fdca1fbc8f227dee0daba821aecfcda07db07bea67f0207ccc286fa","first_computed_at":"2026-07-05T03:44:51.199930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:51.199930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irP9rLwSgeRiPmbz4VyxyuEj33JqWrGMTDdDZJDMcH7o03CqiqhKQRiP0NtOpjXudNMCDl/0MNVI3XVop34ECA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:51.200413Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.07705","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d843b6b9cfeead3ca873046b8cb05c3c1cf0d8e11191ebd2e5f9b32e6a1733e5","sha256:7cacb10bce44c71ddd1fdf852b239895f427646ee00e5665c5a77f1698692aa7"],"state_sha256":"51e794ea3e807fea209832c093e8a97cbe7591174f0817724128425c63c5f763"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4Ab/o0LDoU3eeIuU4krS1pGRY5mg706TBSRKU0ww3nIlHPwsccaHEkOYoAMhVS9g3fU5qwikX3VNhHapDQvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:12:42.339626Z","bundle_sha256":"8846bd52085cf4dcfe5e85fbdef5afc6672cca7fbca46c618ec898fc686c0e8a"}}