{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CEDDEY6B22GABL337S2ZNMDEXM","short_pith_number":"pith:CEDDEY6B","canonical_record":{"source":{"id":"1606.09111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T14:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"4944b38abceeae9bd658733d4cbe24ca11832745b42d61b32a660a0cffccd90f","abstract_canon_sha256":"d2a66ef054566d663c97d7f6348f4a3bb53aba2df70c94a47840a4e7babd0c5b"},"schema_version":"1.0"},"canonical_sha256":"11063263c1d68c00af7bfcb596b064bb325c977283e400fa42d5759b7f10ab8a","source":{"kind":"arxiv","id":"1606.09111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09111","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09111v1","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09111","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"CEDDEY6B22GA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CEDDEY6B22GABL33","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CEDDEY6B","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CEDDEY6B22GABL337S2ZNMDEXM","target":"record","payload":{"canonical_record":{"source":{"id":"1606.09111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T14:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"4944b38abceeae9bd658733d4cbe24ca11832745b42d61b32a660a0cffccd90f","abstract_canon_sha256":"d2a66ef054566d663c97d7f6348f4a3bb53aba2df70c94a47840a4e7babd0c5b"},"schema_version":"1.0"},"canonical_sha256":"11063263c1d68c00af7bfcb596b064bb325c977283e400fa42d5759b7f10ab8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:41.715435Z","signature_b64":"d78nAGBmGoZ8hN62J27jV0i4riqH3dFq0mdE+ORz+a8URza4AppZlGoznzQuFKsrTBS30+/i8o6zlXL6qbmDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11063263c1d68c00af7bfcb596b064bb325c977283e400fa42d5759b7f10ab8a","last_reissued_at":"2026-05-18T01:11:41.715092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:41.715092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.09111","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:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQUSua6j6WsS3wOYE8H6ARtg/4PThU514hZfuPcN37S3Rmi2F8NlbDT5N9er6p/yyalNyhBbUAYB7UMfpK8nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:08:34.660063Z"},"content_sha256":"5e162418f8ec20b81afba79840c30dc0c986c08c3b9c7ee39a6f93c8c253ba05","schema_version":"1.0","event_id":"sha256:5e162418f8ec20b81afba79840c30dc0c986c08c3b9c7ee39a6f93c8c253ba05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CEDDEY6B22GABL337S2ZNMDEXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust adaptive strategies for the guidance of users in road networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farida Manseur, Habib Haj-Salem, Jean-Patrick Lebacque, Nadir Farhi","submitted_at":"2016-06-29T14:13:36Z","abstract_excerpt":"We present an algorithm for optimal guidance of users in road networks. It is a \"stochastic-on-time-arrival (SOTA)\"-like algorithm which calculates optimal guidance strategies with reliable paths, for road network origin-destination pairs. Our contribution consists here in extending an existing SOTA algorithm, in order to include robustness of the guidance strategy, towards path failures. The idea of SOTA algorithms is to calculate the maximum probability of reaching a destination node, starting from any node of a road network, and given a time budget. This calculus gives the optimal path for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09111","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:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E28LwpDapprsXvDlvOrH+5ZL/uZkdqY9n0hr3z3jq0NllxKQmIqn/LmEQhc0aRXhU0ORvfEzOhnBOdEcvGpMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:08:34.660779Z"},"content_sha256":"874360092e2e8df3e6b2f852135ec301d3a8ee7094cc423d6b0f1a89b7a3d904","schema_version":"1.0","event_id":"sha256:874360092e2e8df3e6b2f852135ec301d3a8ee7094cc423d6b0f1a89b7a3d904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEDDEY6B22GABL337S2ZNMDEXM/bundle.json","state_url":"https://pith.science/pith/CEDDEY6B22GABL337S2ZNMDEXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEDDEY6B22GABL337S2ZNMDEXM/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-06-08T19:08:34Z","links":{"resolver":"https://pith.science/pith/CEDDEY6B22GABL337S2ZNMDEXM","bundle":"https://pith.science/pith/CEDDEY6B22GABL337S2ZNMDEXM/bundle.json","state":"https://pith.science/pith/CEDDEY6B22GABL337S2ZNMDEXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEDDEY6B22GABL337S2ZNMDEXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CEDDEY6B22GABL337S2ZNMDEXM","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":"d2a66ef054566d663c97d7f6348f4a3bb53aba2df70c94a47840a4e7babd0c5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T14:13:36Z","title_canon_sha256":"4944b38abceeae9bd658733d4cbe24ca11832745b42d61b32a660a0cffccd90f"},"schema_version":"1.0","source":{"id":"1606.09111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.09111","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.09111v1","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09111","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"CEDDEY6B22GA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CEDDEY6B22GABL33","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CEDDEY6B","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:874360092e2e8df3e6b2f852135ec301d3a8ee7094cc423d6b0f1a89b7a3d904","target":"graph","created_at":"2026-05-18T01:11:41Z","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":"We present an algorithm for optimal guidance of users in road networks. It is a \"stochastic-on-time-arrival (SOTA)\"-like algorithm which calculates optimal guidance strategies with reliable paths, for road network origin-destination pairs. Our contribution consists here in extending an existing SOTA algorithm, in order to include robustness of the guidance strategy, towards path failures. The idea of SOTA algorithms is to calculate the maximum probability of reaching a destination node, starting from any node of a road network, and given a time budget. This calculus gives the optimal path for ","authors_text":"Farida Manseur, Habib Haj-Salem, Jean-Patrick Lebacque, Nadir Farhi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T14:13:36Z","title":"Robust adaptive strategies for the guidance of users in road networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09111","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:5e162418f8ec20b81afba79840c30dc0c986c08c3b9c7ee39a6f93c8c253ba05","target":"record","created_at":"2026-05-18T01:11:41Z","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":"d2a66ef054566d663c97d7f6348f4a3bb53aba2df70c94a47840a4e7babd0c5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T14:13:36Z","title_canon_sha256":"4944b38abceeae9bd658733d4cbe24ca11832745b42d61b32a660a0cffccd90f"},"schema_version":"1.0","source":{"id":"1606.09111","kind":"arxiv","version":1}},"canonical_sha256":"11063263c1d68c00af7bfcb596b064bb325c977283e400fa42d5759b7f10ab8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11063263c1d68c00af7bfcb596b064bb325c977283e400fa42d5759b7f10ab8a","first_computed_at":"2026-05-18T01:11:41.715092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:41.715092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d78nAGBmGoZ8hN62J27jV0i4riqH3dFq0mdE+ORz+a8URza4AppZlGoznzQuFKsrTBS30+/i8o6zlXL6qbmDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:41.715435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.09111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e162418f8ec20b81afba79840c30dc0c986c08c3b9c7ee39a6f93c8c253ba05","sha256:874360092e2e8df3e6b2f852135ec301d3a8ee7094cc423d6b0f1a89b7a3d904"],"state_sha256":"da1e1faa86cc6dfb4bbe7319c9ef29bab78ff258badd7d70b5feb57a5f5f9a90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+zFiXl00bf4sqMlyxFcsk+M/E+IoqyMjjqfIdXmEtvszTGi5H8ARnb0sm6fu4t23O2/px3YnLgGRcUTrBG/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:08:34.664680Z","bundle_sha256":"b9424e83f928caa610af138b22646ca001e62c1cd179c8138948b0ac6b6fef79"}}