{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GHGGQSPLUWGJ6UEY3MG76NLXV2","short_pith_number":"pith:GHGGQSPL","canonical_record":{"source":{"id":"2303.16685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-22T22:27:00Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3e17efade78b3ebcd8e268b4e4e3158c10148fdd5d0ddaa713789afe68cb2d2a","abstract_canon_sha256":"c69b66398c165bbf52ce6125bdd7576bb746211f8df9fc86704535b021aecd49"},"schema_version":"1.0"},"canonical_sha256":"31cc6849eba58c9f5098db0dff3577ae9b5b060db384fcb3d7913a1596fc7c59","source":{"kind":"arxiv","id":"2303.16685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16685","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16685v1","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16685","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"GHGGQSPLUWGJ","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"GHGGQSPLUWGJ6UEY","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"GHGGQSPL","created_at":"2026-07-05T05:56:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GHGGQSPLUWGJ6UEY3MG76NLXV2","target":"record","payload":{"canonical_record":{"source":{"id":"2303.16685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-22T22:27:00Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3e17efade78b3ebcd8e268b4e4e3158c10148fdd5d0ddaa713789afe68cb2d2a","abstract_canon_sha256":"c69b66398c165bbf52ce6125bdd7576bb746211f8df9fc86704535b021aecd49"},"schema_version":"1.0"},"canonical_sha256":"31cc6849eba58c9f5098db0dff3577ae9b5b060db384fcb3d7913a1596fc7c59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:09.238363Z","signature_b64":"hc5MM05yftMYz6UzlFdoHgqbOTTe0HnVkjfqH9VthaFNjuppHTlQubOFuDdKXpmZdjUTC5jVzw/tZaP4fxB5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31cc6849eba58c9f5098db0dff3577ae9b5b060db384fcb3d7913a1596fc7c59","last_reissued_at":"2026-07-05T05:56:09.237949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:09.237949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.16685","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-05T05:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zoZ37XSYhxwT6rvNwdcjNzIORY8IPSE2pg4ol/RzpfMVRxx5L/zilyybNN0txxuaZPM+cmO0pCJbisQy3gBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:30:57.511351Z"},"content_sha256":"d7d76cb5445fed807078b79624671bd276d5e6c95826b704cf562d668837430c","schema_version":"1.0","event_id":"sha256:d7d76cb5445fed807078b79624671bd276d5e6c95826b704cf562d668837430c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GHGGQSPLUWGJ6UEY3MG76NLXV2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Policy Reuse for Communication Load Balancing in Unseen Traffic Scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NI","authors_text":"Di Wu, Gregory Dudek, Jimmy Li, Michael Jenkin, Seowoo Jang, Xue Liu, Yi Tian Xu","submitted_at":"2023-03-22T22:27:00Z","abstract_excerpt":"With the continuous growth in communication network complexity and traffic volume, communication load balancing solutions are receiving increasing attention. Specifically, reinforcement learning (RL)-based methods have shown impressive performance compared with traditional rule-based methods. However, standard RL methods generally require an enormous amount of data to train, and generalize poorly to scenarios that are not encountered during training. We propose a policy reuse framework in which a policy selector chooses the most suitable pre-trained RL policy to execute based on the current tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16685","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/2303.16685/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-05T05:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2wpUw6W8nmyRzkYlwqE08U11OpMlb2kWjgAx1TUkAlgrbvIgtbtvsKYU/H1ardvVzPvX+oh71yPcLZMFDPNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:30:57.511851Z"},"content_sha256":"b5ef87051c86372a10c0f1305c3f8370314953cae6d0134ecce87ea444b8c57c","schema_version":"1.0","event_id":"sha256:b5ef87051c86372a10c0f1305c3f8370314953cae6d0134ecce87ea444b8c57c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2/bundle.json","state_url":"https://pith.science/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2/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-06T11:30:57Z","links":{"resolver":"https://pith.science/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2","bundle":"https://pith.science/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2/bundle.json","state":"https://pith.science/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHGGQSPLUWGJ6UEY3MG76NLXV2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GHGGQSPLUWGJ6UEY3MG76NLXV2","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":"c69b66398c165bbf52ce6125bdd7576bb746211f8df9fc86704535b021aecd49","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-22T22:27:00Z","title_canon_sha256":"3e17efade78b3ebcd8e268b4e4e3158c10148fdd5d0ddaa713789afe68cb2d2a"},"schema_version":"1.0","source":{"id":"2303.16685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16685","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16685v1","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16685","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"GHGGQSPLUWGJ","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"pith_short_16","alias_value":"GHGGQSPLUWGJ6UEY","created_at":"2026-07-05T05:56:09Z"},{"alias_kind":"pith_short_8","alias_value":"GHGGQSPL","created_at":"2026-07-05T05:56:09Z"}],"graph_snapshots":[{"event_id":"sha256:b5ef87051c86372a10c0f1305c3f8370314953cae6d0134ecce87ea444b8c57c","target":"graph","created_at":"2026-07-05T05:56:09Z","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/2303.16685/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With the continuous growth in communication network complexity and traffic volume, communication load balancing solutions are receiving increasing attention. Specifically, reinforcement learning (RL)-based methods have shown impressive performance compared with traditional rule-based methods. However, standard RL methods generally require an enormous amount of data to train, and generalize poorly to scenarios that are not encountered during training. We propose a policy reuse framework in which a policy selector chooses the most suitable pre-trained RL policy to execute based on the current tr","authors_text":"Di Wu, Gregory Dudek, Jimmy Li, Michael Jenkin, Seowoo Jang, Xue Liu, Yi Tian Xu","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-22T22:27:00Z","title":"Policy Reuse for Communication Load Balancing in Unseen Traffic Scenarios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16685","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:d7d76cb5445fed807078b79624671bd276d5e6c95826b704cf562d668837430c","target":"record","created_at":"2026-07-05T05:56:09Z","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":"c69b66398c165bbf52ce6125bdd7576bb746211f8df9fc86704535b021aecd49","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-03-22T22:27:00Z","title_canon_sha256":"3e17efade78b3ebcd8e268b4e4e3158c10148fdd5d0ddaa713789afe68cb2d2a"},"schema_version":"1.0","source":{"id":"2303.16685","kind":"arxiv","version":1}},"canonical_sha256":"31cc6849eba58c9f5098db0dff3577ae9b5b060db384fcb3d7913a1596fc7c59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31cc6849eba58c9f5098db0dff3577ae9b5b060db384fcb3d7913a1596fc7c59","first_computed_at":"2026-07-05T05:56:09.237949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:09.237949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hc5MM05yftMYz6UzlFdoHgqbOTTe0HnVkjfqH9VthaFNjuppHTlQubOFuDdKXpmZdjUTC5jVzw/tZaP4fxB5Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:09.238363Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.16685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7d76cb5445fed807078b79624671bd276d5e6c95826b704cf562d668837430c","sha256:b5ef87051c86372a10c0f1305c3f8370314953cae6d0134ecce87ea444b8c57c"],"state_sha256":"eeedfed38b7d8fd6ae1ab7ff4ea0fb03b3d635695dff41a8e40508ad17e52837"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Arr3Zd/mmjPjA94IAdHlB3RNklUCa6Rvfio1qfEjSy4fT8SQoFeN++K/mICg6S2uHPpg6iXmchE70J4qLCzWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:30:57.516014Z","bundle_sha256":"dc03931b5755883ebf55ddc2d2165739a8878f2ebee368b774e5820b25e070d5"}}