{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:C2DNLR2J7ZXFXMK6K3HWM77MPA","short_pith_number":"pith:C2DNLR2J","canonical_record":{"source":{"id":"2101.10898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-26T16:06:51Z","cross_cats_sorted":[],"title_canon_sha256":"4deb15b5a60499a4c01378217bcaeff43929e2fb889319116f3f8e1da4727361","abstract_canon_sha256":"d5407494cca6e3c6ad70334a1b4813d6eb20a84c3b9f6f0620f410455dc08812"},"schema_version":"1.0"},"canonical_sha256":"1686d5c749fe6e5bb15e56cf667fec782dc7518dd8e1c5b706a6b993070240eb","source":{"kind":"arxiv","id":"2101.10898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.10898","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2101.10898v1","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10898","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"C2DNLR2J7ZXF","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"pith_short_16","alias_value":"C2DNLR2J7ZXFXMK6","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"pith_short_8","alias_value":"C2DNLR2J","created_at":"2026-07-05T02:10:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:C2DNLR2J7ZXFXMK6K3HWM77MPA","target":"record","payload":{"canonical_record":{"source":{"id":"2101.10898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-26T16:06:51Z","cross_cats_sorted":[],"title_canon_sha256":"4deb15b5a60499a4c01378217bcaeff43929e2fb889319116f3f8e1da4727361","abstract_canon_sha256":"d5407494cca6e3c6ad70334a1b4813d6eb20a84c3b9f6f0620f410455dc08812"},"schema_version":"1.0"},"canonical_sha256":"1686d5c749fe6e5bb15e56cf667fec782dc7518dd8e1c5b706a6b993070240eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:03.321938Z","signature_b64":"5M1zFG93dJuIg0DQapn2THnMJC7nGgPRjJn+tJDIR1xsOyiLhOM85gUTOLZUA6yBlJ35z31WoN9jDSsQ3DqgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1686d5c749fe6e5bb15e56cf667fec782dc7518dd8e1c5b706a6b993070240eb","last_reissued_at":"2026-07-05T02:10:03.321607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:03.321607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.10898","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-07-05T02:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOi5BzCP5O6UAVREWkENi+rOccZ2zWZSFkCryH+kQNktmd8ZcTbRW+r075YdcSU6YmEKGE8S++0RYn2dHFzaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:22:30.616054Z"},"content_sha256":"326945fbeddeef853ea86fb49ed6061f3199de6324ef63c44a79c55ccf8d544c","schema_version":"1.0","event_id":"sha256:326945fbeddeef853ea86fb49ed6061f3199de6324ef63c44a79c55ccf8d544c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:C2DNLR2J7ZXFXMK6K3HWM77MPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Sun, Danny H.K. Tsang, Ying Cao","submitted_at":"2021-01-26T16:06:51Z","abstract_excerpt":"We consider an online version of the well-studied network utility maximization problem, where users arrive one by one and an operator makes irrevocable decisions for each user without knowing the details of future arrivals. We propose a threshold-based algorithm and analyze its worst-case performance. We prove that the competitive ratio of the proposed algorithm is linearly increasing in the number of links in a network and show this competitive analysis is tight. Extensive trace-driven simulations are conducted to demonstrate the performance of our proposed algorithm. In addition, since worst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10898","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.10898/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gpsAZ5GeItSH5iH5GvDkC4ZAa0Mb4R7SwsWkY54qHE8aAmSXAAcAbU4+8zM1ZBFjoXdMJcsFEDJ4wqrQhvCIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:22:30.617050Z"},"content_sha256":"c29231cb8fcb29c5dc04f035aeeca87fda0b26255aa2a3b21967377331fd7b22","schema_version":"1.0","event_id":"sha256:c29231cb8fcb29c5dc04f035aeeca87fda0b26255aa2a3b21967377331fd7b22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA/bundle.json","state_url":"https://pith.science/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA/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-08-22T13:22:30Z","links":{"resolver":"https://pith.science/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA","bundle":"https://pith.science/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA/bundle.json","state":"https://pith.science/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2DNLR2J7ZXFXMK6K3HWM77MPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:C2DNLR2J7ZXFXMK6K3HWM77MPA","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":"d5407494cca6e3c6ad70334a1b4813d6eb20a84c3b9f6f0620f410455dc08812","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-26T16:06:51Z","title_canon_sha256":"4deb15b5a60499a4c01378217bcaeff43929e2fb889319116f3f8e1da4727361"},"schema_version":"1.0","source":{"id":"2101.10898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.10898","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2101.10898v1","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10898","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"C2DNLR2J7ZXF","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"pith_short_16","alias_value":"C2DNLR2J7ZXFXMK6","created_at":"2026-07-05T02:10:03Z"},{"alias_kind":"pith_short_8","alias_value":"C2DNLR2J","created_at":"2026-07-05T02:10:03Z"}],"graph_snapshots":[{"event_id":"sha256:c29231cb8fcb29c5dc04f035aeeca87fda0b26255aa2a3b21967377331fd7b22","target":"graph","created_at":"2026-07-05T02:10:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.10898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider an online version of the well-studied network utility maximization problem, where users arrive one by one and an operator makes irrevocable decisions for each user without knowing the details of future arrivals. We propose a threshold-based algorithm and analyze its worst-case performance. We prove that the competitive ratio of the proposed algorithm is linearly increasing in the number of links in a network and show this competitive analysis is tight. Extensive trace-driven simulations are conducted to demonstrate the performance of our proposed algorithm. In addition, since worst","authors_text":"Bo Sun, Danny H.K. Tsang, Ying Cao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-26T16:06:51Z","title":"Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10898","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:326945fbeddeef853ea86fb49ed6061f3199de6324ef63c44a79c55ccf8d544c","target":"record","created_at":"2026-07-05T02:10:03Z","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":"d5407494cca6e3c6ad70334a1b4813d6eb20a84c3b9f6f0620f410455dc08812","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2021-01-26T16:06:51Z","title_canon_sha256":"4deb15b5a60499a4c01378217bcaeff43929e2fb889319116f3f8e1da4727361"},"schema_version":"1.0","source":{"id":"2101.10898","kind":"arxiv","version":1}},"canonical_sha256":"1686d5c749fe6e5bb15e56cf667fec782dc7518dd8e1c5b706a6b993070240eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1686d5c749fe6e5bb15e56cf667fec782dc7518dd8e1c5b706a6b993070240eb","first_computed_at":"2026-07-05T02:10:03.321607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:10:03.321607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5M1zFG93dJuIg0DQapn2THnMJC7nGgPRjJn+tJDIR1xsOyiLhOM85gUTOLZUA6yBlJ35z31WoN9jDSsQ3DqgBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:10:03.321938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.10898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:326945fbeddeef853ea86fb49ed6061f3199de6324ef63c44a79c55ccf8d544c","sha256:c29231cb8fcb29c5dc04f035aeeca87fda0b26255aa2a3b21967377331fd7b22"],"state_sha256":"4eae6d3dfd4479915c5884fb74a6b8f9585b40fda1505679cfdb387307cdaa13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMBP4j9Hnl+z+Vq9EpMBzdPBzJdXvd6tRKnnt5mh8bbRRz5w8uFlduVbMlFK7t9qOVU0mJJWYTtp0BX2OZtYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:22:30.622035Z","bundle_sha256":"621581194dc682f30fe8985ac800277bb46ace396f15521cb0c156af26cb6f28"}}