{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RDTZQIY7QA6OFVH2AB4ER45Z3S","short_pith_number":"pith:RDTZQIY7","schema_version":"1.0","canonical_sha256":"88e798231f803ce2d4fa007848f3b9dca421f969f4557815948e3d85a8ad8bbb","source":{"kind":"arxiv","id":"1205.4564","version":1},"attestation_state":"computed","paper":{"title":"Computational Complexity of Traffic Hijacking under BGP and S-BGP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Giuseppe Di Battista, Marco Chiesa, Maurizio Patrignani, Thomas Erlebach","submitted_at":"2012-05-21T11:29:47Z","abstract_excerpt":"Harmful Internet hijacking incidents put in evidence how fragile the Border Gateway Protocol (BGP) is, which is used to exchange routing information between Autonomous Systems (ASes). As proved by recent research contributions, even S-BGP, the secure variant of BGP that is being deployed, is not fully able to blunt traffic attraction attacks. Given a traffic flow between two ASes, we study how difficult it is for a malicious AS to devise a strategy for hijacking or intercepting that flow. We show that this problem marks a sharp difference between BGP and S-BGP. Namely, while it is solvable, un"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1205.4564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-21T11:29:47Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d53ba76c09fe30af7115eef9a927d7b1874dcd57f54ef1b6b280ec703c591a91","abstract_canon_sha256":"298a91f1363cba8bab27b2a795719879064f78834a229883e2dc8e0b5a8319a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:12.908519Z","signature_b64":"HIGgDzmOTxYme4Ld3DM/HsnOJjL3x6HbA9B4XTl35HvOQxP/pq2DoSXnIAlSCytOSpLDdaIg6/c5M2NYkwq+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e798231f803ce2d4fa007848f3b9dca421f969f4557815948e3d85a8ad8bbb","last_reissued_at":"2026-05-18T03:55:12.907959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:12.907959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Complexity of Traffic Hijacking under BGP and S-BGP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.NI","authors_text":"Giuseppe Di Battista, Marco Chiesa, Maurizio Patrignani, Thomas Erlebach","submitted_at":"2012-05-21T11:29:47Z","abstract_excerpt":"Harmful Internet hijacking incidents put in evidence how fragile the Border Gateway Protocol (BGP) is, which is used to exchange routing information between Autonomous Systems (ASes). As proved by recent research contributions, even S-BGP, the secure variant of BGP that is being deployed, is not fully able to blunt traffic attraction attacks. Given a traffic flow between two ASes, we study how difficult it is for a malicious AS to devise a strategy for hijacking or intercepting that flow. We show that this problem marks a sharp difference between BGP and S-BGP. Namely, while it is solvable, un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4564","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.4564","created_at":"2026-05-18T03:55:12.908024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4564v1","created_at":"2026-05-18T03:55:12.908024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4564","created_at":"2026-05-18T03:55:12.908024+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDTZQIY7QA6O","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDTZQIY7QA6OFVH2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDTZQIY7","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S","json":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S.json","graph_json":"https://pith.science/api/pith-number/RDTZQIY7QA6OFVH2AB4ER45Z3S/graph.json","events_json":"https://pith.science/api/pith-number/RDTZQIY7QA6OFVH2AB4ER45Z3S/events.json","paper":"https://pith.science/paper/RDTZQIY7"},"agent_actions":{"view_html":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S","download_json":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S.json","view_paper":"https://pith.science/paper/RDTZQIY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4564&json=true","fetch_graph":"https://pith.science/api/pith-number/RDTZQIY7QA6OFVH2AB4ER45Z3S/graph.json","fetch_events":"https://pith.science/api/pith-number/RDTZQIY7QA6OFVH2AB4ER45Z3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S/action/storage_attestation","attest_author":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S/action/author_attestation","sign_citation":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S/action/citation_signature","submit_replication":"https://pith.science/pith/RDTZQIY7QA6OFVH2AB4ER45Z3S/action/replication_record"}},"created_at":"2026-05-18T03:55:12.908024+00:00","updated_at":"2026-05-18T03:55:12.908024+00:00"}