{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ANHGW2C5TT4GYTNIZUSH5WWBZJ","short_pith_number":"pith:ANHGW2C5","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"},"canonical_sha256":"034e6b685d9cf86c4da8cd247edac1ca41b1377c4fe0254c5a3773bd312ec97b","source":{"kind":"arxiv","id":"1104.5636","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5636","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5636v1","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5636","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"ANHGW2C5TT4G","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ANHGW2C5TT4GYTNI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ANHGW2C5","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ANHGW2C5TT4GYTNIZUSH5WWBZJ","target":"record","payload":{"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"},"canonical_sha256":"034e6b685d9cf86c4da8cd247edac1ca41b1377c4fe0254c5a3773bd312ec97b","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"},"source_kind":"arxiv","source_id":"1104.5636","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:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gc7h5fQRnySuyjL93L/8pbfzrMCRdAKHTXYe3KJoG0YQPiogW+ruVrxWk2i0z7TDTuzNAdzwYygtfnbsn81DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:02:48.109275Z"},"content_sha256":"d17ec0cb357ab0b59c468d5e9a738eeb30129292da278899a2537a93062ccb60","schema_version":"1.0","event_id":"sha256:d17ec0cb357ab0b59c468d5e9a738eeb30129292da278899a2537a93062ccb60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ANHGW2C5TT4GYTNIZUSH5WWBZJ","target":"graph","payload":{"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"},"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:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRlQzsq28ua0bedKxNXMOA2CZKMaETpWb9qa1X4TA/MD7/MQyYGSQs/dh31DMKVId9nFI4YiDcbgyV2VkpH7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:02:48.109632Z"},"content_sha256":"c040e6163bd6e590ddc51fbcda1b831cc9d2a08bcfdae9289694f752a5df8df4","schema_version":"1.0","event_id":"sha256:c040e6163bd6e590ddc51fbcda1b831cc9d2a08bcfdae9289694f752a5df8df4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/bundle.json","state_url":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/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-08T12:02:48Z","links":{"resolver":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ","bundle":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/bundle.json","state":"https://pith.science/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANHGW2C5TT4GYTNIZUSH5WWBZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ANHGW2C5TT4GYTNIZUSH5WWBZJ","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":"7f6f96780c6e727a6235ad15b5ad4322cc1f2c2f2ea187015c8f2e8238c620b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-29T14:27:13Z","title_canon_sha256":"06cb00b0626ca5c235c29479bf24c946e6463027abcecef686a7642911167c1b"},"schema_version":"1.0","source":{"id":"1104.5636","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5636","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5636v1","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5636","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"ANHGW2C5TT4G","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ANHGW2C5TT4GYTNI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ANHGW2C5","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:c040e6163bd6e590ddc51fbcda1b831cc9d2a08bcfdae9289694f752a5df8df4","target":"graph","created_at":"2026-05-18T04:23:20Z","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":"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","authors_text":"Christophe Betoule, Dario Rossi, Gilles Thouenon, Giuseppe Rossini, Remi Clavier, Thomas Bonald","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-29T14:27:13Z","title":"Adaptive Probabilistic Flooding for Multipath Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5636","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:d17ec0cb357ab0b59c468d5e9a738eeb30129292da278899a2537a93062ccb60","target":"record","created_at":"2026-05-18T04:23:20Z","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":"7f6f96780c6e727a6235ad15b5ad4322cc1f2c2f2ea187015c8f2e8238c620b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-04-29T14:27:13Z","title_canon_sha256":"06cb00b0626ca5c235c29479bf24c946e6463027abcecef686a7642911167c1b"},"schema_version":"1.0","source":{"id":"1104.5636","kind":"arxiv","version":1}},"canonical_sha256":"034e6b685d9cf86c4da8cd247edac1ca41b1377c4fe0254c5a3773bd312ec97b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"034e6b685d9cf86c4da8cd247edac1ca41b1377c4fe0254c5a3773bd312ec97b","first_computed_at":"2026-05-18T04:23:20.652628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:20.652628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7y1f6D+VEn4BzZWYTXOHmpdBeP9tLlTv74uYDmbSpXcLD6nd3T8bH11qSmC64o7UP24n5A3yxYlQR0n6nXzYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:20.653147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5636","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d17ec0cb357ab0b59c468d5e9a738eeb30129292da278899a2537a93062ccb60","sha256:c040e6163bd6e590ddc51fbcda1b831cc9d2a08bcfdae9289694f752a5df8df4"],"state_sha256":"a6ab6e038318bd6f1d6cc03f1a8004624f6d4ac9167f903197ede46412d23b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jB9vqA3UIs+HUqCAEqS08JRDjXdPPLXjhs1iAzdhYcsYJx93Pb8qXQRXEjIbWkNKs4+rvrEg/CGl3IEdT53aCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:02:48.111552Z","bundle_sha256":"4749e87c704743833e85c2c1beef94168fb7a5e8c1a6d1f5e4ed3220b66c2561"}}