{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NWA2E4LSBORJQMYEWIXIEMR7HA","short_pith_number":"pith:NWA2E4LS","canonical_record":{"source":{"id":"1107.2299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-12T14:31:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ed415de7854fe9e55ae1359077f35b9767291bb09df11a1773da676c8a6a7d0b","abstract_canon_sha256":"e6a9c0958f134536a55dee7161298dd17d392499ec51b26fe95ead91e0571a39"},"schema_version":"1.0"},"canonical_sha256":"6d81a271720ba2983304b22e82323f3817baf8f48a032c75fa216935c2d45eb2","source":{"kind":"arxiv","id":"1107.2299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2299","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2299v1","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2299","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"NWA2E4LSBORJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NWA2E4LSBORJQMYE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NWA2E4LS","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NWA2E4LSBORJQMYEWIXIEMR7HA","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-12T14:31:07Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ed415de7854fe9e55ae1359077f35b9767291bb09df11a1773da676c8a6a7d0b","abstract_canon_sha256":"e6a9c0958f134536a55dee7161298dd17d392499ec51b26fe95ead91e0571a39"},"schema_version":"1.0"},"canonical_sha256":"6d81a271720ba2983304b22e82323f3817baf8f48a032c75fa216935c2d45eb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:24.836962Z","signature_b64":"/JFBDgb3NEzFL8fvAq3BzVUNFuEEVbB7yKJwgUp0jA0yShKhuW/5LGgBPIzHj1+yW7HaZsmkgw9LnJsUPaFSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d81a271720ba2983304b22e82323f3817baf8f48a032c75fa216935c2d45eb2","last_reissued_at":"2026-05-18T04:18:24.836233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:24.836233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2299","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-18T04:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X91K9p4Nrl9+HrwjxgTmnBDjAqGJcRCscW7LW4BQu8Tev/1yv2niEUe85GiaMo+Ep3j4P08C0aVRhAV0lIl1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:06:36.451466Z"},"content_sha256":"2261c5ef4b131085534bb927e7553941755060c1bf2d3f220a8a13748a95cad2","schema_version":"1.0","event_id":"sha256:2261c5ef4b131085534bb927e7553941755060c1bf2d3f220a8a13748a95cad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NWA2E4LSBORJQMYEWIXIEMR7HA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"iBGP and Constrained Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Gordon Wilfong, Michael Dinitz","submitted_at":"2011-07-12T14:31:07Z","abstract_excerpt":"We initiate the theoretical study of the problem of minimizing the size of an iBGP overlay in an Autonomous System (AS) in the Internet subject to a natural notion of correctness derived from the standard \"hot-potato\" routing rules. For both natural versions of the problem (where we measure the size of an overlay by either the number of edges or the maximum degree) we prove that it is NP-hard to approximate to a factor better than $\\Omega(\\log n)$ and provide approximation algorithms with ratio $\\tilde{O}(\\sqrt{n})$. In addition, we give a slightly worse $\\tilde{O}(n^{2/3})$-approximation base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2299","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-18T04:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJN756XAJGkAuLZOfgi9tdgWiifFpsCh66qEKUVc7HeHymszb5/LUvyc8lgXsgZEqh2nCxcNmlioNe7XAy3pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:06:36.452156Z"},"content_sha256":"daab652d99daf0349b87701129f20426875d8b1866ad5b3502e585ebd4e51e03","schema_version":"1.0","event_id":"sha256:daab652d99daf0349b87701129f20426875d8b1866ad5b3502e585ebd4e51e03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWA2E4LSBORJQMYEWIXIEMR7HA/bundle.json","state_url":"https://pith.science/pith/NWA2E4LSBORJQMYEWIXIEMR7HA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWA2E4LSBORJQMYEWIXIEMR7HA/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-09T04:06:36Z","links":{"resolver":"https://pith.science/pith/NWA2E4LSBORJQMYEWIXIEMR7HA","bundle":"https://pith.science/pith/NWA2E4LSBORJQMYEWIXIEMR7HA/bundle.json","state":"https://pith.science/pith/NWA2E4LSBORJQMYEWIXIEMR7HA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWA2E4LSBORJQMYEWIXIEMR7HA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NWA2E4LSBORJQMYEWIXIEMR7HA","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":"e6a9c0958f134536a55dee7161298dd17d392499ec51b26fe95ead91e0571a39","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-12T14:31:07Z","title_canon_sha256":"ed415de7854fe9e55ae1359077f35b9767291bb09df11a1773da676c8a6a7d0b"},"schema_version":"1.0","source":{"id":"1107.2299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2299","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2299v1","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2299","created_at":"2026-05-18T04:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"NWA2E4LSBORJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NWA2E4LSBORJQMYE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NWA2E4LS","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:daab652d99daf0349b87701129f20426875d8b1866ad5b3502e585ebd4e51e03","target":"graph","created_at":"2026-05-18T04:18:24Z","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 initiate the theoretical study of the problem of minimizing the size of an iBGP overlay in an Autonomous System (AS) in the Internet subject to a natural notion of correctness derived from the standard \"hot-potato\" routing rules. For both natural versions of the problem (where we measure the size of an overlay by either the number of edges or the maximum degree) we prove that it is NP-hard to approximate to a factor better than $\\Omega(\\log n)$ and provide approximation algorithms with ratio $\\tilde{O}(\\sqrt{n})$. In addition, we give a slightly worse $\\tilde{O}(n^{2/3})$-approximation base","authors_text":"Gordon Wilfong, Michael Dinitz","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-12T14:31:07Z","title":"iBGP and Constrained Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2299","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:2261c5ef4b131085534bb927e7553941755060c1bf2d3f220a8a13748a95cad2","target":"record","created_at":"2026-05-18T04:18:24Z","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":"e6a9c0958f134536a55dee7161298dd17d392499ec51b26fe95ead91e0571a39","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-12T14:31:07Z","title_canon_sha256":"ed415de7854fe9e55ae1359077f35b9767291bb09df11a1773da676c8a6a7d0b"},"schema_version":"1.0","source":{"id":"1107.2299","kind":"arxiv","version":1}},"canonical_sha256":"6d81a271720ba2983304b22e82323f3817baf8f48a032c75fa216935c2d45eb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d81a271720ba2983304b22e82323f3817baf8f48a032c75fa216935c2d45eb2","first_computed_at":"2026-05-18T04:18:24.836233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:24.836233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/JFBDgb3NEzFL8fvAq3BzVUNFuEEVbB7yKJwgUp0jA0yShKhuW/5LGgBPIzHj1+yW7HaZsmkgw9LnJsUPaFSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:24.836962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2261c5ef4b131085534bb927e7553941755060c1bf2d3f220a8a13748a95cad2","sha256:daab652d99daf0349b87701129f20426875d8b1866ad5b3502e585ebd4e51e03"],"state_sha256":"35ad95e1b3a7abcbc61e7218a71e25660e55f15c5e6aad5378fa1fcd49522363"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1caB9OBhU5xToIy2F5XABc9kgjHtt2KfCqS75dqZfLun/OwT8kruBJKlPkLD6MFtpf7pLRUnWTsV5lAgIuZcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:06:36.456285Z","bundle_sha256":"e5fe26e3f2c7f996faa9d1227869dc6ee6afe88ca0492efbba8c3f51eb0b72bb"}}