{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QCKSXXZN6L4VNWUZQ563YVCIM5","short_pith_number":"pith:QCKSXXZN","schema_version":"1.0","canonical_sha256":"80952bdf2df2f956da99877dbc5448676348d700315abcecd5111906bec66158","source":{"kind":"arxiv","id":"1805.06315","version":3},"attestation_state":"computed","paper":{"title":"Short Schedules for Fast Flow Rerouting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Mahmoud Parham, Saeed Akhoondian Amiri, Sebastian Wiederrecht, Stefan Schmid, Szymon Dudycz","submitted_at":"2018-05-15T12:55:49Z","abstract_excerpt":"This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling problem has applications in traffic engineering in communication networks and has recently received much attention in software-defined networks, in which updates are distributed over an asynchronous network by a software controller. However, existing algorithms for this problem either have a super-polynomial runtime or only compute feasible schedules, which d"},"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":"1805.06315","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-15T12:55:49Z","cross_cats_sorted":["cs.CC","cs.NI"],"title_canon_sha256":"60326ac5455f5b7b0005943cc640692030eeefe96ca431a16f9deecb1381faad","abstract_canon_sha256":"b2273c8def60f33256c1cf031060b5f75c0296aa14a8167b2d9bf78677ad0ec7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:36.077215Z","signature_b64":"CQzjxo1mcBheU8FPr3L5MD679YViK9CQ4IU/gfVj5M65A3COpoSSNcZL8yjzy7G6siw9+vN3CNzTmRimh18/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80952bdf2df2f956da99877dbc5448676348d700315abcecd5111906bec66158","last_reissued_at":"2026-05-18T00:15:36.076397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:36.076397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Schedules for Fast Flow Rerouting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DS","authors_text":"Mahmoud Parham, Saeed Akhoondian Amiri, Sebastian Wiederrecht, Stefan Schmid, Szymon Dudycz","submitted_at":"2018-05-15T12:55:49Z","abstract_excerpt":"This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling problem has applications in traffic engineering in communication networks and has recently received much attention in software-defined networks, in which updates are distributed over an asynchronous network by a software controller. However, existing algorithms for this problem either have a super-polynomial runtime or only compute feasible schedules, which d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06315","kind":"arxiv","version":3},"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":"1805.06315","created_at":"2026-05-18T00:15:36.076526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06315v3","created_at":"2026-05-18T00:15:36.076526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06315","created_at":"2026-05-18T00:15:36.076526+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCKSXXZN6L4V","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCKSXXZN6L4VNWUZ","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCKSXXZN","created_at":"2026-05-18T12:32:46.962924+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/QCKSXXZN6L4VNWUZQ563YVCIM5","json":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5.json","graph_json":"https://pith.science/api/pith-number/QCKSXXZN6L4VNWUZQ563YVCIM5/graph.json","events_json":"https://pith.science/api/pith-number/QCKSXXZN6L4VNWUZQ563YVCIM5/events.json","paper":"https://pith.science/paper/QCKSXXZN"},"agent_actions":{"view_html":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5","download_json":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5.json","view_paper":"https://pith.science/paper/QCKSXXZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06315&json=true","fetch_graph":"https://pith.science/api/pith-number/QCKSXXZN6L4VNWUZQ563YVCIM5/graph.json","fetch_events":"https://pith.science/api/pith-number/QCKSXXZN6L4VNWUZQ563YVCIM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5/action/storage_attestation","attest_author":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5/action/author_attestation","sign_citation":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5/action/citation_signature","submit_replication":"https://pith.science/pith/QCKSXXZN6L4VNWUZQ563YVCIM5/action/replication_record"}},"created_at":"2026-05-18T00:15:36.076526+00:00","updated_at":"2026-05-18T00:15:36.076526+00:00"}