{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZHUEGENAUTTOTPEJZBUW735X6U","short_pith_number":"pith:ZHUEGENA","canonical_record":{"source":{"id":"2506.00929","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-01T09:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"c8f00c11b8566d2f19602ce7a3ccb0ff01a62e7254f1a8839718801b2177eb56","abstract_canon_sha256":"c94727e224e2aa309b982dfa88cc0b90771e174880c163dcb60d3f0322f1688a"},"schema_version":"1.0"},"canonical_sha256":"c9e84311a0a4e6e9bc89c8696fefb7f50450a4af778b9bef5fc70bb1fa9b2621","source":{"kind":"arxiv","id":"2506.00929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00929","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00929v1","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00929","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZHUEGENAUTTO","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZHUEGENAUTTOTPEJ","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZHUEGENA","created_at":"2026-07-05T11:13:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZHUEGENAUTTOTPEJZBUW735X6U","target":"record","payload":{"canonical_record":{"source":{"id":"2506.00929","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-01T09:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"c8f00c11b8566d2f19602ce7a3ccb0ff01a62e7254f1a8839718801b2177eb56","abstract_canon_sha256":"c94727e224e2aa309b982dfa88cc0b90771e174880c163dcb60d3f0322f1688a"},"schema_version":"1.0"},"canonical_sha256":"c9e84311a0a4e6e9bc89c8696fefb7f50450a4af778b9bef5fc70bb1fa9b2621","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:42.977874Z","signature_b64":"9HemEL+ykTijgQeejrxClc9LF/rvT4JlxVS5S7rp4q3WICwmkoqkTQ03fXzsQYK4mf/CMQnBYWqginJZu+UdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9e84311a0a4e6e9bc89c8696fefb7f50450a4af778b9bef5fc70bb1fa9b2621","last_reissued_at":"2026-07-05T11:13:42.977395Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:42.977395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.00929","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-05T11:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QosPTS62Osc/O6kBzbKeLXNp1SQCkk7PdeO2Rr0LtHEBDnVuF9jkOo3AgdJFxl/oyAZXp7N8OD03CY85lSmJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:21:29.014453Z"},"content_sha256":"8056d4802ef39e7d52488354a22e47b69074af33ddbcc16e8cecf386430ba34c","schema_version":"1.0","event_id":"sha256:8056d4802ef39e7d52488354a22e47b69074af33ddbcc16e8cecf386430ba34c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZHUEGENAUTTOTPEJZBUW735X6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive, Efficient and Fair Resource Allocation in Cloud Datacenters leveraging Weighted A3C Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dhruv Mishra, Suchi Kumari","submitted_at":"2025-06-01T09:48:36Z","abstract_excerpt":"Cloud data centres demand adaptive, efficient, and fair resource allocation techniques due to heterogeneous workloads with varying priorities. However, most existing approaches struggle to cope with dynamic traffic patterns, often resulting in suboptimal fairness, increased latency, and higher energy consumption. To overcome these limitations, we propose a novel method called Weighted Actor-Critic Deep Reinforcement Learning (WA3C). Unlike static rule-based schedulers, WA3C continuously learns from the environment, making it resilient to changing workload patterns and system dynamics. Furtherm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00929","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/2506.00929/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-05T11:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"feVebF6O72CxUsEcbRwTfzaD6rryRYsfcI0vGlr4fsyLyiIYiHMqR/hQfdcMITGSNwWvlMS+K6CY4fnce6yfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T08:21:29.015326Z"},"content_sha256":"f2bb8e3b4ca9b7caee5c367d54812f8a0788ac1d62614fe3999b5b0090339ea9","schema_version":"1.0","event_id":"sha256:f2bb8e3b4ca9b7caee5c367d54812f8a0788ac1d62614fe3999b5b0090339ea9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHUEGENAUTTOTPEJZBUW735X6U/bundle.json","state_url":"https://pith.science/pith/ZHUEGENAUTTOTPEJZBUW735X6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHUEGENAUTTOTPEJZBUW735X6U/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-09T08:21:29Z","links":{"resolver":"https://pith.science/pith/ZHUEGENAUTTOTPEJZBUW735X6U","bundle":"https://pith.science/pith/ZHUEGENAUTTOTPEJZBUW735X6U/bundle.json","state":"https://pith.science/pith/ZHUEGENAUTTOTPEJZBUW735X6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHUEGENAUTTOTPEJZBUW735X6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZHUEGENAUTTOTPEJZBUW735X6U","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":"c94727e224e2aa309b982dfa88cc0b90771e174880c163dcb60d3f0322f1688a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-01T09:48:36Z","title_canon_sha256":"c8f00c11b8566d2f19602ce7a3ccb0ff01a62e7254f1a8839718801b2177eb56"},"schema_version":"1.0","source":{"id":"2506.00929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.00929","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2506.00929v1","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00929","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZHUEGENAUTTO","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZHUEGENAUTTOTPEJ","created_at":"2026-07-05T11:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZHUEGENA","created_at":"2026-07-05T11:13:42Z"}],"graph_snapshots":[{"event_id":"sha256:f2bb8e3b4ca9b7caee5c367d54812f8a0788ac1d62614fe3999b5b0090339ea9","target":"graph","created_at":"2026-07-05T11:13:42Z","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/2506.00929/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cloud data centres demand adaptive, efficient, and fair resource allocation techniques due to heterogeneous workloads with varying priorities. However, most existing approaches struggle to cope with dynamic traffic patterns, often resulting in suboptimal fairness, increased latency, and higher energy consumption. To overcome these limitations, we propose a novel method called Weighted Actor-Critic Deep Reinforcement Learning (WA3C). Unlike static rule-based schedulers, WA3C continuously learns from the environment, making it resilient to changing workload patterns and system dynamics. Furtherm","authors_text":"Dhruv Mishra, Suchi Kumari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-01T09:48:36Z","title":"Adaptive, Efficient and Fair Resource Allocation in Cloud Datacenters leveraging Weighted A3C Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00929","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:8056d4802ef39e7d52488354a22e47b69074af33ddbcc16e8cecf386430ba34c","target":"record","created_at":"2026-07-05T11:13:42Z","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":"c94727e224e2aa309b982dfa88cc0b90771e174880c163dcb60d3f0322f1688a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-06-01T09:48:36Z","title_canon_sha256":"c8f00c11b8566d2f19602ce7a3ccb0ff01a62e7254f1a8839718801b2177eb56"},"schema_version":"1.0","source":{"id":"2506.00929","kind":"arxiv","version":1}},"canonical_sha256":"c9e84311a0a4e6e9bc89c8696fefb7f50450a4af778b9bef5fc70bb1fa9b2621","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9e84311a0a4e6e9bc89c8696fefb7f50450a4af778b9bef5fc70bb1fa9b2621","first_computed_at":"2026-07-05T11:13:42.977395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:42.977395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9HemEL+ykTijgQeejrxClc9LF/rvT4JlxVS5S7rp4q3WICwmkoqkTQ03fXzsQYK4mf/CMQnBYWqginJZu+UdAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:42.977874Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.00929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8056d4802ef39e7d52488354a22e47b69074af33ddbcc16e8cecf386430ba34c","sha256:f2bb8e3b4ca9b7caee5c367d54812f8a0788ac1d62614fe3999b5b0090339ea9"],"state_sha256":"e9d8bf5c71529c690963c584724ff9c300dc47e9ec7efa03227aa468acb13ad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jolsrZevkJraULMP7le/ShdEpXokxbEk8VPB3phX37qYrOadwvx78YynLZo7A0Yqkusvndc/5vV4qvAU4nm3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T08:21:29.025883Z","bundle_sha256":"15bd0a85e68da0e5045732be04232c739b851464358da9540976205444403147"}}