{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WEFAYDT5AT4B5MDVLYWOJJXO7S","short_pith_number":"pith:WEFAYDT5","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"},"canonical_sha256":"b10a0c0e7d04f81eb0755e2ce4a6eefcb24f0186406d869661e4be26d60066d8","source":{"kind":"arxiv","id":"1808.06893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06893","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06893v1","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06893","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"WEFAYDT5AT4B","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEFAYDT5AT4B5MDV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEFAYDT5","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WEFAYDT5AT4B5MDVLYWOJJXO7S","target":"record","payload":{"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"},"canonical_sha256":"b10a0c0e7d04f81eb0755e2ce4a6eefcb24f0186406d869661e4be26d60066d8","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"},"source_kind":"arxiv","source_id":"1808.06893","source_version":1,"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:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BO4zFUDBZ2QQTd8ifSVjObBYeMopuBr9611bvytTiAC9rhS3nZLYmcU2N2Q3TCt+9fdef7A0OClf6zdga8UuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:08:27.531860Z"},"content_sha256":"4139da4b4f2757a22f2167b503558d5e65f0a86c66f7927ac66465acd732a26e","schema_version":"1.0","event_id":"sha256:4139da4b4f2757a22f2167b503558d5e65f0a86c66f7927ac66465acd732a26e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WEFAYDT5AT4B5MDVLYWOJJXO7S","target":"graph","payload":{"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"},"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:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPiWO+LMVCdvzwo8t4tbsDsQDl0ARubQkrcPW9YsH7mUFaNjeWby51imhivZCe0zvgM6SpWGGuRqkuc+XiyNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:08:27.532204Z"},"content_sha256":"f5808f7ccc2aeab56047d46767b880d4f7a26a7830dd2a71f34999ffc28748ea","schema_version":"1.0","event_id":"sha256:f5808f7ccc2aeab56047d46767b880d4f7a26a7830dd2a71f34999ffc28748ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/bundle.json","state_url":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/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-04T11:08:27Z","links":{"resolver":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S","bundle":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/bundle.json","state":"https://pith.science/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEFAYDT5AT4B5MDVLYWOJJXO7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WEFAYDT5AT4B5MDVLYWOJJXO7S","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":"d2f32bbb1a0e9181bb479e30df5bfd70a47082e5ef75457cf3402f8303f1da1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-08-21T13:39:48Z","title_canon_sha256":"57a05d871117bdda481a4437e627b6b17e679681f71de60981666393bc515b71"},"schema_version":"1.0","source":{"id":"1808.06893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06893","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06893v1","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06893","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"WEFAYDT5AT4B","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEFAYDT5AT4B5MDV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEFAYDT5","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:f5808f7ccc2aeab56047d46767b880d4f7a26a7830dd2a71f34999ffc28748ea","target":"graph","created_at":"2026-05-18T00:07:38Z","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":"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","authors_text":"Desislava Dimitrova, John Liagouris, Moritz Hoffmann, Sebastian Wicki, Timothy Roscoe, Vasiliki Kalavri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-08-21T13:39:48Z","title":"DeltaPath: dataflow-based high-performance incremental routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06893","kind":"arxiv","version":1},"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:4139da4b4f2757a22f2167b503558d5e65f0a86c66f7927ac66465acd732a26e","target":"record","created_at":"2026-05-18T00:07:38Z","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":"d2f32bbb1a0e9181bb479e30df5bfd70a47082e5ef75457cf3402f8303f1da1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-08-21T13:39:48Z","title_canon_sha256":"57a05d871117bdda481a4437e627b6b17e679681f71de60981666393bc515b71"},"schema_version":"1.0","source":{"id":"1808.06893","kind":"arxiv","version":1}},"canonical_sha256":"b10a0c0e7d04f81eb0755e2ce4a6eefcb24f0186406d869661e4be26d60066d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b10a0c0e7d04f81eb0755e2ce4a6eefcb24f0186406d869661e4be26d60066d8","first_computed_at":"2026-05-18T00:07:38.757852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:38.757852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6MRVx7fZDHJMaAigcITJMFoBaN83WqFgAhtOgwHXf2WKSBaBSfKnV5dc4MLbd9Ty0O91kel6WzgaF3IvkGODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:38.758519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4139da4b4f2757a22f2167b503558d5e65f0a86c66f7927ac66465acd732a26e","sha256:f5808f7ccc2aeab56047d46767b880d4f7a26a7830dd2a71f34999ffc28748ea"],"state_sha256":"fa715ad8914a14daa381a20d68ec25aa6a98a81d9589460566441fba993dc9f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vB3Kc+prGYwv2WAOLCbbCReH2igDjKMdUPHND72WXnJZGkHY3iarGENm+nK8P9/9FwMTkL/Ft+vhBn0O/1nqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:08:27.534296Z","bundle_sha256":"93fe9b698bffd21eae75eae1096d26dc41e28c9978ec7dfe5dd0ba965751668e"}}