{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QTUV3TD2AWS33R37HGIJKFJLQD","short_pith_number":"pith:QTUV3TD2","canonical_record":{"source":{"id":"1806.08744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-22T16:12:39Z","cross_cats_sorted":[],"title_canon_sha256":"db8483958737dfe3f270991bb3f09e24670db2c889e690dee489ebed3a730535","abstract_canon_sha256":"c6a8586ad9f39e34e297221e1293dd795c33d3a47041d68e60109ab9571e2286"},"schema_version":"1.0"},"canonical_sha256":"84e95dcc7a05a5bdc77f399095152b80e87558171b7bdfd1f5eaaf3d34ccb97c","source":{"kind":"arxiv","id":"1806.08744","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08744","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08744v1","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08744","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"QTUV3TD2AWS3","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QTUV3TD2AWS33R37","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QTUV3TD2","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QTUV3TD2AWS33R37HGIJKFJLQD","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-22T16:12:39Z","cross_cats_sorted":[],"title_canon_sha256":"db8483958737dfe3f270991bb3f09e24670db2c889e690dee489ebed3a730535","abstract_canon_sha256":"c6a8586ad9f39e34e297221e1293dd795c33d3a47041d68e60109ab9571e2286"},"schema_version":"1.0"},"canonical_sha256":"84e95dcc7a05a5bdc77f399095152b80e87558171b7bdfd1f5eaaf3d34ccb97c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:36.248712Z","signature_b64":"NwEi8rnW5TFvEomb9mkos4uSdXkPezYcCmHwZYyxIoUupYkA312ae3hE2KBrtECPu7G3bzLN7U0MhYnP+6NrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84e95dcc7a05a5bdc77f399095152b80e87558171b7bdfd1f5eaaf3d34ccb97c","last_reissued_at":"2026-05-18T00:12:36.248061Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:36.248061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08744","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:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0oSM1d7LGwObI7Pp3Pv+Y47FgM7JdGVVcCHAAwo0q2vHwWo0wh1JWrhXE6l6zyXbTyAIvbb0aRIT70fg3hJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:45:41.645305Z"},"content_sha256":"58ddb591d0cb2242da2670d05fbd9bc4d1340446ea6d2106dd3aa9d0d9a8a5f6","schema_version":"1.0","event_id":"sha256:58ddb591d0cb2242da2670d05fbd9bc4d1340446ea6d2106dd3aa9d0d9a8a5f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QTUV3TD2AWS33R37HGIJKFJLQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Control Plane Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aarti Gupta, David Walker, Ratul Mahajan, Ryan Beckett","submitted_at":"2018-06-22T16:12:39Z","abstract_excerpt":"We develop an algorithm capable of compressing large networks into a smaller ones with similar control plane behavior: For every stable routing solution in the large, original network, there exists a corresponding solution in the compressed network, and vice versa. Our compression algorithm preserves a wide variety of network properties including reachability, loop freedom, and path length. Consequently, operators may speed up network analysis, based on simulation, emulation, or verification, by analyzing only the compressed network. Our approach is based on a new theory of control plane equiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08744","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:12:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdKMZcTlyB/EtvYZh9fvzvEPjxtXQ4tho9FTMV8Jt9U+Nr+swtuGaRGZeetyOUMDbb+0gSf7JGD3zeJ7es5zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:45:41.646041Z"},"content_sha256":"5309a1bd5b15aae1d07c2e182145cc9595345cf3e240823cc07122ef6e11a2bf","schema_version":"1.0","event_id":"sha256:5309a1bd5b15aae1d07c2e182145cc9595345cf3e240823cc07122ef6e11a2bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTUV3TD2AWS33R37HGIJKFJLQD/bundle.json","state_url":"https://pith.science/pith/QTUV3TD2AWS33R37HGIJKFJLQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTUV3TD2AWS33R37HGIJKFJLQD/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-07T01:45:41Z","links":{"resolver":"https://pith.science/pith/QTUV3TD2AWS33R37HGIJKFJLQD","bundle":"https://pith.science/pith/QTUV3TD2AWS33R37HGIJKFJLQD/bundle.json","state":"https://pith.science/pith/QTUV3TD2AWS33R37HGIJKFJLQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTUV3TD2AWS33R37HGIJKFJLQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QTUV3TD2AWS33R37HGIJKFJLQD","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":"c6a8586ad9f39e34e297221e1293dd795c33d3a47041d68e60109ab9571e2286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-22T16:12:39Z","title_canon_sha256":"db8483958737dfe3f270991bb3f09e24670db2c889e690dee489ebed3a730535"},"schema_version":"1.0","source":{"id":"1806.08744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08744","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08744v1","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08744","created_at":"2026-05-18T00:12:36Z"},{"alias_kind":"pith_short_12","alias_value":"QTUV3TD2AWS3","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QTUV3TD2AWS33R37","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QTUV3TD2","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:5309a1bd5b15aae1d07c2e182145cc9595345cf3e240823cc07122ef6e11a2bf","target":"graph","created_at":"2026-05-18T00:12:36Z","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":"We develop an algorithm capable of compressing large networks into a smaller ones with similar control plane behavior: For every stable routing solution in the large, original network, there exists a corresponding solution in the compressed network, and vice versa. Our compression algorithm preserves a wide variety of network properties including reachability, loop freedom, and path length. Consequently, operators may speed up network analysis, based on simulation, emulation, or verification, by analyzing only the compressed network. Our approach is based on a new theory of control plane equiv","authors_text":"Aarti Gupta, David Walker, Ratul Mahajan, Ryan Beckett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-22T16:12:39Z","title":"Control Plane Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08744","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:58ddb591d0cb2242da2670d05fbd9bc4d1340446ea6d2106dd3aa9d0d9a8a5f6","target":"record","created_at":"2026-05-18T00:12:36Z","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":"c6a8586ad9f39e34e297221e1293dd795c33d3a47041d68e60109ab9571e2286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-06-22T16:12:39Z","title_canon_sha256":"db8483958737dfe3f270991bb3f09e24670db2c889e690dee489ebed3a730535"},"schema_version":"1.0","source":{"id":"1806.08744","kind":"arxiv","version":1}},"canonical_sha256":"84e95dcc7a05a5bdc77f399095152b80e87558171b7bdfd1f5eaaf3d34ccb97c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84e95dcc7a05a5bdc77f399095152b80e87558171b7bdfd1f5eaaf3d34ccb97c","first_computed_at":"2026-05-18T00:12:36.248061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:36.248061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NwEi8rnW5TFvEomb9mkos4uSdXkPezYcCmHwZYyxIoUupYkA312ae3hE2KBrtECPu7G3bzLN7U0MhYnP+6NrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:36.248712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58ddb591d0cb2242da2670d05fbd9bc4d1340446ea6d2106dd3aa9d0d9a8a5f6","sha256:5309a1bd5b15aae1d07c2e182145cc9595345cf3e240823cc07122ef6e11a2bf"],"state_sha256":"8efa4243b13731df22fdf39599e38bbe814f0b3efd5464f180db592fa34c0a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2NzLuUymRvAyUK+qu1+DYM4GMea2ZAvb12/3q7pA33YvRPnKTF4Z3shkNhCQ9OuX48pbNYBR1nY2nctcobzAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:45:41.649633Z","bundle_sha256":"b950f8ddd23378c1d6543ab007b5b1d5b363e73d36640a9576c0ec30466554f2"}}