{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ALRVAM5RPRSY64HGXA5WRTOV7J","short_pith_number":"pith:ALRVAM5R","canonical_record":{"source":{"id":"1807.04551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T11:42:04Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"69867eb019d488ae5d71aff2d8cc21fff9018eecd637de2a547e508d5843b947","abstract_canon_sha256":"755a41e976ae1376953559d56df05b5fc9f63c6bf6c8b78fddd4964388433a39"},"schema_version":"1.0"},"canonical_sha256":"02e35033b17c658f70e6b83b68cdd5fa6b82d7651b5aa82e83939a6d6e7d5d0a","source":{"kind":"arxiv","id":"1807.04551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04551","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04551v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04551","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"ALRVAM5RPRSY","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALRVAM5RPRSY64HG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALRVAM5R","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ALRVAM5RPRSY64HGXA5WRTOV7J","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T11:42:04Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"69867eb019d488ae5d71aff2d8cc21fff9018eecd637de2a547e508d5843b947","abstract_canon_sha256":"755a41e976ae1376953559d56df05b5fc9f63c6bf6c8b78fddd4964388433a39"},"schema_version":"1.0"},"canonical_sha256":"02e35033b17c658f70e6b83b68cdd5fa6b82d7651b5aa82e83939a6d6e7d5d0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.125646Z","signature_b64":"6NEqC3mS05p9G7rd9BirQwoIVc6iNuymR/Qkn+qKhasBEYm/OyAbqb0npAYN/OQjjAhdTi4xqmCVB8neMXytCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e35033b17c658f70e6b83b68cdd5fa6b82d7651b5aa82e83939a6d6e7d5d0a","last_reissued_at":"2026-05-18T00:10:53.125014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.125014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04551","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-18T00:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JrsB/2MPXqbphEB0GbeDoiMCWjE+V4e+8A44H6/MXjXZAMQB3jaCw74ZD9+Q2hHdIUBHEp1Ygc54OGms/DtRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:16:29.525090Z"},"content_sha256":"a7fbcceb36e469ea09016bd9a32d196619fd4ae383d7691cb866cd44ab588fec","schema_version":"1.0","event_id":"sha256:a7fbcceb36e469ea09016bd9a32d196619fd4ae383d7691cb866cd44ab588fec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ALRVAM5RPRSY64HGXA5WRTOV7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constrained Randomized Shortest-Paths Framework for Optimal Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bertrand Lebichot, Guillaume Guex, Ilkka Kivim\\\"aki, Marco Saerens","submitted_at":"2018-07-12T11:42:04Z","abstract_excerpt":"The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions. First, it shows how to deal with equality constraints on a subset of transition probabilities and develops a generic algorithm for solving this constrained RSP problem using Lagrangian duality. Second, it derives a surprisingly simple iterative procedure to compute the optimal, randomized, routing policy generalizing the previously developed \"soft\" Bellman-Ford algorithm. The resulting algorithm allows balancing exploitation and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04551","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-18T00:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3EpfuPGCg2Exz1nSHC9frSDWhInos7oFfcnYhdUGXiLy5CHUD6HLT2LSpPrmoHJuaR7Tk+DHtBuf9lnIUUpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:16:29.525442Z"},"content_sha256":"54ba88d7f34c6e604118d7b0a04c291433f1df0a28a2d489e5f5cb8888146179","schema_version":"1.0","event_id":"sha256:54ba88d7f34c6e604118d7b0a04c291433f1df0a28a2d489e5f5cb8888146179"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/bundle.json","state_url":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/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-27T09:16:29Z","links":{"resolver":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J","bundle":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/bundle.json","state":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ALRVAM5RPRSY64HGXA5WRTOV7J","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":"755a41e976ae1376953559d56df05b5fc9f63c6bf6c8b78fddd4964388433a39","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T11:42:04Z","title_canon_sha256":"69867eb019d488ae5d71aff2d8cc21fff9018eecd637de2a547e508d5843b947"},"schema_version":"1.0","source":{"id":"1807.04551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04551","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04551v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04551","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"ALRVAM5RPRSY","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALRVAM5RPRSY64HG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALRVAM5R","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:54ba88d7f34c6e604118d7b0a04c291433f1df0a28a2d489e5f5cb8888146179","target":"graph","created_at":"2026-05-18T00:10:53Z","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":"The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions. First, it shows how to deal with equality constraints on a subset of transition probabilities and develops a generic algorithm for solving this constrained RSP problem using Lagrangian duality. Second, it derives a surprisingly simple iterative procedure to compute the optimal, randomized, routing policy generalizing the previously developed \"soft\" Bellman-Ford algorithm. The resulting algorithm allows balancing exploitation and ","authors_text":"Bertrand Lebichot, Guillaume Guex, Ilkka Kivim\\\"aki, Marco Saerens","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T11:42:04Z","title":"A Constrained Randomized Shortest-Paths Framework for Optimal Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04551","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:a7fbcceb36e469ea09016bd9a32d196619fd4ae383d7691cb866cd44ab588fec","target":"record","created_at":"2026-05-18T00:10:53Z","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":"755a41e976ae1376953559d56df05b5fc9f63c6bf6c8b78fddd4964388433a39","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-12T11:42:04Z","title_canon_sha256":"69867eb019d488ae5d71aff2d8cc21fff9018eecd637de2a547e508d5843b947"},"schema_version":"1.0","source":{"id":"1807.04551","kind":"arxiv","version":1}},"canonical_sha256":"02e35033b17c658f70e6b83b68cdd5fa6b82d7651b5aa82e83939a6d6e7d5d0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02e35033b17c658f70e6b83b68cdd5fa6b82d7651b5aa82e83939a6d6e7d5d0a","first_computed_at":"2026-05-18T00:10:53.125014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:53.125014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6NEqC3mS05p9G7rd9BirQwoIVc6iNuymR/Qkn+qKhasBEYm/OyAbqb0npAYN/OQjjAhdTi4xqmCVB8neMXytCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:53.125646Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7fbcceb36e469ea09016bd9a32d196619fd4ae383d7691cb866cd44ab588fec","sha256:54ba88d7f34c6e604118d7b0a04c291433f1df0a28a2d489e5f5cb8888146179"],"state_sha256":"4fef5011526325a0f1a73d75c9c48ebf9a867ed2a02c9cb32af2c36cbef0d117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6hG7fGCvyK0ZZ8MWlBXI7aaJG7FgadO//TqPvPrVMTXx1qn/AkX41ifCFS3txyB4aVv5ti2qygAVx7OnLp5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:16:29.527262Z","bundle_sha256":"dcb6fc0a0095d295ca2bcb13490b6234696041920095c8be582875487245b40d"}}