{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3RYPAMTI2KTRPOJYHKPH5OY32A","short_pith_number":"pith:3RYPAMTI","schema_version":"1.0","canonical_sha256":"dc70f03268d2a717b9383a9e7ebb1bd005cd39bd9083b80375b43be264491301","source":{"kind":"arxiv","id":"1605.00618","version":1},"attestation_state":"computed","paper":{"title":"CAIR: Using Formal Languages to Study Routing, Leaking, and Interception in BGP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.FL"],"primary_cat":"cs.NI","authors_text":"Ernst W. Biersack, Georg Carle, Johann Schlamp, Matthias W\\\"ahlisch, Thomas C. Schmidt","submitted_at":"2016-05-02T19:00:20Z","abstract_excerpt":"The Internet routing protocol BGP expresses topological reachability and policy-based decisions simultaneously in path vectors. A complete view on the Internet backbone routing is given by the collection of all valid routes, which is infeasible to obtain due to information hiding of BGP, the lack of omnipresent collection points, and data complexity. Commonly, graph-based data models are used to represent the Internet topology from a given set of BGP routing tables but fall short of explaining policy contexts. As a consequence, routing anomalies such as route leaks and interception attacks can"},"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":"1605.00618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-05-02T19:00:20Z","cross_cats_sorted":["cs.CR","cs.FL"],"title_canon_sha256":"a13608c99bf13324ec24df4c132df688873d42ab9f50a4c71f6349ff06cbb28d","abstract_canon_sha256":"05153810c3fbfb5023d8735ad5211c18950b982b93c9e3fa875ad38fb849fc80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:45.319632Z","signature_b64":"vDJU55SMx7Njfbb/reErQTWT07xUBE4GJ35Ar7q2EDwLJgFqDMbaaBm6UcErMvEXM9Tyh9+LoxvXlQQ3y4nBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc70f03268d2a717b9383a9e7ebb1bd005cd39bd9083b80375b43be264491301","last_reissued_at":"2026-05-18T01:09:45.319021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:45.319021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CAIR: Using Formal Languages to Study Routing, Leaking, and Interception in BGP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.FL"],"primary_cat":"cs.NI","authors_text":"Ernst W. Biersack, Georg Carle, Johann Schlamp, Matthias W\\\"ahlisch, Thomas C. Schmidt","submitted_at":"2016-05-02T19:00:20Z","abstract_excerpt":"The Internet routing protocol BGP expresses topological reachability and policy-based decisions simultaneously in path vectors. A complete view on the Internet backbone routing is given by the collection of all valid routes, which is infeasible to obtain due to information hiding of BGP, the lack of omnipresent collection points, and data complexity. Commonly, graph-based data models are used to represent the Internet topology from a given set of BGP routing tables but fall short of explaining policy contexts. As a consequence, routing anomalies such as route leaks and interception attacks can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00618","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":"1605.00618","created_at":"2026-05-18T01:09:45.319128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00618v1","created_at":"2026-05-18T01:09:45.319128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00618","created_at":"2026-05-18T01:09:45.319128+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RYPAMTI2KTR","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RYPAMTI2KTRPOJY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RYPAMTI","created_at":"2026-05-18T12:29:55.572404+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/3RYPAMTI2KTRPOJYHKPH5OY32A","json":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A.json","graph_json":"https://pith.science/api/pith-number/3RYPAMTI2KTRPOJYHKPH5OY32A/graph.json","events_json":"https://pith.science/api/pith-number/3RYPAMTI2KTRPOJYHKPH5OY32A/events.json","paper":"https://pith.science/paper/3RYPAMTI"},"agent_actions":{"view_html":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A","download_json":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A.json","view_paper":"https://pith.science/paper/3RYPAMTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00618&json=true","fetch_graph":"https://pith.science/api/pith-number/3RYPAMTI2KTRPOJYHKPH5OY32A/graph.json","fetch_events":"https://pith.science/api/pith-number/3RYPAMTI2KTRPOJYHKPH5OY32A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A/action/storage_attestation","attest_author":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A/action/author_attestation","sign_citation":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A/action/citation_signature","submit_replication":"https://pith.science/pith/3RYPAMTI2KTRPOJYHKPH5OY32A/action/replication_record"}},"created_at":"2026-05-18T01:09:45.319128+00:00","updated_at":"2026-05-18T01:09:45.319128+00:00"}