{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R7KYWVJ5ULP5OLROONWIJX4MAR","short_pith_number":"pith:R7KYWVJ5","canonical_record":{"source":{"id":"1607.00991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-04T18:56:08Z","cross_cats_sorted":[],"title_canon_sha256":"99b1afe815347d4f8584e822d3c0c322cc954768b9441d3533bff35a34ad67a4","abstract_canon_sha256":"66d145de63f54b0570b85f8b17f430216e7a77f5dac0de316be9f00ed8012796"},"schema_version":"1.0"},"canonical_sha256":"8fd58b553da2dfd72e2e736c84df8c044f141774c443a27c325d5c585a214da1","source":{"kind":"arxiv","id":"1607.00991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00991","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00991v1","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00991","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"R7KYWVJ5ULP5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7KYWVJ5ULP5OLRO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7KYWVJ5","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R7KYWVJ5ULP5OLROONWIJX4MAR","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-04T18:56:08Z","cross_cats_sorted":[],"title_canon_sha256":"99b1afe815347d4f8584e822d3c0c322cc954768b9441d3533bff35a34ad67a4","abstract_canon_sha256":"66d145de63f54b0570b85f8b17f430216e7a77f5dac0de316be9f00ed8012796"},"schema_version":"1.0"},"canonical_sha256":"8fd58b553da2dfd72e2e736c84df8c044f141774c443a27c325d5c585a214da1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:33.959587Z","signature_b64":"2HEvl0xziu9PXZo3nF3FzS7vCLHh69iBUgaHzEntOK5Wv0/ZyyCwGqxttzty0qOmgvovmitBpQ53FUMUDlsOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fd58b553da2dfd72e2e736c84df8c044f141774c443a27c325d5c585a214da1","last_reissued_at":"2026-05-18T01:11:33.959161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:33.959161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00991","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-18T01:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxcE2JuemD/w/DzZS8NuezTGLqDNhZpyd0vTbbVMbfapu449oub0Fbt+7UNLZDD9GIo6+s/JYV9IwUZVykl3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:15:30.201858Z"},"content_sha256":"7af2e452dec2d5342277df317d1a4cc7bb16151227a1546ddc66fcf7cce421ea","schema_version":"1.0","event_id":"sha256:7af2e452dec2d5342277df317d1a4cc7bb16151227a1546ddc66fcf7cce421ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R7KYWVJ5ULP5OLROONWIJX4MAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Reachability in Networks with Mutable Datapaths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aurojit Panda, Katerina Argyraki, Mooly Sagiv, Ori Lahav, Scott Shenker","submitted_at":"2016-07-04T18:56:08Z","abstract_excerpt":"Recent work has made great progress in verifying the forwarding correctness of networks . However, these approaches cannot be used to verify networks containing middleboxes, such as caches and firewalls, whose forwarding behavior depends on previously observed traffic. We explore how to verify reachability properties for networks that include such \"mutable datapath\" elements. We want our verification results to hold not just for the given network, but also in the presence of failures. The main challenge lies in scaling the approach to handle large and complicated networks, We address by develo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00991","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-18T01:11:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DC638+mvcEPFWYUbrKqK9QIbZMRv3Yy34mpJFu/2LoCYrWnIRW27gB2iE2TNQVsgcoZgV3aUO7pi1l748TarCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:15:30.202530Z"},"content_sha256":"d90f50f84ae2b2d9a09455653021e6a5065cfff00213a01880037f32fab340f4","schema_version":"1.0","event_id":"sha256:d90f50f84ae2b2d9a09455653021e6a5065cfff00213a01880037f32fab340f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7KYWVJ5ULP5OLROONWIJX4MAR/bundle.json","state_url":"https://pith.science/pith/R7KYWVJ5ULP5OLROONWIJX4MAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7KYWVJ5ULP5OLROONWIJX4MAR/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-25T04:15:30Z","links":{"resolver":"https://pith.science/pith/R7KYWVJ5ULP5OLROONWIJX4MAR","bundle":"https://pith.science/pith/R7KYWVJ5ULP5OLROONWIJX4MAR/bundle.json","state":"https://pith.science/pith/R7KYWVJ5ULP5OLROONWIJX4MAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7KYWVJ5ULP5OLROONWIJX4MAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R7KYWVJ5ULP5OLROONWIJX4MAR","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":"66d145de63f54b0570b85f8b17f430216e7a77f5dac0de316be9f00ed8012796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-04T18:56:08Z","title_canon_sha256":"99b1afe815347d4f8584e822d3c0c322cc954768b9441d3533bff35a34ad67a4"},"schema_version":"1.0","source":{"id":"1607.00991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00991","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00991v1","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00991","created_at":"2026-05-18T01:11:33Z"},{"alias_kind":"pith_short_12","alias_value":"R7KYWVJ5ULP5","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7KYWVJ5ULP5OLRO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7KYWVJ5","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:d90f50f84ae2b2d9a09455653021e6a5065cfff00213a01880037f32fab340f4","target":"graph","created_at":"2026-05-18T01:11:33Z","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":"Recent work has made great progress in verifying the forwarding correctness of networks . However, these approaches cannot be used to verify networks containing middleboxes, such as caches and firewalls, whose forwarding behavior depends on previously observed traffic. We explore how to verify reachability properties for networks that include such \"mutable datapath\" elements. We want our verification results to hold not just for the given network, but also in the presence of failures. The main challenge lies in scaling the approach to handle large and complicated networks, We address by develo","authors_text":"Aurojit Panda, Katerina Argyraki, Mooly Sagiv, Ori Lahav, Scott Shenker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-04T18:56:08Z","title":"Verifying Reachability in Networks with Mutable Datapaths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00991","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:7af2e452dec2d5342277df317d1a4cc7bb16151227a1546ddc66fcf7cce421ea","target":"record","created_at":"2026-05-18T01:11:33Z","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":"66d145de63f54b0570b85f8b17f430216e7a77f5dac0de316be9f00ed8012796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-07-04T18:56:08Z","title_canon_sha256":"99b1afe815347d4f8584e822d3c0c322cc954768b9441d3533bff35a34ad67a4"},"schema_version":"1.0","source":{"id":"1607.00991","kind":"arxiv","version":1}},"canonical_sha256":"8fd58b553da2dfd72e2e736c84df8c044f141774c443a27c325d5c585a214da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fd58b553da2dfd72e2e736c84df8c044f141774c443a27c325d5c585a214da1","first_computed_at":"2026-05-18T01:11:33.959161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:33.959161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2HEvl0xziu9PXZo3nF3FzS7vCLHh69iBUgaHzEntOK5Wv0/ZyyCwGqxttzty0qOmgvovmitBpQ53FUMUDlsOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:33.959587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7af2e452dec2d5342277df317d1a4cc7bb16151227a1546ddc66fcf7cce421ea","sha256:d90f50f84ae2b2d9a09455653021e6a5065cfff00213a01880037f32fab340f4"],"state_sha256":"d9f2ddba606f2a802f2a0bcaf25c4c15bd4bbb156442d98e5ecd3b0ac8abaa49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XiupBMYJSQFnY+/LsGurfaIHIkac6TSvDubt8/HbUeIMw9cPkac1ZD+L7uKZsKhO0lNP5eKO8hI6weZXtpQyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:15:30.206088Z","bundle_sha256":"f75864ab5020066d29c2cdd2d5123c64f228fb2e00da9bbd00f377e2aceaae36"}}