{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EPG2OUUHMLLI7OFOGKQIKQZQL5","short_pith_number":"pith:EPG2OUUH","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"},"canonical_sha256":"23cda7528762d68fb8ae32a08543305f4b0ed3a10c78061451dd66d56b3fc756","source":{"kind":"arxiv","id":"1801.07852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07852","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07852v1","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07852","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"EPG2OUUHMLLI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPG2OUUHMLLI7OFO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPG2OUUH","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EPG2OUUHMLLI7OFOGKQIKQZQL5","target":"record","payload":{"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"},"canonical_sha256":"23cda7528762d68fb8ae32a08543305f4b0ed3a10c78061451dd66d56b3fc756","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"},"source_kind":"arxiv","source_id":"1801.07852","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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5YSWxrUn3Gh1/rK7vJiLwtbwBPCxQrtHqPz2EGAFfQ4QW7JMkl3n7imy3xn3JEYa91RWV64hP0Rt2emTVhQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:11:58.792799Z"},"content_sha256":"33dcfbd57201447f1808b578715f5497f270617d84f36ed869127a1e647f16ae","schema_version":"1.0","event_id":"sha256:33dcfbd57201447f1808b578715f5497f270617d84f36ed869127a1e647f16ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EPG2OUUHMLLI7OFOGKQIKQZQL5","target":"graph","payload":{"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"},"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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJUgdeZpxQd/Mo2qeB/htjMtJtJR9lqujTT4tg2i0zhyjl/DWMMiS/pCKSwXfa6BDDxNMYu7Di5scDgAVy+YBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:11:58.793133Z"},"content_sha256":"0d1a2923156da6f15285bcb6ac1a2a4d2b7bb7d92fe78a3564cfc2814c534602","schema_version":"1.0","event_id":"sha256:0d1a2923156da6f15285bcb6ac1a2a4d2b7bb7d92fe78a3564cfc2814c534602"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/bundle.json","state_url":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/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-08T22:11:58Z","links":{"resolver":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5","bundle":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/bundle.json","state":"https://pith.science/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPG2OUUHMLLI7OFOGKQIKQZQL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EPG2OUUHMLLI7OFOGKQIKQZQL5","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":"870aebe18569c490a0277cf86e73418d335a022b6eac8b43c5f38d5d048b9967","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-24T03:46:00Z","title_canon_sha256":"70e232b7943aee5abd0ce1708930783cfe0328134a1292efb488e0cbbcdac0e4"},"schema_version":"1.0","source":{"id":"1801.07852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07852","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07852v1","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07852","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"EPG2OUUHMLLI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EPG2OUUHMLLI7OFO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EPG2OUUH","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0d1a2923156da6f15285bcb6ac1a2a4d2b7bb7d92fe78a3564cfc2814c534602","target":"graph","created_at":"2026-05-18T00:25:10Z","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 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.","authors_text":"Allen Tannenbaum, Michele Pavon, Tryphon Georgiou, Yongxin Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-24T03:46:00Z","title":"Relaxed Schroedinger bridges and robust network routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07852","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:33dcfbd57201447f1808b578715f5497f270617d84f36ed869127a1e647f16ae","target":"record","created_at":"2026-05-18T00:25:10Z","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":"870aebe18569c490a0277cf86e73418d335a022b6eac8b43c5f38d5d048b9967","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-24T03:46:00Z","title_canon_sha256":"70e232b7943aee5abd0ce1708930783cfe0328134a1292efb488e0cbbcdac0e4"},"schema_version":"1.0","source":{"id":"1801.07852","kind":"arxiv","version":1}},"canonical_sha256":"23cda7528762d68fb8ae32a08543305f4b0ed3a10c78061451dd66d56b3fc756","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23cda7528762d68fb8ae32a08543305f4b0ed3a10c78061451dd66d56b3fc756","first_computed_at":"2026-05-18T00:25:10.682134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:10.682134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXy5DmYamkvOaXabqpvqyjfBaWcMLbVnui1ggbC3B/CpvtMoMeRDE6bqD9sFKKYC92TgjET4ficcJNFncyVMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:10.682714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33dcfbd57201447f1808b578715f5497f270617d84f36ed869127a1e647f16ae","sha256:0d1a2923156da6f15285bcb6ac1a2a4d2b7bb7d92fe78a3564cfc2814c534602"],"state_sha256":"b8513b89ecd04dc17c14c9e787c5798adedeffd77e15f38c796e42eff7ec3e93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v3v6PvVLy23JdsUJ9SYs3/pq+obIxFjTD0u4ekmM2UKxmZer8gbqbEfHrnx6QOdJwD1zrnKT3sq5V4YSfgYhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:11:58.795031Z","bundle_sha256":"45c939d51eb4ed581a5ba9508b72ef7d0ba319560e96d5feadc28c238360a83f"}}