{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ALRVAM5RPRSY64HGXA5WRTOV7J","short_pith_number":"pith:ALRVAM5R","schema_version":"1.0","canonical_sha256":"02e35033b17c658f70e6b83b68cdd5fa6b82d7651b5aa82e83939a6d6e7d5d0a","source":{"kind":"arxiv","id":"1807.04551","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.04551","created_at":"2026-05-18T00:10:53.125102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04551v1","created_at":"2026-05-18T00:10:53.125102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04551","created_at":"2026-05-18T00:10:53.125102+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALRVAM5RPRSY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALRVAM5RPRSY64HG","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALRVAM5R","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J","json":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J.json","graph_json":"https://pith.science/api/pith-number/ALRVAM5RPRSY64HGXA5WRTOV7J/graph.json","events_json":"https://pith.science/api/pith-number/ALRVAM5RPRSY64HGXA5WRTOV7J/events.json","paper":"https://pith.science/paper/ALRVAM5R"},"agent_actions":{"view_html":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J","download_json":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J.json","view_paper":"https://pith.science/paper/ALRVAM5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04551&json=true","fetch_graph":"https://pith.science/api/pith-number/ALRVAM5RPRSY64HGXA5WRTOV7J/graph.json","fetch_events":"https://pith.science/api/pith-number/ALRVAM5RPRSY64HGXA5WRTOV7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/action/storage_attestation","attest_author":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/action/author_attestation","sign_citation":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/action/citation_signature","submit_replication":"https://pith.science/pith/ALRVAM5RPRSY64HGXA5WRTOV7J/action/replication_record"}},"created_at":"2026-05-18T00:10:53.125102+00:00","updated_at":"2026-05-18T00:10:53.125102+00:00"}