{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPG2OUUHMLLI7OFOGKQIKQZQL5","short_pith_number":"pith:EPG2OUUH","schema_version":"1.0","canonical_sha256":"23cda7528762d68fb8ae32a08543305f4b0ed3a10c78061451dd66d56b3fc756","source":{"kind":"arxiv","id":"1801.07852","version":1},"attestation_state":"computed","paper":{"title":"Relaxed Schroedinger bridges and robust network routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Allen Tannenbaum, Michele Pavon, Tryphon Georgiou, Yongxin Chen","submitted_at":"2018-01-24T03:46:00Z","abstract_excerpt":"We consider network routing under random link failures with a desired final distribution. We provide a mathematical formulation of a relaxed transport problem where the final distribution only needs to be close to the desired one. The problem is a maximum entropy problem for path distributions with an extra terminal cost. We show that the unique solution may be obtained solving a generalized Schroedinger system. An iterative algorithm to compute the solution is provided. It contracts the Hilbert metric with contraction ratio less than 1/2 leading to extremely fast convergence."},"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":"1801.07852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-24T03:46:00Z","cross_cats_sorted":[],"title_canon_sha256":"70e232b7943aee5abd0ce1708930783cfe0328134a1292efb488e0cbbcdac0e4","abstract_canon_sha256":"870aebe18569c490a0277cf86e73418d335a022b6eac8b43c5f38d5d048b9967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:10.682714Z","signature_b64":"wXy5DmYamkvOaXabqpvqyjfBaWcMLbVnui1ggbC3B/CpvtMoMeRDE6bqD9sFKKYC92TgjET4ficcJNFncyVMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23cda7528762d68fb8ae32a08543305f4b0ed3a10c78061451dd66d56b3fc756","last_reissued_at":"2026-05-18T00:25:10.682134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:10.682134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Schroedinger bridges and robust network routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Allen Tannenbaum, Michele Pavon, Tryphon Georgiou, Yongxin Chen","submitted_at":"2018-01-24T03:46:00Z","abstract_excerpt":"We consider network routing under random link failures with a desired final distribution. We provide a mathematical formulation of a relaxed transport problem where the final distribution only needs to be close to the desired one. The problem is a maximum entropy problem for path distributions with an extra terminal cost. We show that the unique solution may be obtained solving a generalized Schroedinger system. An iterative algorithm to compute the solution is provided. It contracts the Hilbert metric with contraction ratio less than 1/2 leading to extremely fast convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07852","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":"1801.07852","created_at":"2026-05-18T00:25:10.682225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07852v1","created_at":"2026-05-18T00:25:10.682225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07852","created_at":"2026-05-18T00:25:10.682225+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPG2OUUHMLLI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPG2OUUHMLLI7OFO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPG2OUUH","created_at":"2026-05-18T12:32:22.470017+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/EPG2OUUHMLLI7OFOGKQIKQZQL5","json":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5.json","graph_json":"https://pith.science/api/pith-number/EPG2OUUHMLLI7OFOGKQIKQZQL5/graph.json","events_json":"https://pith.science/api/pith-number/EPG2OUUHMLLI7OFOGKQIKQZQL5/events.json","paper":"https://pith.science/paper/EPG2OUUH"},"agent_actions":{"view_html":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5","download_json":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5.json","view_paper":"https://pith.science/paper/EPG2OUUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07852&json=true","fetch_graph":"https://pith.science/api/pith-number/EPG2OUUHMLLI7OFOGKQIKQZQL5/graph.json","fetch_events":"https://pith.science/api/pith-number/EPG2OUUHMLLI7OFOGKQIKQZQL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/action/storage_attestation","attest_author":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/action/author_attestation","sign_citation":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/action/citation_signature","submit_replication":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/action/replication_record"}},"created_at":"2026-05-18T00:25:10.682225+00:00","updated_at":"2026-05-18T00:25:10.682225+00:00"}