{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RABYWKOKKZG4PAE6WKXCU4BAGC","short_pith_number":"pith:RABYWKOK","canonical_record":{"source":{"id":"1605.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T05:02:52Z","cross_cats_sorted":[],"title_canon_sha256":"d541b549a880fa28ceec90dde6357fee0bbfa5d0bdd3e095b3a76acd2943cd4f","abstract_canon_sha256":"f154aa60689e359c325ffa93fe8e61c384eaedf10f8f777b963636d8abd8c2f9"},"schema_version":"1.0"},"canonical_sha256":"88038b29ca564dc7809eb2ae2a7020308d4cbc365c22097c1f070f8b71624fa0","source":{"kind":"arxiv","id":"1605.07734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07734","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07734v1","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07734","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"RABYWKOKKZG4","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RABYWKOKKZG4PAE6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RABYWKOK","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RABYWKOKKZG4PAE6WKXCU4BAGC","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T05:02:52Z","cross_cats_sorted":[],"title_canon_sha256":"d541b549a880fa28ceec90dde6357fee0bbfa5d0bdd3e095b3a76acd2943cd4f","abstract_canon_sha256":"f154aa60689e359c325ffa93fe8e61c384eaedf10f8f777b963636d8abd8c2f9"},"schema_version":"1.0"},"canonical_sha256":"88038b29ca564dc7809eb2ae2a7020308d4cbc365c22097c1f070f8b71624fa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:39.263569Z","signature_b64":"IvunGht8h9lpP6fXf4IaZU5+SMuyyWCbBCb6aTLeXmSFrbpVUKCFVJIbgiFL1J+RgBZVvEv25IXjh4PA7V/9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88038b29ca564dc7809eb2ae2a7020308d4cbc365c22097c1f070f8b71624fa0","last_reissued_at":"2026-05-18T01:13:39.262923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:39.262923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07734","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:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azVC8E1r4HQ+4Wz1g2tvcOM94cy1Neik5Go2zzn/WBHxSytPASbk9MJYgdVEoD8wfX07K9uPz7ImpO6NpFZkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:04:52.422705Z"},"content_sha256":"eae312572c8a16ace8897d7c076a4307f637b7590177f1d2899430ccf91d56f1","schema_version":"1.0","event_id":"sha256:eae312572c8a16ace8897d7c076a4307f637b7590177f1d2899430ccf91d56f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RABYWKOKKZG4PAE6WKXCU4BAGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive SDN for Carrier Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Aurojit Panda, Barath Raghavan, James McCauley, Jennifer Rexford, Scott Shenker, Teemu Koponen, Zhi Liu","submitted_at":"2016-05-25T05:02:52Z","abstract_excerpt":"Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07734","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:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YyLL1miPoQv5gFuAVJa7Z0EZm0KYtQLGKSDqfYYI6Wv2dkv0fSY9NtChiDJr/QFU8fh7Pl/pmFyX9vGvakOyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:04:52.423361Z"},"content_sha256":"1242e372db8d44f8723df205075ba36110cdda252f435917016d5eb10c617af5","schema_version":"1.0","event_id":"sha256:1242e372db8d44f8723df205075ba36110cdda252f435917016d5eb10c617af5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RABYWKOKKZG4PAE6WKXCU4BAGC/bundle.json","state_url":"https://pith.science/pith/RABYWKOKKZG4PAE6WKXCU4BAGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RABYWKOKKZG4PAE6WKXCU4BAGC/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-30T12:04:52Z","links":{"resolver":"https://pith.science/pith/RABYWKOKKZG4PAE6WKXCU4BAGC","bundle":"https://pith.science/pith/RABYWKOKKZG4PAE6WKXCU4BAGC/bundle.json","state":"https://pith.science/pith/RABYWKOKKZG4PAE6WKXCU4BAGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RABYWKOKKZG4PAE6WKXCU4BAGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RABYWKOKKZG4PAE6WKXCU4BAGC","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":"f154aa60689e359c325ffa93fe8e61c384eaedf10f8f777b963636d8abd8c2f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T05:02:52Z","title_canon_sha256":"d541b549a880fa28ceec90dde6357fee0bbfa5d0bdd3e095b3a76acd2943cd4f"},"schema_version":"1.0","source":{"id":"1605.07734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07734","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07734v1","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07734","created_at":"2026-05-18T01:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"RABYWKOKKZG4","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RABYWKOKKZG4PAE6","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RABYWKOK","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:1242e372db8d44f8723df205075ba36110cdda252f435917016d5eb10c617af5","target":"graph","created_at":"2026-05-18T01:13:39Z","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":"Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design","authors_text":"Aurojit Panda, Barath Raghavan, James McCauley, Jennifer Rexford, Scott Shenker, Teemu Koponen, Zhi Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T05:02:52Z","title":"Recursive SDN for Carrier Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07734","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:eae312572c8a16ace8897d7c076a4307f637b7590177f1d2899430ccf91d56f1","target":"record","created_at":"2026-05-18T01:13:39Z","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":"f154aa60689e359c325ffa93fe8e61c384eaedf10f8f777b963636d8abd8c2f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-25T05:02:52Z","title_canon_sha256":"d541b549a880fa28ceec90dde6357fee0bbfa5d0bdd3e095b3a76acd2943cd4f"},"schema_version":"1.0","source":{"id":"1605.07734","kind":"arxiv","version":1}},"canonical_sha256":"88038b29ca564dc7809eb2ae2a7020308d4cbc365c22097c1f070f8b71624fa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88038b29ca564dc7809eb2ae2a7020308d4cbc365c22097c1f070f8b71624fa0","first_computed_at":"2026-05-18T01:13:39.262923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:39.262923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IvunGht8h9lpP6fXf4IaZU5+SMuyyWCbBCb6aTLeXmSFrbpVUKCFVJIbgiFL1J+RgBZVvEv25IXjh4PA7V/9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:39.263569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eae312572c8a16ace8897d7c076a4307f637b7590177f1d2899430ccf91d56f1","sha256:1242e372db8d44f8723df205075ba36110cdda252f435917016d5eb10c617af5"],"state_sha256":"e238898c0e6cf11a5a325948841e05f4687304ebb0f81eca0ce20cbf62a10922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjHXg2fUzFl303R6fsLoTKfctG/pZ4U5Sbx8RIiAOQpjkITV9lHYrkzDxrepjXheZYXo/dfES6NiIttmHRmlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:04:52.426559Z","bundle_sha256":"496150f9356b1c17854edbdd82094e3c513795e8ff68c4b198a3971c2fba3d0e"}}