{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XX5LWFITWKAAYFQUZ7GJSU464D","short_pith_number":"pith:XX5LWFIT","canonical_record":{"source":{"id":"2008.03942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-08-10T08:06:24Z","cross_cats_sorted":[],"title_canon_sha256":"944b583c3dd22340c25f1c9cae356670dfe11c0952d8f056a8ac5144645dce37","abstract_canon_sha256":"d61cbdcd9054ca8208f2688877c73e7dfdacf8b27afe9125941de04ca1921a4a"},"schema_version":"1.0"},"canonical_sha256":"bdfabb1513b2800c1614cfcc99539ee0d0d8f8d3bd929104c81bdae9cdcf62bf","source":{"kind":"arxiv","id":"2008.03942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03942","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03942v1","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03942","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"XX5LWFITWKAA","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"XX5LWFITWKAAYFQU","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"XX5LWFIT","created_at":"2026-07-05T01:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XX5LWFITWKAAYFQUZ7GJSU464D","target":"record","payload":{"canonical_record":{"source":{"id":"2008.03942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-08-10T08:06:24Z","cross_cats_sorted":[],"title_canon_sha256":"944b583c3dd22340c25f1c9cae356670dfe11c0952d8f056a8ac5144645dce37","abstract_canon_sha256":"d61cbdcd9054ca8208f2688877c73e7dfdacf8b27afe9125941de04ca1921a4a"},"schema_version":"1.0"},"canonical_sha256":"bdfabb1513b2800c1614cfcc99539ee0d0d8f8d3bd929104c81bdae9cdcf62bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:58.155024Z","signature_b64":"ZEtzq3Xuc88YaY7VAPIXd3+oa/5iNHPrrLwx9zRBOjBWYTLL4kp3i5Nlj8Gw7FrtGS3NIdtw/XFV+TlZQk0mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdfabb1513b2800c1614cfcc99539ee0d0d8f8d3bd929104c81bdae9cdcf62bf","last_reissued_at":"2026-07-05T01:25:58.154603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:58.154603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.03942","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-05T01:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meUcIwIP9WRGpHkRfQL4ei2oc1g6CDgyCS5n51q3isYtwBBWBGGEWBoJfXPTc1TUzQ/nvwLooxbShwCbPTTbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:57:35.685707Z"},"content_sha256":"6f7ce0317adea57c5ea1baef68b05829b7f8c63af9e7efbc11004b105897a9ff","schema_version":"1.0","event_id":"sha256:6f7ce0317adea57c5ea1baef68b05829b7f8c63af9e7efbc11004b105897a9ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XX5LWFITWKAAYFQUZ7GJSU464D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fan Zhang, Gong Zhang, Jinxin Wang, Zaiwen Wen, Zhonglin Xie","submitted_at":"2020-08-10T08:06:24Z","abstract_excerpt":"In this paper, we study a joint bandwidth allocation and path selection problem via solving a multi-objective minimization problem under the path cardinality constraints, namely MOPC. Our problem formulation captures various types of objectives including the proportional fairness, the total completion time, as well as the worst-case link utilization ratio. Such an optimization problem is very challenging since it is highly non-convex. Almost all existing works deal with such a problem using relaxation techniques to transform it to be a convex optimization problem. However, we provide a novel s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03942","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/2008.03942/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-05T01:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KJyE0g7dBXnvCvoU+KjS5SpL3o7qCsdYG70tR3vr67R2NWyfhlt0dIhdSLPLCpGBBxZc/mLXJk33Ia+KVC97Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:57:35.686219Z"},"content_sha256":"b31ce26ea07547d390aec696b8b12087d7ba8342c893d2aafb1014da03d1d0a0","schema_version":"1.0","event_id":"sha256:b31ce26ea07547d390aec696b8b12087d7ba8342c893d2aafb1014da03d1d0a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX5LWFITWKAAYFQUZ7GJSU464D/bundle.json","state_url":"https://pith.science/pith/XX5LWFITWKAAYFQUZ7GJSU464D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX5LWFITWKAAYFQUZ7GJSU464D/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-21T10:57:35Z","links":{"resolver":"https://pith.science/pith/XX5LWFITWKAAYFQUZ7GJSU464D","bundle":"https://pith.science/pith/XX5LWFITWKAAYFQUZ7GJSU464D/bundle.json","state":"https://pith.science/pith/XX5LWFITWKAAYFQUZ7GJSU464D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX5LWFITWKAAYFQUZ7GJSU464D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XX5LWFITWKAAYFQUZ7GJSU464D","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":"d61cbdcd9054ca8208f2688877c73e7dfdacf8b27afe9125941de04ca1921a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-08-10T08:06:24Z","title_canon_sha256":"944b583c3dd22340c25f1c9cae356670dfe11c0952d8f056a8ac5144645dce37"},"schema_version":"1.0","source":{"id":"2008.03942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.03942","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"2008.03942v1","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03942","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"XX5LWFITWKAA","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"XX5LWFITWKAAYFQU","created_at":"2026-07-05T01:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"XX5LWFIT","created_at":"2026-07-05T01:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:b31ce26ea07547d390aec696b8b12087d7ba8342c893d2aafb1014da03d1d0a0","target":"graph","created_at":"2026-07-05T01:25:58Z","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/2008.03942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study a joint bandwidth allocation and path selection problem via solving a multi-objective minimization problem under the path cardinality constraints, namely MOPC. Our problem formulation captures various types of objectives including the proportional fairness, the total completion time, as well as the worst-case link utilization ratio. Such an optimization problem is very challenging since it is highly non-convex. Almost all existing works deal with such a problem using relaxation techniques to transform it to be a convex optimization problem. However, we provide a novel s","authors_text":"Fan Zhang, Gong Zhang, Jinxin Wang, Zaiwen Wen, Zhonglin Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-08-10T08:06:24Z","title":"Joint Bandwidth Allocation and Path Selection in WANs with Path Cardinality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03942","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:6f7ce0317adea57c5ea1baef68b05829b7f8c63af9e7efbc11004b105897a9ff","target":"record","created_at":"2026-07-05T01:25:58Z","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":"d61cbdcd9054ca8208f2688877c73e7dfdacf8b27afe9125941de04ca1921a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2020-08-10T08:06:24Z","title_canon_sha256":"944b583c3dd22340c25f1c9cae356670dfe11c0952d8f056a8ac5144645dce37"},"schema_version":"1.0","source":{"id":"2008.03942","kind":"arxiv","version":1}},"canonical_sha256":"bdfabb1513b2800c1614cfcc99539ee0d0d8f8d3bd929104c81bdae9cdcf62bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdfabb1513b2800c1614cfcc99539ee0d0d8f8d3bd929104c81bdae9cdcf62bf","first_computed_at":"2026-07-05T01:25:58.154603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:58.154603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZEtzq3Xuc88YaY7VAPIXd3+oa/5iNHPrrLwx9zRBOjBWYTLL4kp3i5Nlj8Gw7FrtGS3NIdtw/XFV+TlZQk0mBw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:58.155024Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.03942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f7ce0317adea57c5ea1baef68b05829b7f8c63af9e7efbc11004b105897a9ff","sha256:b31ce26ea07547d390aec696b8b12087d7ba8342c893d2aafb1014da03d1d0a0"],"state_sha256":"b6c8e4d763b4c056f593086df2f1d8edf842eb9f4fa0c17faf54c1140ff11618"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtCha0N0QGlQ63P/LVaE34vdYRuebhqCA8MgKHnEqPiFXwn0YqQczL9J2a+974E7+M6hF7zc4zyIzaKh9ENSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T10:57:35.692687Z","bundle_sha256":"6425734ae1a652f5438f71c9a893087b5fe5137d5eb47a804f05745a4f8de74a"}}