{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ANHGW2C5TT4GYTNIZUSH5WWBZJ","short_pith_number":"pith:ANHGW2C5","schema_version":"1.0","canonical_sha256":"034e6b685d9cf86c4da8cd247edac1ca41b1377c4fe0254c5a3773bd312ec97b","source":{"kind":"arxiv","id":"1104.5636","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Probabilistic Flooding for Multipath Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Christophe Betoule, Dario Rossi, Gilles Thouenon, Giuseppe Rossini, Remi Clavier, Thomas Bonald","submitted_at":"2011-04-29T14:27:13Z","abstract_excerpt":"In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding -- and, at the same t"},"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":"1104.5636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-29T14:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"06cb00b0626ca5c235c29479bf24c946e6463027abcecef686a7642911167c1b","abstract_canon_sha256":"7f6f96780c6e727a6235ad15b5ad4322cc1f2c2f2ea187015c8f2e8238c620b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:20.653147Z","signature_b64":"7y1f6D+VEn4BzZWYTXOHmpdBeP9tLlTv74uYDmbSpXcLD6nd3T8bH11qSmC64o7UP24n5A3yxYlQR0n6nXzYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"034e6b685d9cf86c4da8cd247edac1ca41b1377c4fe0254c5a3773bd312ec97b","last_reissued_at":"2026-05-18T04:23:20.652628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:20.652628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Probabilistic Flooding for Multipath Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Christophe Betoule, Dario Rossi, Gilles Thouenon, Giuseppe Rossini, Remi Clavier, Thomas Bonald","submitted_at":"2011-04-29T14:27:13Z","abstract_excerpt":"In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding -- and, at the same t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5636","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":"1104.5636","created_at":"2026-05-18T04:23:20.652713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5636v1","created_at":"2026-05-18T04:23:20.652713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5636","created_at":"2026-05-18T04:23:20.652713+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANHGW2C5TT4G","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANHGW2C5TT4GYTNI","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANHGW2C5","created_at":"2026-05-18T12:26:24.575870+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/ANHGW2C5TT4GYTNIZUSH5WWBZJ","json":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ.json","graph_json":"https://pith.science/api/pith-number/ANHGW2C5TT4GYTNIZUSH5WWBZJ/graph.json","events_json":"https://pith.science/api/pith-number/ANHGW2C5TT4GYTNIZUSH5WWBZJ/events.json","paper":"https://pith.science/paper/ANHGW2C5"},"agent_actions":{"view_html":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ","download_json":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ.json","view_paper":"https://pith.science/paper/ANHGW2C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5636&json=true","fetch_graph":"https://pith.science/api/pith-number/ANHGW2C5TT4GYTNIZUSH5WWBZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ANHGW2C5TT4GYTNIZUSH5WWBZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/action/storage_attestation","attest_author":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/action/author_attestation","sign_citation":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/action/citation_signature","submit_replication":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/action/replication_record"}},"created_at":"2026-05-18T04:23:20.652713+00:00","updated_at":"2026-05-18T04:23:20.652713+00:00"}