{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JA63UZNAQMMGSRGGEIGSKSJUEH","short_pith_number":"pith:JA63UZNA","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"},"canonical_sha256":"483dba65a083186944c6220d25493421d2ad4a14b34cad8a4ad5560dc9375f76","source":{"kind":"arxiv","id":"1701.07625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07625","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07625v2","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07625","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"JA63UZNAQMMG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JA63UZNAQMMGSRGG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JA63UZNA","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JA63UZNAQMMGSRGGEIGSKSJUEH","target":"record","payload":{"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"},"canonical_sha256":"483dba65a083186944c6220d25493421d2ad4a14b34cad8a4ad5560dc9375f76","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"},"source_kind":"arxiv","source_id":"1701.07625","source_version":2,"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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPAKrsxkuwRMhCVsc0FVoYsiRtDFoKSAu6DMIQti+KUxfz4ccd7AGa/xGBp34aea/MsQp0i67uOl7DHax56zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:47:00.749634Z"},"content_sha256":"e02323471d9c30f5d198ebb07459b92a13fa023ea4b19f72c499afc5a248f31b","schema_version":"1.0","event_id":"sha256:e02323471d9c30f5d198ebb07459b92a13fa023ea4b19f72c499afc5a248f31b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JA63UZNAQMMGSRGGEIGSKSJUEH","target":"graph","payload":{"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"},"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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQqvCCZ99WU2j39DMyF9pudMI+7Nfm8C+8mfKlWDADvSA6l/hXwqFWgRz4emcmyFHjB4eBTcJbaPtK1jVVQoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:47:00.750353Z"},"content_sha256":"a37d75964e4d922ebd90da631abb95bbfe9c0b3a65b7e5de94f6d9a91f7fc021","schema_version":"1.0","event_id":"sha256:a37d75964e4d922ebd90da631abb95bbfe9c0b3a65b7e5de94f6d9a91f7fc021"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/bundle.json","state_url":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/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-09T05:47:00Z","links":{"resolver":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH","bundle":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/bundle.json","state":"https://pith.science/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JA63UZNAQMMGSRGGEIGSKSJUEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JA63UZNAQMMGSRGGEIGSKSJUEH","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":"419a717d1ae1e1a1f82ef9632af8d62216c1b73ad7842fc676aaf533a4d3ab37","cross_cats_sorted":["math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2017-01-26T09:30:27Z","title_canon_sha256":"4657be84ef8fa25d3587673d0aef529fbb71507fd06aaa8b6887b3f4a47b96cb"},"schema_version":"1.0","source":{"id":"1701.07625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07625","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07625v2","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07625","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"JA63UZNAQMMG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JA63UZNAQMMGSRGG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JA63UZNA","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:a37d75964e4d922ebd90da631abb95bbfe9c0b3a65b7e5de94f6d9a91f7fc021","target":"graph","created_at":"2026-05-18T00:34:15Z","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 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","authors_text":"Allen Tannenbaum, Michele Pavon, Tryphon T. Georgiou, Yongxin Chen","cross_cats":["math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2017-01-26T09:30:27Z","title":"Efficient-robust routing for single commodity network flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07625","kind":"arxiv","version":2},"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:e02323471d9c30f5d198ebb07459b92a13fa023ea4b19f72c499afc5a248f31b","target":"record","created_at":"2026-05-18T00:34:15Z","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":"419a717d1ae1e1a1f82ef9632af8d62216c1b73ad7842fc676aaf533a4d3ab37","cross_cats_sorted":["math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2017-01-26T09:30:27Z","title_canon_sha256":"4657be84ef8fa25d3587673d0aef529fbb71507fd06aaa8b6887b3f4a47b96cb"},"schema_version":"1.0","source":{"id":"1701.07625","kind":"arxiv","version":2}},"canonical_sha256":"483dba65a083186944c6220d25493421d2ad4a14b34cad8a4ad5560dc9375f76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"483dba65a083186944c6220d25493421d2ad4a14b34cad8a4ad5560dc9375f76","first_computed_at":"2026-05-18T00:34:15.482551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:15.482551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hAQxMjlvj2WWiPj4gOQ7X76F/tyNyrwjf+Kk3dS9NeP9GeUZLRdnl3hGlV9I6UKnKiauLQK1IRIm3IhEAP+MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:15.483192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e02323471d9c30f5d198ebb07459b92a13fa023ea4b19f72c499afc5a248f31b","sha256:a37d75964e4d922ebd90da631abb95bbfe9c0b3a65b7e5de94f6d9a91f7fc021"],"state_sha256":"258045abfb6d95218b6bf4442662a2cd921a181cbeca55172b1319ff3948e8bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBXI4KLEGzXIfxTb9Gl55JbE5SUhUv5Q9J3SbiPiWBqubGtCmV36T2/dIOwsjr1O/rt5YEtkioUx7ciGI3KzCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:47:00.754456Z","bundle_sha256":"9d5ccca6eb8faec6a325e721ac4eebb8671169241505e02bb1cd1bef2e804a01"}}