{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TVGDSQM2C4LTJXA4ITXUL4LORN","short_pith_number":"pith:TVGDSQM2","canonical_record":{"source":{"id":"1603.01708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-05T10:26:01Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a53e171640e748e0327ede5decf8e20abd8360efaeec3e55eeaed371cc666b79","abstract_canon_sha256":"df01f21ccc6e6ba2cbe8ce02189e1483a806a5f24acbdb69fbb74246b646a2aa"},"schema_version":"1.0"},"canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","source":{"kind":"arxiv","id":"1603.01708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01708","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01708v2","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01708","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"TVGDSQM2C4LT","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TVGDSQM2C4LTJXA4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TVGDSQM2","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TVGDSQM2C4LTJXA4ITXUL4LORN","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-05T10:26:01Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a53e171640e748e0327ede5decf8e20abd8360efaeec3e55eeaed371cc666b79","abstract_canon_sha256":"df01f21ccc6e6ba2cbe8ce02189e1483a806a5f24acbdb69fbb74246b646a2aa"},"schema_version":"1.0"},"canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:13.996630Z","signature_b64":"+cB7SuzHdQOszgI+sd6ilolobDqqTVWPvGqekwsFIins2GJy7nKSEGrUlCfnVTAy9qM7zb7jepoh0H6Qts/ECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","last_reissued_at":"2026-05-18T00:31:13.996007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:13.996007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01708","source_version":2,"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:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aMJQCLMJp4knhIXYxzu3gx9WfFNFEEC3ZBjRZSZPJW9IIp369rIkOFjebk90NC/j5ROP+Vx4xOfHaujC+65Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:43.038919Z"},"content_sha256":"42fe878a57384828cb3d8a634f87461debf26fc74bd001a74aa24adbdc8c0343","schema_version":"1.0","event_id":"sha256:42fe878a57384828cb3d8a634f87461debf26fc74bd001a74aa24adbdc8c0343"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TVGDSQM2C4LTJXA4ITXUL4LORN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Technique Report: Near-Optimal Routing Protection for SDN Networks Using Distributed Markov Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Baoliu Ye, Huawei Huang, Keqiu Li, Song Guo, Weifa Liang","submitted_at":"2016-03-05T10:26:01Z","abstract_excerpt":"Software Defined Networking (SDN) brings numbers of advantages along with many challenges. One particular concern is on the control-plane resilience, while the existing protection approaches proposed for SDN networks mainly focus on data-plane. In order to achieve the carrier-grade recovery from link failures, we adopt the dedicated protection scheme towards finding optimal protection routing for control-plane traffic. To this end, we study a weighted cost minimization problem, in which the traffic load balancing and flow table rule placement are jointly considered when selecting protection pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01708","kind":"arxiv","version":2},"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:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFoUuh/HVpNg/ad9/Lf6qmrxZCJ6bm85iZ4SFtuQV0wp46E7/utjFg7TI8QZ4nHrVrUvMPf0SXJ2shss1E+8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:43.039271Z"},"content_sha256":"14ae4ff64277d9fea6bf47393da6991f400b9d0d5dad9e9b4084989a6e1fb4a8","schema_version":"1.0","event_id":"sha256:14ae4ff64277d9fea6bf47393da6991f400b9d0d5dad9e9b4084989a6e1fb4a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/bundle.json","state_url":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/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-28T07:53:43Z","links":{"resolver":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN","bundle":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/bundle.json","state":"https://pith.science/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVGDSQM2C4LTJXA4ITXUL4LORN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TVGDSQM2C4LTJXA4ITXUL4LORN","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":"df01f21ccc6e6ba2cbe8ce02189e1483a806a5f24acbdb69fbb74246b646a2aa","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-05T10:26:01Z","title_canon_sha256":"a53e171640e748e0327ede5decf8e20abd8360efaeec3e55eeaed371cc666b79"},"schema_version":"1.0","source":{"id":"1603.01708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01708","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01708v2","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01708","created_at":"2026-05-18T00:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"TVGDSQM2C4LT","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TVGDSQM2C4LTJXA4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TVGDSQM2","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:14ae4ff64277d9fea6bf47393da6991f400b9d0d5dad9e9b4084989a6e1fb4a8","target":"graph","created_at":"2026-05-18T00:31:13Z","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":"Software Defined Networking (SDN) brings numbers of advantages along with many challenges. One particular concern is on the control-plane resilience, while the existing protection approaches proposed for SDN networks mainly focus on data-plane. In order to achieve the carrier-grade recovery from link failures, we adopt the dedicated protection scheme towards finding optimal protection routing for control-plane traffic. To this end, we study a weighted cost minimization problem, in which the traffic load balancing and flow table rule placement are jointly considered when selecting protection pa","authors_text":"Baoliu Ye, Huawei Huang, Keqiu Li, Song Guo, Weifa Liang","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-05T10:26:01Z","title":"Technique Report: Near-Optimal Routing Protection for SDN Networks Using Distributed Markov Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01708","kind":"arxiv","version":2},"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:42fe878a57384828cb3d8a634f87461debf26fc74bd001a74aa24adbdc8c0343","target":"record","created_at":"2026-05-18T00:31:13Z","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":"df01f21ccc6e6ba2cbe8ce02189e1483a806a5f24acbdb69fbb74246b646a2aa","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-05T10:26:01Z","title_canon_sha256":"a53e171640e748e0327ede5decf8e20abd8360efaeec3e55eeaed371cc666b79"},"schema_version":"1.0","source":{"id":"1603.01708","kind":"arxiv","version":2}},"canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d4c39419a171734dc1c44ef45f16e8b5b67609fe0b32dfbe12356bf2d9b581b","first_computed_at":"2026-05-18T00:31:13.996007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:13.996007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+cB7SuzHdQOszgI+sd6ilolobDqqTVWPvGqekwsFIins2GJy7nKSEGrUlCfnVTAy9qM7zb7jepoh0H6Qts/ECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:13.996630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42fe878a57384828cb3d8a634f87461debf26fc74bd001a74aa24adbdc8c0343","sha256:14ae4ff64277d9fea6bf47393da6991f400b9d0d5dad9e9b4084989a6e1fb4a8"],"state_sha256":"1721a7a52168243b072a3bbfd226a7c33a35019aa610ac27858bc77839fd89e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKVxidJxa0uakDTbvYo1vDqXOyNgfuoi49qdr09qcHRCPkcfDLtDGDL6FOOa5V0iC2lTiMpF4WwK3LtyFowUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:53:43.041266Z","bundle_sha256":"1a4999abd043d528a28119b493f6642ca6069461d333d200139af7aff3f2bfbf"}}