{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5AJPFYIXGV5PYCSB7KV7MPVIV4","short_pith_number":"pith:5AJPFYIX","canonical_record":{"source":{"id":"1010.1524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-07T19:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"7fa1266709358a5100bf9d091c49b71eca0cb1acba1a4e3cc77c1bec519bdd0c","abstract_canon_sha256":"7769c647cb005b18bb3f3ef4734ec032bec9c10e571d822ab179596352544b6f"},"schema_version":"1.0"},"canonical_sha256":"e812f2e117357afc0a41faabf63ea8af007fbdbff7bee59f7c0aba217fca8d40","source":{"kind":"arxiv","id":"1010.1524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1524","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1524v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1524","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"5AJPFYIXGV5P","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5AJPFYIXGV5PYCSB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5AJPFYIX","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5AJPFYIXGV5PYCSB7KV7MPVIV4","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-07T19:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"7fa1266709358a5100bf9d091c49b71eca0cb1acba1a4e3cc77c1bec519bdd0c","abstract_canon_sha256":"7769c647cb005b18bb3f3ef4734ec032bec9c10e571d822ab179596352544b6f"},"schema_version":"1.0"},"canonical_sha256":"e812f2e117357afc0a41faabf63ea8af007fbdbff7bee59f7c0aba217fca8d40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:40.927937Z","signature_b64":"ZOR+oMDYSDmLtjFZ/04yvonRrlLNBBBt1JUdB3WJmAMROykxyKspWX3ZbFOnbTXs3sP6HvIwf49IeIMe+CK4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e812f2e117357afc0a41faabf63ea8af007fbdbff7bee59f7c0aba217fca8d40","last_reissued_at":"2026-05-18T04:39:40.927291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:40.927291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1524","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:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54nQdpGNCFFvf+BRcFexwCXo0mHX0X4JUGF0mhe0Sbwu6nko25tL/YyrprxgrL8+LtpLsj+JkcUjAsRVW4YUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:55:09.221999Z"},"content_sha256":"6c36953f1056ede3185fad80ad5c862682df2ad52fad53adf08287a20788b55e","schema_version":"1.0","event_id":"sha256:6c36953f1056ede3185fad80ad5c862682df2ad52fad53adf08287a20788b55e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5AJPFYIXGV5PYCSB7KV7MPVIV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real-Time Multi-path Tracking of Probabilistic Available Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Frederic Thouin, Mark Coates, Michael Rabbat","submitted_at":"2010-10-07T19:41:17Z","abstract_excerpt":"Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit on a given path without causing congestion. We consider a probabilistic formulation for available bandwidth where the user specifies the probability of achieving an output rate almost as large as the input rate. We are interested in estimating and tracking the network-wide probabilistic available bandwidth (PAB) on multiple paths simultaneously with minimal overhead on the network. We propose a novel framework based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1524","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:39:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S7eVIXPM09HjV8XmikiDid/VE+hjt/4qgUm2XXzSfl6QeMlc/bb3VRW+Ol5cB5E5fFD/o6/cTDMfxGM8R2dYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:55:09.222395Z"},"content_sha256":"e70d16111e518b13dc043566b7fe34e480eb3fbfc780cc1aeac86f95c087a520","schema_version":"1.0","event_id":"sha256:e70d16111e518b13dc043566b7fe34e480eb3fbfc780cc1aeac86f95c087a520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4/bundle.json","state_url":"https://pith.science/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4/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-10T16:55:09Z","links":{"resolver":"https://pith.science/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4","bundle":"https://pith.science/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4/bundle.json","state":"https://pith.science/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AJPFYIXGV5PYCSB7KV7MPVIV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5AJPFYIXGV5PYCSB7KV7MPVIV4","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":"7769c647cb005b18bb3f3ef4734ec032bec9c10e571d822ab179596352544b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-07T19:41:17Z","title_canon_sha256":"7fa1266709358a5100bf9d091c49b71eca0cb1acba1a4e3cc77c1bec519bdd0c"},"schema_version":"1.0","source":{"id":"1010.1524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1524","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1524v1","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1524","created_at":"2026-05-18T04:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"5AJPFYIXGV5P","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5AJPFYIXGV5PYCSB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5AJPFYIX","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:e70d16111e518b13dc043566b7fe34e480eb3fbfc780cc1aeac86f95c087a520","target":"graph","created_at":"2026-05-18T04:39:40Z","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":"Applications such as traffic engineering and network provisioning can greatly benefit from knowing, in real time, what is the largest input rate at which it is possible to transmit on a given path without causing congestion. We consider a probabilistic formulation for available bandwidth where the user specifies the probability of achieving an output rate almost as large as the input rate. We are interested in estimating and tracking the network-wide probabilistic available bandwidth (PAB) on multiple paths simultaneously with minimal overhead on the network. We propose a novel framework based","authors_text":"Frederic Thouin, Mark Coates, Michael Rabbat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-07T19:41:17Z","title":"Real-Time Multi-path Tracking of Probabilistic Available Bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1524","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:6c36953f1056ede3185fad80ad5c862682df2ad52fad53adf08287a20788b55e","target":"record","created_at":"2026-05-18T04:39:40Z","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":"7769c647cb005b18bb3f3ef4734ec032bec9c10e571d822ab179596352544b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-07T19:41:17Z","title_canon_sha256":"7fa1266709358a5100bf9d091c49b71eca0cb1acba1a4e3cc77c1bec519bdd0c"},"schema_version":"1.0","source":{"id":"1010.1524","kind":"arxiv","version":1}},"canonical_sha256":"e812f2e117357afc0a41faabf63ea8af007fbdbff7bee59f7c0aba217fca8d40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e812f2e117357afc0a41faabf63ea8af007fbdbff7bee59f7c0aba217fca8d40","first_computed_at":"2026-05-18T04:39:40.927291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:40.927291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOR+oMDYSDmLtjFZ/04yvonRrlLNBBBt1JUdB3WJmAMROykxyKspWX3ZbFOnbTXs3sP6HvIwf49IeIMe+CK4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:40.927937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c36953f1056ede3185fad80ad5c862682df2ad52fad53adf08287a20788b55e","sha256:e70d16111e518b13dc043566b7fe34e480eb3fbfc780cc1aeac86f95c087a520"],"state_sha256":"d8b7bcfa724bcf7b411098636fe4ecadfad4dff542ebd1f15bea8d83005a45a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVdJJOucdGXKhOpGLobuyZfOicor/RRXFSG6JnYYLcxzdLyLD5GcqxEVU9i4XSax8khs/kEHTpHqEp7hpt3XCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:55:09.225068Z","bundle_sha256":"45dbae7b77b997d17cd56cc310f621c0f9ce54e5d1321df4ba173c6f1e1323f9"}}