{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JA63UZNAQMMGSRGGEIGSKSJUEH","short_pith_number":"pith:JA63UZNA","schema_version":"1.0","canonical_sha256":"483dba65a083186944c6220d25493421d2ad4a14b34cad8a4ad5560dc9375f76","source":{"kind":"arxiv","id":"1701.07625","version":2},"attestation_state":"computed","paper":{"title":"Efficient-robust routing for single commodity network flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Allen Tannenbaum, Michele Pavon, Tryphon T. Georgiou, Yongxin Chen","submitted_at":"2017-01-26T09:30:27Z","abstract_excerpt":"We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains with prescribed initial and final marginals. From a computational standpoint, viewing scheduling this way is especially attractive in light of the existence of an iterative algorithm to compute the solution. The present paper builds on [13] by introducing an index of efficiency of a transportation plan and points, accordingly, to efficient-robust transport poli"},"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":"1701.07625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2017-01-26T09:30:27Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"4657be84ef8fa25d3587673d0aef529fbb71507fd06aaa8b6887b3f4a47b96cb","abstract_canon_sha256":"419a717d1ae1e1a1f82ef9632af8d62216c1b73ad7842fc676aaf533a4d3ab37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:15.483192Z","signature_b64":"hAQxMjlvj2WWiPj4gOQ7X76F/tyNyrwjf+Kk3dS9NeP9GeUZLRdnl3hGlV9I6UKnKiauLQK1IRIm3IhEAP+MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"483dba65a083186944c6220d25493421d2ad4a14b34cad8a4ad5560dc9375f76","last_reissued_at":"2026-05-18T00:34:15.482551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:15.482551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient-robust routing for single commodity network flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Allen Tannenbaum, Michele Pavon, Tryphon T. Georgiou, Yongxin Chen","submitted_at":"2017-01-26T09:30:27Z","abstract_excerpt":"We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains with prescribed initial and final marginals. From a computational standpoint, viewing scheduling this way is especially attractive in light of the existence of an iterative algorithm to compute the solution. The present paper builds on [13] by introducing an index of efficiency of a transportation plan and points, accordingly, to efficient-robust transport poli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07625","kind":"arxiv","version":2},"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":"1701.07625","created_at":"2026-05-18T00:34:15.482654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07625v2","created_at":"2026-05-18T00:34:15.482654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07625","created_at":"2026-05-18T00:34:15.482654+00:00"},{"alias_kind":"pith_short_12","alias_value":"JA63UZNAQMMG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JA63UZNAQMMGSRGG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JA63UZNA","created_at":"2026-05-18T12:31:21.493067+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/JA63UZNAQMMGSRGGEIGSKSJUEH","json":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH.json","graph_json":"https://pith.science/api/pith-number/JA63UZNAQMMGSRGGEIGSKSJUEH/graph.json","events_json":"https://pith.science/api/pith-number/JA63UZNAQMMGSRGGEIGSKSJUEH/events.json","paper":"https://pith.science/paper/JA63UZNA"},"agent_actions":{"view_html":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH","download_json":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH.json","view_paper":"https://pith.science/paper/JA63UZNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07625&json=true","fetch_graph":"https://pith.science/api/pith-number/JA63UZNAQMMGSRGGEIGSKSJUEH/graph.json","fetch_events":"https://pith.science/api/pith-number/JA63UZNAQMMGSRGGEIGSKSJUEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/action/storage_attestation","attest_author":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/action/author_attestation","sign_citation":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/action/citation_signature","submit_replication":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/action/replication_record"}},"created_at":"2026-05-18T00:34:15.482654+00:00","updated_at":"2026-05-18T00:34:15.482654+00:00"}