{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5LLA7WMMDBGJ5S2NNHQJLLXNMM","short_pith_number":"pith:5LLA7WMM","canonical_record":{"source":{"id":"1207.6354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T18:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"61c1edb22b744354e638d96a3758b6e0c7641e65de29e7c6ff288fa5ba6a0a3d","abstract_canon_sha256":"97530e281ba24cd5e273f9e9393f149124168ede96714b5424d89d252f9c719f"},"schema_version":"1.0"},"canonical_sha256":"ead60fd98c184c9ecb4d69e095aeed632b8edf7dd81c74edd37af4c2314b3a76","source":{"kind":"arxiv","id":"1207.6354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6354","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6354v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6354","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"5LLA7WMMDBGJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5LLA7WMMDBGJ5S2N","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5LLA7WMM","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5LLA7WMMDBGJ5S2NNHQJLLXNMM","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T18:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"61c1edb22b744354e638d96a3758b6e0c7641e65de29e7c6ff288fa5ba6a0a3d","abstract_canon_sha256":"97530e281ba24cd5e273f9e9393f149124168ede96714b5424d89d252f9c719f"},"schema_version":"1.0"},"canonical_sha256":"ead60fd98c184c9ecb4d69e095aeed632b8edf7dd81c74edd37af4c2314b3a76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:00.453955Z","signature_b64":"r7nMjIWJH77mRbJPlB4OFBRR8gwBh7cjudXRZ0ndzbcMFDLM3NN9LFmy/cdBaebDhRxm2XB5LQ09FljEGPeUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ead60fd98c184c9ecb4d69e095aeed632b8edf7dd81c74edd37af4c2314b3a76","last_reissued_at":"2026-05-18T03:50:00.453514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:00.453514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6354","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-18T03:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVRgeTW2aW9hO6VQJQGYHYAGMabkSgAX04zMURCJ4od2KL8GieN4yMuYqKbkQE0oZjZYN1NaNiC8mXRAql/xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:47:00.017521Z"},"content_sha256":"875729eeb6716bcdaf685b0f944b663047db12721dc1754a9e0f1e8582cc0a0b","schema_version":"1.0","event_id":"sha256:875729eeb6716bcdaf685b0f944b663047db12721dc1754a9e0f1e8582cc0a0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5LLA7WMMDBGJ5S2NNHQJLLXNMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Receiver-Based Flow Control for Networks in Overload","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chih-ping Li, Eytan Modiano","submitted_at":"2012-07-26T18:14:31Z","abstract_excerpt":"We consider utility maximization in networks where the sources do not employ flow control and may consequently overload the network. In the absence of flow control at the sources, some packets will inevitably have to be dropped when the network is in overload. To that end, we first develop a distributed, threshold-based packet dropping policy that maximizes the weighted sum throughput. Next, we consider utility maximization and develop a receiver-based flow control scheme that, when combined with threshold-based packet dropping, achieves the optimal utility. The flow control scheme creates vir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6354","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-18T03:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"he8zICMLfXuC6Xef+auxJku4PizKdbmVKM96uYV4L8l+w1tLVhIovlZanez/p9hByRw6G8KwdE6xqmYdgp4wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:47:00.017873Z"},"content_sha256":"e1a51acdf0f0f75726f0c73857a59197bf58103e4f250c8d462d1d8b95eb22a3","schema_version":"1.0","event_id":"sha256:e1a51acdf0f0f75726f0c73857a59197bf58103e4f250c8d462d1d8b95eb22a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM/bundle.json","state_url":"https://pith.science/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM/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-28T10:47:00Z","links":{"resolver":"https://pith.science/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM","bundle":"https://pith.science/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM/bundle.json","state":"https://pith.science/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LLA7WMMDBGJ5S2NNHQJLLXNMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5LLA7WMMDBGJ5S2NNHQJLLXNMM","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":"97530e281ba24cd5e273f9e9393f149124168ede96714b5424d89d252f9c719f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T18:14:31Z","title_canon_sha256":"61c1edb22b744354e638d96a3758b6e0c7641e65de29e7c6ff288fa5ba6a0a3d"},"schema_version":"1.0","source":{"id":"1207.6354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6354","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6354v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6354","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"5LLA7WMMDBGJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5LLA7WMMDBGJ5S2N","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5LLA7WMM","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:e1a51acdf0f0f75726f0c73857a59197bf58103e4f250c8d462d1d8b95eb22a3","target":"graph","created_at":"2026-05-18T03:50:00Z","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 utility maximization in networks where the sources do not employ flow control and may consequently overload the network. In the absence of flow control at the sources, some packets will inevitably have to be dropped when the network is in overload. To that end, we first develop a distributed, threshold-based packet dropping policy that maximizes the weighted sum throughput. Next, we consider utility maximization and develop a receiver-based flow control scheme that, when combined with threshold-based packet dropping, achieves the optimal utility. The flow control scheme creates vir","authors_text":"Chih-ping Li, Eytan Modiano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T18:14:31Z","title":"Receiver-Based Flow Control for Networks in Overload"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6354","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:875729eeb6716bcdaf685b0f944b663047db12721dc1754a9e0f1e8582cc0a0b","target":"record","created_at":"2026-05-18T03:50:00Z","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":"97530e281ba24cd5e273f9e9393f149124168ede96714b5424d89d252f9c719f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-26T18:14:31Z","title_canon_sha256":"61c1edb22b744354e638d96a3758b6e0c7641e65de29e7c6ff288fa5ba6a0a3d"},"schema_version":"1.0","source":{"id":"1207.6354","kind":"arxiv","version":1}},"canonical_sha256":"ead60fd98c184c9ecb4d69e095aeed632b8edf7dd81c74edd37af4c2314b3a76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ead60fd98c184c9ecb4d69e095aeed632b8edf7dd81c74edd37af4c2314b3a76","first_computed_at":"2026-05-18T03:50:00.453514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:00.453514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7nMjIWJH77mRbJPlB4OFBRR8gwBh7cjudXRZ0ndzbcMFDLM3NN9LFmy/cdBaebDhRxm2XB5LQ09FljEGPeUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:00.453955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:875729eeb6716bcdaf685b0f944b663047db12721dc1754a9e0f1e8582cc0a0b","sha256:e1a51acdf0f0f75726f0c73857a59197bf58103e4f250c8d462d1d8b95eb22a3"],"state_sha256":"e9f38f68825466ed7f6bd48d23896952338d7c3f8be5dd10b62e3acf5220a6ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2uNx19sMZY45BVcrcaDHN+MoEMlKJ6GaAT71/coQrEQAFW0dVbHWjrZ6ZubTchrv5KLI4eKbwTUE/WDB4TQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:47:00.019905Z","bundle_sha256":"def9ca3f2fa936a330c07d329e6e359249b2da25ab0c430bc9e107f732080c38"}}