{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HDYBGIK2MQBH4TCYWXHMVVV7GK","short_pith_number":"pith:HDYBGIK2","schema_version":"1.0","canonical_sha256":"38f013215a64027e4c58b5cecad6bf328f3c43254b8f39e15dd732f078f5cd7c","source":{"kind":"arxiv","id":"1406.4799","version":1},"attestation_state":"computed","paper":{"title":"A tight bound on the speed-up through storage for quickest multi-commodity flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Gro{\\ss}, Martin Skutella","submitted_at":"2014-06-18T17:12:14Z","abstract_excerpt":"Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO~2002) show that the speed-up through storage is at most a factor of~$2$, and that there are instances where the speed-up is as large as a factor of~$4/3$. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to~$2$."},"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":"1406.4799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-18T17:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"34fd17307cd874e51c953dc34469b2f742d7b45da6406326bd5f2ca9296efb4e","abstract_canon_sha256":"f9523a8a1bb13cf6f2efbb9ef09cd201a7ff1dec1ea6126005119e9711b3a542"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.278548Z","signature_b64":"WMzWCyWRGtBrJ8af68IdImg4w/4MUEMol5QVobD7J1AlaR2aGrHf5JaeLGmKawwFYgFbbrtWZaqJvu3TJ7MsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38f013215a64027e4c58b5cecad6bf328f3c43254b8f39e15dd732f078f5cd7c","last_reissued_at":"2026-05-18T02:49:30.278100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.278100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight bound on the speed-up through storage for quickest multi-commodity flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Gro{\\ss}, Martin Skutella","submitted_at":"2014-06-18T17:12:14Z","abstract_excerpt":"Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO~2002) show that the speed-up through storage is at most a factor of~$2$, and that there are instances where the speed-up is as large as a factor of~$4/3$. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to~$2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4799","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":"1406.4799","created_at":"2026-05-18T02:49:30.278161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4799v1","created_at":"2026-05-18T02:49:30.278161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4799","created_at":"2026-05-18T02:49:30.278161+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDYBGIK2MQBH","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDYBGIK2MQBH4TCY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDYBGIK2","created_at":"2026-05-18T12:28:30.664211+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/HDYBGIK2MQBH4TCYWXHMVVV7GK","json":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK.json","graph_json":"https://pith.science/api/pith-number/HDYBGIK2MQBH4TCYWXHMVVV7GK/graph.json","events_json":"https://pith.science/api/pith-number/HDYBGIK2MQBH4TCYWXHMVVV7GK/events.json","paper":"https://pith.science/paper/HDYBGIK2"},"agent_actions":{"view_html":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK","download_json":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK.json","view_paper":"https://pith.science/paper/HDYBGIK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4799&json=true","fetch_graph":"https://pith.science/api/pith-number/HDYBGIK2MQBH4TCYWXHMVVV7GK/graph.json","fetch_events":"https://pith.science/api/pith-number/HDYBGIK2MQBH4TCYWXHMVVV7GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK/action/storage_attestation","attest_author":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK/action/author_attestation","sign_citation":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK/action/citation_signature","submit_replication":"https://pith.science/pith/HDYBGIK2MQBH4TCYWXHMVVV7GK/action/replication_record"}},"created_at":"2026-05-18T02:49:30.278161+00:00","updated_at":"2026-05-18T02:49:30.278161+00:00"}