{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GWM6BGNWLSXPKROOWGVVFBMGEX","short_pith_number":"pith:GWM6BGNW","schema_version":"1.0","canonical_sha256":"3599e099b65caef545ceb1ab52858625d5ca26859249b0780440403f3d7a2090","source":{"kind":"arxiv","id":"2505.00299","version":1},"attestation_state":"computed","paper":{"title":"Intelligent Task Scheduling for Microservices via A3C-Based Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Tengda Tang, Yang Wang, Yifei Duan, Yingnan Deng, Zhou Fang","submitted_at":"2025-05-01T04:42:48Z","abstract_excerpt":"To address the challenges of high resource dynamism and intensive task concurrency in microservice systems, this paper proposes an adaptive resource scheduling method based on the A3C reinforcement learning algorithm. The scheduling problem is modeled as a Markov Decision Process, where policy and value networks are jointly optimized to enable fine-grained resource allocation under varying load conditions. The method incorporates an asynchronous multi-threaded learning mechanism, allowing multiple agents to perform parallel sampling and synchronize updates to the global network parameters. Thi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.00299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-01T04:42:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"359912eb135067d8f88a81d217fc471e310f1be3938fe20d1c9bd0efe04efad7","abstract_canon_sha256":"8d90d382e035ecb663a2ecc86b4d2d78d144017757c004ca1879fe122d45087a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:11.181953Z","signature_b64":"TiYSkehjzPXjUao74/V8gusTaoJAKiUdIyZKwleDbWSCes8Ce79jTHSrHZjKh1QmklZJBZRGXWrQ1SFIQxdkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3599e099b65caef545ceb1ab52858625d5ca26859249b0780440403f3d7a2090","last_reissued_at":"2026-07-05T10:57:11.181440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:11.181440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intelligent Task Scheduling for Microservices via A3C-Based Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Tengda Tang, Yang Wang, Yifei Duan, Yingnan Deng, Zhou Fang","submitted_at":"2025-05-01T04:42:48Z","abstract_excerpt":"To address the challenges of high resource dynamism and intensive task concurrency in microservice systems, this paper proposes an adaptive resource scheduling method based on the A3C reinforcement learning algorithm. The scheduling problem is modeled as a Markov Decision Process, where policy and value networks are jointly optimized to enable fine-grained resource allocation under varying load conditions. The method incorporates an asynchronous multi-threaded learning mechanism, allowing multiple agents to perform parallel sampling and synchronize updates to the global network parameters. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00299","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/2505.00299/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.00299","created_at":"2026-07-05T10:57:11.181501+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.00299v1","created_at":"2026-07-05T10:57:11.181501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00299","created_at":"2026-07-05T10:57:11.181501+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWM6BGNWLSXP","created_at":"2026-07-05T10:57:11.181501+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWM6BGNWLSXPKROO","created_at":"2026-07-05T10:57:11.181501+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWM6BGNW","created_at":"2026-07-05T10:57:11.181501+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX","json":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX.json","graph_json":"https://pith.science/api/pith-number/GWM6BGNWLSXPKROOWGVVFBMGEX/graph.json","events_json":"https://pith.science/api/pith-number/GWM6BGNWLSXPKROOWGVVFBMGEX/events.json","paper":"https://pith.science/paper/GWM6BGNW"},"agent_actions":{"view_html":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX","download_json":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX.json","view_paper":"https://pith.science/paper/GWM6BGNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.00299&json=true","fetch_graph":"https://pith.science/api/pith-number/GWM6BGNWLSXPKROOWGVVFBMGEX/graph.json","fetch_events":"https://pith.science/api/pith-number/GWM6BGNWLSXPKROOWGVVFBMGEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX/action/storage_attestation","attest_author":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX/action/author_attestation","sign_citation":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX/action/citation_signature","submit_replication":"https://pith.science/pith/GWM6BGNWLSXPKROOWGVVFBMGEX/action/replication_record"}},"created_at":"2026-07-05T10:57:11.181501+00:00","updated_at":"2026-07-05T10:57:11.181501+00:00"}