{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WEFAYDT5AT4B5MDVLYWOJJXO7S","short_pith_number":"pith:WEFAYDT5","schema_version":"1.0","canonical_sha256":"b10a0c0e7d04f81eb0755e2ce4a6eefcb24f0186406d869661e4be26d60066d8","source":{"kind":"arxiv","id":"1808.06893","version":1},"attestation_state":"computed","paper":{"title":"DeltaPath: dataflow-based high-performance incremental routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Desislava Dimitrova, John Liagouris, Moritz Hoffmann, Sebastian Wicki, Timothy Roscoe, Vasiliki Kalavri","submitted_at":"2018-08-21T13:39:48Z","abstract_excerpt":"Routing controllers must react quickly to failures, reconfigurations and workload or policy changes, to ensure service performance and cost-efficient network operation. We propose a general execution model which views routing as an incremental data-parallel computation on a graph-based network model plus a continuous stream of network changes. Our approach supports different routing objectives with only minor re-configuration of its core algorithm, and easily accomodates dynamic user-defined routing policies. Moreover, our prototype demonstrates excellent performance: on Google Jupiter topolog"},"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":"1808.06893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-08-21T13:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"57a05d871117bdda481a4437e627b6b17e679681f71de60981666393bc515b71","abstract_canon_sha256":"d2f32bbb1a0e9181bb479e30df5bfd70a47082e5ef75457cf3402f8303f1da1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:38.758519Z","signature_b64":"a6MRVx7fZDHJMaAigcITJMFoBaN83WqFgAhtOgwHXf2WKSBaBSfKnV5dc4MLbd9Ty0O91kel6WzgaF3IvkGODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b10a0c0e7d04f81eb0755e2ce4a6eefcb24f0186406d869661e4be26d60066d8","last_reissued_at":"2026-05-18T00:07:38.757852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:38.757852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeltaPath: dataflow-based high-performance incremental routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Desislava Dimitrova, John Liagouris, Moritz Hoffmann, Sebastian Wicki, Timothy Roscoe, Vasiliki Kalavri","submitted_at":"2018-08-21T13:39:48Z","abstract_excerpt":"Routing controllers must react quickly to failures, reconfigurations and workload or policy changes, to ensure service performance and cost-efficient network operation. We propose a general execution model which views routing as an incremental data-parallel computation on a graph-based network model plus a continuous stream of network changes. Our approach supports different routing objectives with only minor re-configuration of its core algorithm, and easily accomodates dynamic user-defined routing policies. Moreover, our prototype demonstrates excellent performance: on Google Jupiter topolog"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06893","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":"1808.06893","created_at":"2026-05-18T00:07:38.757933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06893v1","created_at":"2026-05-18T00:07:38.757933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06893","created_at":"2026-05-18T00:07:38.757933+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEFAYDT5AT4B","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEFAYDT5AT4B5MDV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEFAYDT5","created_at":"2026-05-18T12:32:59.047623+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/WEFAYDT5AT4B5MDVLYWOJJXO7S","json":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S.json","graph_json":"https://pith.science/api/pith-number/WEFAYDT5AT4B5MDVLYWOJJXO7S/graph.json","events_json":"https://pith.science/api/pith-number/WEFAYDT5AT4B5MDVLYWOJJXO7S/events.json","paper":"https://pith.science/paper/WEFAYDT5"},"agent_actions":{"view_html":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S","download_json":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S.json","view_paper":"https://pith.science/paper/WEFAYDT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06893&json=true","fetch_graph":"https://pith.science/api/pith-number/WEFAYDT5AT4B5MDVLYWOJJXO7S/graph.json","fetch_events":"https://pith.science/api/pith-number/WEFAYDT5AT4B5MDVLYWOJJXO7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/action/storage_attestation","attest_author":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/action/author_attestation","sign_citation":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/action/citation_signature","submit_replication":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/action/replication_record"}},"created_at":"2026-05-18T00:07:38.757933+00:00","updated_at":"2026-05-18T00:07:38.757933+00:00"}