{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UTKFJFK4OX4QINLRYCQCW6EVY6","short_pith_number":"pith:UTKFJFK4","canonical_record":{"source":{"id":"1608.06520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-23T14:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"9e6cfc5d5b35026c364eee574c66c797945cd09b22d9456c71b32286297af9a6","abstract_canon_sha256":"d813bade4f652e93c66503091953f48c66fa64fb1b28b5c729caa2746ec68d03"},"schema_version":"1.0"},"canonical_sha256":"a4d454955c75f9043571c0a02b7895c7a8eef09466ef87ec498fe4d8ad6c7b1a","source":{"kind":"arxiv","id":"1608.06520","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06520","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06520v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06520","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"UTKFJFK4OX4Q","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UTKFJFK4OX4QINLR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UTKFJFK4","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UTKFJFK4OX4QINLRYCQCW6EVY6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-23T14:26:13Z","cross_cats_sorted":[],"title_canon_sha256":"9e6cfc5d5b35026c364eee574c66c797945cd09b22d9456c71b32286297af9a6","abstract_canon_sha256":"d813bade4f652e93c66503091953f48c66fa64fb1b28b5c729caa2746ec68d03"},"schema_version":"1.0"},"canonical_sha256":"a4d454955c75f9043571c0a02b7895c7a8eef09466ef87ec498fe4d8ad6c7b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.905791Z","signature_b64":"Au7gEBB807vzopCaZzVZMvV/vRGQ96uvlDAYGAAO7KWrjHWdGeqoWfPXnDXtblxAf8GQSRWVEladRfMntl3/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4d454955c75f9043571c0a02b7895c7a8eef09466ef87ec498fe4d8ad6c7b1a","last_reissued_at":"2026-05-18T00:16:50.905147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.905147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06520","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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwwdGOk5OWg4SQMs6PyCWM3dJmpS2olN9VxfT6MEuySoVBc3DMwWAVWXp+uvufMFVzYenE4FQEeyfDZgthQCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:17:19.250722Z"},"content_sha256":"0cdce867d032e41e151f8f150d9fe2291ee3d4770267d798a5679e82701172cb","schema_version":"1.0","event_id":"sha256:0cdce867d032e41e151f8f150d9fe2291ee3d4770267d798a5679e82701172cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UTKFJFK4OX4QINLRYCQCW6EVY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Flows over Time: Models and Complexity Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Wierz, Arie M.C.A. Koster, Britta Peis, Corinna Gottschalk, Daniel Schmand, Frauke Liers","submitted_at":"2016-08-23T14:26:13Z","abstract_excerpt":"We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a certain travel time to traverse an edge.\n  In our setting, we account for uncertain travel times of flow. We investigate maximum flows over time under the assumption that at most $\\Gamma$ travel times may be prolonged simultaneously due to delay. We develop and study a mathematical model for this problem. As the dynamic robust flow problem generalizes the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06520","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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNkxGxchdXamw7SIQUiq4yKIHKxakWqio1YL+f9U8SXGEvZ8ykoejzaT6AnhZ9sHjsbfaaY9XON4NYsSoQa8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:17:19.251227Z"},"content_sha256":"4d9f6e2c8b023a10ae05752736a9e9ccbfc66a7f16e72bdd14ed2ed010d4f37c","schema_version":"1.0","event_id":"sha256:4d9f6e2c8b023a10ae05752736a9e9ccbfc66a7f16e72bdd14ed2ed010d4f37c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTKFJFK4OX4QINLRYCQCW6EVY6/bundle.json","state_url":"https://pith.science/pith/UTKFJFK4OX4QINLRYCQCW6EVY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTKFJFK4OX4QINLRYCQCW6EVY6/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-05-25T17:17:19Z","links":{"resolver":"https://pith.science/pith/UTKFJFK4OX4QINLRYCQCW6EVY6","bundle":"https://pith.science/pith/UTKFJFK4OX4QINLRYCQCW6EVY6/bundle.json","state":"https://pith.science/pith/UTKFJFK4OX4QINLRYCQCW6EVY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTKFJFK4OX4QINLRYCQCW6EVY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UTKFJFK4OX4QINLRYCQCW6EVY6","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":"d813bade4f652e93c66503091953f48c66fa64fb1b28b5c729caa2746ec68d03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-23T14:26:13Z","title_canon_sha256":"9e6cfc5d5b35026c364eee574c66c797945cd09b22d9456c71b32286297af9a6"},"schema_version":"1.0","source":{"id":"1608.06520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06520","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06520v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06520","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"UTKFJFK4OX4Q","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UTKFJFK4OX4QINLR","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UTKFJFK4","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:4d9f6e2c8b023a10ae05752736a9e9ccbfc66a7f16e72bdd14ed2ed010d4f37c","target":"graph","created_at":"2026-05-18T00:16:50Z","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 dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a certain travel time to traverse an edge.\n  In our setting, we account for uncertain travel times of flow. We investigate maximum flows over time under the assumption that at most $\\Gamma$ travel times may be prolonged simultaneously due to delay. We develop and study a mathematical model for this problem. As the dynamic robust flow problem generalizes the s","authors_text":"Andreas Wierz, Arie M.C.A. Koster, Britta Peis, Corinna Gottschalk, Daniel Schmand, Frauke Liers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-23T14:26:13Z","title":"Robust Flows over Time: Models and Complexity Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06520","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:0cdce867d032e41e151f8f150d9fe2291ee3d4770267d798a5679e82701172cb","target":"record","created_at":"2026-05-18T00:16:50Z","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":"d813bade4f652e93c66503091953f48c66fa64fb1b28b5c729caa2746ec68d03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-23T14:26:13Z","title_canon_sha256":"9e6cfc5d5b35026c364eee574c66c797945cd09b22d9456c71b32286297af9a6"},"schema_version":"1.0","source":{"id":"1608.06520","kind":"arxiv","version":2}},"canonical_sha256":"a4d454955c75f9043571c0a02b7895c7a8eef09466ef87ec498fe4d8ad6c7b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4d454955c75f9043571c0a02b7895c7a8eef09466ef87ec498fe4d8ad6c7b1a","first_computed_at":"2026-05-18T00:16:50.905147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:50.905147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Au7gEBB807vzopCaZzVZMvV/vRGQ96uvlDAYGAAO7KWrjHWdGeqoWfPXnDXtblxAf8GQSRWVEladRfMntl3/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:50.905791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cdce867d032e41e151f8f150d9fe2291ee3d4770267d798a5679e82701172cb","sha256:4d9f6e2c8b023a10ae05752736a9e9ccbfc66a7f16e72bdd14ed2ed010d4f37c"],"state_sha256":"49471ff781287715c4b116e89d006811ceed4a0fcd0640694fc80e68263d61d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tg1A6DFb4U+AwxeM9E8D80VLMGl8KPtmGG1ebyT4breDVdpVA9m6gkIb/MndUHKyu1EoZxxTwZQKoFzUwaUoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:17:19.254099Z","bundle_sha256":"c6e9ffca6fcb89ee006e3806b34c9c86f55e832b92d1ef8323aeb981cb044ab8"}}