{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:M6Q7SNYCN32EZB5RR22APWA2TG","short_pith_number":"pith:M6Q7SNYC","canonical_record":{"source":{"id":"1010.3142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-15T12:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"c0c57cce482753d5465b790f22fbd0902341c1c7002f773ca8927c362802556e","abstract_canon_sha256":"eda1559def259822e793cbf61f34acae813d1d14f0cad6502455f238e883827c"},"schema_version":"1.0"},"canonical_sha256":"67a1f937026ef44c87b18eb407d81a99b4eb37d922ab5cdf9d2116ade61218ba","source":{"kind":"arxiv","id":"1010.3142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3142","created_at":"2026-05-18T04:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3142v1","created_at":"2026-05-18T04:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3142","created_at":"2026-05-18T04:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"M6Q7SNYCN32E","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M6Q7SNYCN32EZB5R","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M6Q7SNYC","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:M6Q7SNYCN32EZB5RR22APWA2TG","target":"record","payload":{"canonical_record":{"source":{"id":"1010.3142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-15T12:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"c0c57cce482753d5465b790f22fbd0902341c1c7002f773ca8927c362802556e","abstract_canon_sha256":"eda1559def259822e793cbf61f34acae813d1d14f0cad6502455f238e883827c"},"schema_version":"1.0"},"canonical_sha256":"67a1f937026ef44c87b18eb407d81a99b4eb37d922ab5cdf9d2116ade61218ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:17.705631Z","signature_b64":"iKe62TU5bK+316PBmKwb/3Tl1DdA6x8xECjp0DsT4UrWDVq/Clyb8F0T2kvYgzr7sb0XAi6he8++7yn+oJJcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67a1f937026ef44c87b18eb407d81a99b4eb37d922ab5cdf9d2116ade61218ba","last_reissued_at":"2026-05-18T04:39:17.704967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:17.704967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.3142","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VvNCdri5nNbH2DQUglNzRTRQdE3NyNIBcwkTECh0pl83ozhpQVy7u0w+x5+r1WPR5kl6wYCiZtkkiuLpG9a7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:44:15.421020Z"},"content_sha256":"7e1441740fc00ac9f9c472aac84d557a8bb1d385751ef8b1bc6846d54a1fcf41","schema_version":"1.0","event_id":"sha256:7e1441740fc00ac9f9c472aac84d557a8bb1d385751ef8b1bc6846d54a1fcf41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:M6Q7SNYCN32EZB5RR22APWA2TG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network stability under max--min fair bandwidth sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maury Bramson","submitted_at":"2010-10-15T12:30:42Z","abstract_excerpt":"There has recently been considerable interest in the stability of different fair bandwidth sharing policies for models that arise in the context of Internet congestion control. Here, we consider a connection level model, introduced by Massouli\\'{e} and Roberts [Telecommunication Systems 15 (2000) 185--201], that represents the randomly varying number of flows present in a network. The weighted $\\alpha$-fair and weighted max-min fair bandwidth sharing policies are among important policies that have been studied for this model. Stability results are known in both cases when the interarrival time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3142","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgKohp/jFu/tyAxv3Bknr6l4HryyMOyzrowhNOSKKGNz/0+eKNuvZK/f0RBhlXVzNKhVxZmxRUb2IdKLA3H/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:44:15.421582Z"},"content_sha256":"9b8d9c35096f818be73452aa70581e68de2501053268d2d31c23310ad69f9483","schema_version":"1.0","event_id":"sha256:9b8d9c35096f818be73452aa70581e68de2501053268d2d31c23310ad69f9483"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6Q7SNYCN32EZB5RR22APWA2TG/bundle.json","state_url":"https://pith.science/pith/M6Q7SNYCN32EZB5RR22APWA2TG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6Q7SNYCN32EZB5RR22APWA2TG/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-05-30T11:44:15Z","links":{"resolver":"https://pith.science/pith/M6Q7SNYCN32EZB5RR22APWA2TG","bundle":"https://pith.science/pith/M6Q7SNYCN32EZB5RR22APWA2TG/bundle.json","state":"https://pith.science/pith/M6Q7SNYCN32EZB5RR22APWA2TG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6Q7SNYCN32EZB5RR22APWA2TG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:M6Q7SNYCN32EZB5RR22APWA2TG","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":"eda1559def259822e793cbf61f34acae813d1d14f0cad6502455f238e883827c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-15T12:30:42Z","title_canon_sha256":"c0c57cce482753d5465b790f22fbd0902341c1c7002f773ca8927c362802556e"},"schema_version":"1.0","source":{"id":"1010.3142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3142","created_at":"2026-05-18T04:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3142v1","created_at":"2026-05-18T04:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3142","created_at":"2026-05-18T04:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"M6Q7SNYCN32E","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"M6Q7SNYCN32EZB5R","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"M6Q7SNYC","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:9b8d9c35096f818be73452aa70581e68de2501053268d2d31c23310ad69f9483","target":"graph","created_at":"2026-05-18T04:39:17Z","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":"There has recently been considerable interest in the stability of different fair bandwidth sharing policies for models that arise in the context of Internet congestion control. Here, we consider a connection level model, introduced by Massouli\\'{e} and Roberts [Telecommunication Systems 15 (2000) 185--201], that represents the randomly varying number of flows present in a network. The weighted $\\alpha$-fair and weighted max-min fair bandwidth sharing policies are among important policies that have been studied for this model. Stability results are known in both cases when the interarrival time","authors_text":"Maury Bramson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-15T12:30:42Z","title":"Network stability under max--min fair bandwidth sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3142","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:7e1441740fc00ac9f9c472aac84d557a8bb1d385751ef8b1bc6846d54a1fcf41","target":"record","created_at":"2026-05-18T04:39:17Z","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":"eda1559def259822e793cbf61f34acae813d1d14f0cad6502455f238e883827c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-15T12:30:42Z","title_canon_sha256":"c0c57cce482753d5465b790f22fbd0902341c1c7002f773ca8927c362802556e"},"schema_version":"1.0","source":{"id":"1010.3142","kind":"arxiv","version":1}},"canonical_sha256":"67a1f937026ef44c87b18eb407d81a99b4eb37d922ab5cdf9d2116ade61218ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67a1f937026ef44c87b18eb407d81a99b4eb37d922ab5cdf9d2116ade61218ba","first_computed_at":"2026-05-18T04:39:17.704967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:17.704967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iKe62TU5bK+316PBmKwb/3Tl1DdA6x8xECjp0DsT4UrWDVq/Clyb8F0T2kvYgzr7sb0XAi6he8++7yn+oJJcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:17.705631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e1441740fc00ac9f9c472aac84d557a8bb1d385751ef8b1bc6846d54a1fcf41","sha256:9b8d9c35096f818be73452aa70581e68de2501053268d2d31c23310ad69f9483"],"state_sha256":"711942e95010123e4bacf8ed26c43279781bb11610db328538319d17e707c3ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGzTOIe9OJ4drrBnCnJZj7QKa7otl2e8Hulp1IIepf/bGBnbNmCMN5/UU+XbuQC4VrnVGQ4oLq9xzx0jNeiAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:44:15.424488Z","bundle_sha256":"37a1b5ec7911a588d8c80343a789015c79964f831ef4b25249da6dab33abd8b2"}}