{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:K6FKD2GTEFZS6DXOAWXYDJLIPR","short_pith_number":"pith:K6FKD2GT","canonical_record":{"source":{"id":"1104.2340","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-12T20:34:06Z","cross_cats_sorted":[],"title_canon_sha256":"4be2e04f7ecbf4799ccc41047bb6ee8f451d5c597d6a88a2987f8edd4b146466","abstract_canon_sha256":"3461d5bacec68981bb2a831c1486c73eb201d525c93883698e37d7b1947e1b4d"},"schema_version":"1.0"},"canonical_sha256":"578aa1e8d321732f0eee05af81a5687c4e94d6e2f330514eeb1358ef3f97ad5b","source":{"kind":"arxiv","id":"1104.2340","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2340","created_at":"2026-05-18T03:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2340v3","created_at":"2026-05-18T03:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2340","created_at":"2026-05-18T03:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"K6FKD2GTEFZS","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K6FKD2GTEFZS6DXO","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K6FKD2GT","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:K6FKD2GTEFZS6DXOAWXYDJLIPR","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2340","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-12T20:34:06Z","cross_cats_sorted":[],"title_canon_sha256":"4be2e04f7ecbf4799ccc41047bb6ee8f451d5c597d6a88a2987f8edd4b146466","abstract_canon_sha256":"3461d5bacec68981bb2a831c1486c73eb201d525c93883698e37d7b1947e1b4d"},"schema_version":"1.0"},"canonical_sha256":"578aa1e8d321732f0eee05af81a5687c4e94d6e2f330514eeb1358ef3f97ad5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:18.270128Z","signature_b64":"lbFtuP8mECWEqnK+SyKvG5GDl+oCkKtZZ9SzohCKifndQE3PnRoZAgTw5YA2k6XrTbX4pcDbxV6JCyJS9QQZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"578aa1e8d321732f0eee05af81a5687c4e94d6e2f330514eeb1358ef3f97ad5b","last_reissued_at":"2026-05-18T03:02:18.269269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:18.269269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2340","source_version":3,"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-18T03:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zhNzMnK1uMguhEZxHFn8N8NGznMwZyCejNWjygEwbkv7nK4BwlxsZC9d/GsSDKL34QBH0LP4cUwX1cPZn0uoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:38:42.005840Z"},"content_sha256":"d80dfa666bc38ef38309204225da4d5cc0908df1d30d6090a89cd4aff72c019f","schema_version":"1.0","event_id":"sha256:d80dfa666bc38ef38309204225da4d5cc0908df1d30d6090a89cd4aff72c019f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:K6FKD2GTEFZS6DXOAWXYDJLIPR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Qualitative properties of $\\alpha$-fair policies in bandwidth-sharing networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"D. Shah, J. N. Tsitsiklis, Y. Zhong","submitted_at":"2011-04-12T20:34:06Z","abstract_excerpt":"We consider a flow-level model of a network operating under an $\\alpha$-fair bandwidth sharing policy (with $\\alpha>0$) proposed by Roberts and Massouli\\'{e} [Telecomunication Systems 15 (2000) 185-201]. This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows in a communication network. We study the transient properties as well as the steady-state distribution of the model. In particular, for $\\alpha\\geq1$, we obtain bounds on the maximum number of flows in the network over a given time horizon, by means of a maximal inequality derived from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2340","kind":"arxiv","version":3},"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-18T03:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mzKMWtVb/gtLAZv+rHNvp2mwRe8Wq+zuoo1/qLvHKfEgoLUhx4lfVBJ2T43OqEZzuI+6EbKH0P+sLDyqyJqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:38:42.006427Z"},"content_sha256":"f9407932e398ee7c0948fd9bd57ed68f625ba132abe04ca0f7272f997dd7d11d","schema_version":"1.0","event_id":"sha256:f9407932e398ee7c0948fd9bd57ed68f625ba132abe04ca0f7272f997dd7d11d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR/bundle.json","state_url":"https://pith.science/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR/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-03T12:38:42Z","links":{"resolver":"https://pith.science/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR","bundle":"https://pith.science/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR/bundle.json","state":"https://pith.science/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K6FKD2GTEFZS6DXOAWXYDJLIPR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:K6FKD2GTEFZS6DXOAWXYDJLIPR","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":"3461d5bacec68981bb2a831c1486c73eb201d525c93883698e37d7b1947e1b4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-12T20:34:06Z","title_canon_sha256":"4be2e04f7ecbf4799ccc41047bb6ee8f451d5c597d6a88a2987f8edd4b146466"},"schema_version":"1.0","source":{"id":"1104.2340","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2340","created_at":"2026-05-18T03:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2340v3","created_at":"2026-05-18T03:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2340","created_at":"2026-05-18T03:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"K6FKD2GTEFZS","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"K6FKD2GTEFZS6DXO","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"K6FKD2GT","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:f9407932e398ee7c0948fd9bd57ed68f625ba132abe04ca0f7272f997dd7d11d","target":"graph","created_at":"2026-05-18T03:02:18Z","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":"We consider a flow-level model of a network operating under an $\\alpha$-fair bandwidth sharing policy (with $\\alpha>0$) proposed by Roberts and Massouli\\'{e} [Telecomunication Systems 15 (2000) 185-201]. This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows in a communication network. We study the transient properties as well as the steady-state distribution of the model. In particular, for $\\alpha\\geq1$, we obtain bounds on the maximum number of flows in the network over a given time horizon, by means of a maximal inequality derived from","authors_text":"D. Shah, J. N. Tsitsiklis, Y. Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-12T20:34:06Z","title":"Qualitative properties of $\\alpha$-fair policies in bandwidth-sharing networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2340","kind":"arxiv","version":3},"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:d80dfa666bc38ef38309204225da4d5cc0908df1d30d6090a89cd4aff72c019f","target":"record","created_at":"2026-05-18T03:02:18Z","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":"3461d5bacec68981bb2a831c1486c73eb201d525c93883698e37d7b1947e1b4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-04-12T20:34:06Z","title_canon_sha256":"4be2e04f7ecbf4799ccc41047bb6ee8f451d5c597d6a88a2987f8edd4b146466"},"schema_version":"1.0","source":{"id":"1104.2340","kind":"arxiv","version":3}},"canonical_sha256":"578aa1e8d321732f0eee05af81a5687c4e94d6e2f330514eeb1358ef3f97ad5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"578aa1e8d321732f0eee05af81a5687c4e94d6e2f330514eeb1358ef3f97ad5b","first_computed_at":"2026-05-18T03:02:18.269269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:18.269269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lbFtuP8mECWEqnK+SyKvG5GDl+oCkKtZZ9SzohCKifndQE3PnRoZAgTw5YA2k6XrTbX4pcDbxV6JCyJS9QQZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:18.270128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2340","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80dfa666bc38ef38309204225da4d5cc0908df1d30d6090a89cd4aff72c019f","sha256:f9407932e398ee7c0948fd9bd57ed68f625ba132abe04ca0f7272f997dd7d11d"],"state_sha256":"99bd53b800f5d703538da437a7cf1a8386eb846b1da2d2251d568dc07b5c7fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrYgbkI2VaO0Zg8e+kvhm4Txu6wB8goe5RaLB8DW/tVPCfXLPVVIzIT6xC6Jp+2vqxZZeVbXBaGz8bE6SscrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:38:42.008839Z","bundle_sha256":"6f8cc2e5cc8ee3822112897e98758db1ea964cd7332ccaaa3255dda5c3139dda"}}