{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VLSI6GRW2DLGNX5BQJ3UM6WNJI","short_pith_number":"pith:VLSI6GRW","canonical_record":{"source":{"id":"2101.03641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2021-01-10T23:54:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"109ec9acaecf9987a71d0d0440a1d018119e72085c82982b7abdf9fc395b983e","abstract_canon_sha256":"79fcb00181c8c42fb7e2f4be8b490ce381cc88c4de4f69ccd9e4f2b2bf1a8aad"},"schema_version":"1.0"},"canonical_sha256":"aae48f1a36d0d666dfa18277467acd4a12782d0b3946d488e96ad5c99a5e7020","source":{"kind":"arxiv","id":"2101.03641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.03641","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"2101.03641v2","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03641","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"VLSI6GRW2DLG","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"pith_short_16","alias_value":"VLSI6GRW2DLGNX5B","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"pith_short_8","alias_value":"VLSI6GRW","created_at":"2026-07-05T02:06:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VLSI6GRW2DLGNX5BQJ3UM6WNJI","target":"record","payload":{"canonical_record":{"source":{"id":"2101.03641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2021-01-10T23:54:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"109ec9acaecf9987a71d0d0440a1d018119e72085c82982b7abdf9fc395b983e","abstract_canon_sha256":"79fcb00181c8c42fb7e2f4be8b490ce381cc88c4de4f69ccd9e4f2b2bf1a8aad"},"schema_version":"1.0"},"canonical_sha256":"aae48f1a36d0d666dfa18277467acd4a12782d0b3946d488e96ad5c99a5e7020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:53.843895Z","signature_b64":"QBLtfHblkQoeReX1qh6tYl825tvo1LnksltL4iWxIt9uLnClfLGLs8lLLir0AAogHC8cjCrhSStUkzBqzOveBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae48f1a36d0d666dfa18277467acd4a12782d0b3946d488e96ad5c99a5e7020","last_reissued_at":"2026-07-05T02:06:53.843496Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:53.843496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.03641","source_version":2,"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:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ht6fWVypeNpnba42jY9te7z9tFq0Dvfcrmi/FZD1K9eWfwkqjQ6tNAb0oPMm/knnOv23jBfiWey//iUDMEnZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:29:41.678305Z"},"content_sha256":"71fdaa7a0a7b30e39ce139ea832d853b459a8c7f99a414042706b288e94ab9a8","schema_version":"1.0","event_id":"sha256:71fdaa7a0a7b30e39ce139ea832d853b459a8c7f99a414042706b288e94ab9a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VLSI6GRW2DLGNX5BQJ3UM6WNJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Augmented Index Policy for Optimal Service Placement at the Network Edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Guojun Xiong, Jian Li, Rahul Singh","submitted_at":"2021-01-10T23:54:59Z","abstract_excerpt":"We consider the problem of service placement at the network edge, in which a decision maker has to choose between $N$ services to host at the edge to satisfy the demands of customers. Our goal is to design adaptive algorithms to minimize the average service delivery latency for customers. We pose the problem as a Markov decision process (MDP) in which the system state is given by describing, for each service, the number of customers that are currently waiting at the edge to obtain the service. However, solving this $N$-services MDP is computationally expensive due to the curse of dimensionalit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03641","kind":"arxiv","version":2},"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.03641/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:06:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KAz/6WdpAGQyiCnrEjKMHHz8vNAdn7Swl2/SxYbpFies+jgKIeaV4JFJaPp3vylN1CPy3xmahSYunvLLW7qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:29:41.678692Z"},"content_sha256":"1083f0cc1ec649dc95b84aa46d31305b18aba31160c274188295a8aa71bac7b0","schema_version":"1.0","event_id":"sha256:1083f0cc1ec649dc95b84aa46d31305b18aba31160c274188295a8aa71bac7b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI/bundle.json","state_url":"https://pith.science/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI/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-07-06T23:29:41Z","links":{"resolver":"https://pith.science/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI","bundle":"https://pith.science/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI/bundle.json","state":"https://pith.science/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLSI6GRW2DLGNX5BQJ3UM6WNJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VLSI6GRW2DLGNX5BQJ3UM6WNJI","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":"79fcb00181c8c42fb7e2f4be8b490ce381cc88c4de4f69ccd9e4f2b2bf1a8aad","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2021-01-10T23:54:59Z","title_canon_sha256":"109ec9acaecf9987a71d0d0440a1d018119e72085c82982b7abdf9fc395b983e"},"schema_version":"1.0","source":{"id":"2101.03641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.03641","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"arxiv_version","alias_value":"2101.03641v2","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.03641","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"pith_short_12","alias_value":"VLSI6GRW2DLG","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"pith_short_16","alias_value":"VLSI6GRW2DLGNX5B","created_at":"2026-07-05T02:06:53Z"},{"alias_kind":"pith_short_8","alias_value":"VLSI6GRW","created_at":"2026-07-05T02:06:53Z"}],"graph_snapshots":[{"event_id":"sha256:1083f0cc1ec649dc95b84aa46d31305b18aba31160c274188295a8aa71bac7b0","target":"graph","created_at":"2026-07-05T02:06:53Z","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.03641/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of service placement at the network edge, in which a decision maker has to choose between $N$ services to host at the edge to satisfy the demands of customers. Our goal is to design adaptive algorithms to minimize the average service delivery latency for customers. We pose the problem as a Markov decision process (MDP) in which the system state is given by describing, for each service, the number of customers that are currently waiting at the edge to obtain the service. However, solving this $N$-services MDP is computationally expensive due to the curse of dimensionalit","authors_text":"Guojun Xiong, Jian Li, Rahul Singh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2021-01-10T23:54:59Z","title":"Learning Augmented Index Policy for Optimal Service Placement at the Network Edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.03641","kind":"arxiv","version":2},"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:71fdaa7a0a7b30e39ce139ea832d853b459a8c7f99a414042706b288e94ab9a8","target":"record","created_at":"2026-07-05T02:06:53Z","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":"79fcb00181c8c42fb7e2f4be8b490ce381cc88c4de4f69ccd9e4f2b2bf1a8aad","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2021-01-10T23:54:59Z","title_canon_sha256":"109ec9acaecf9987a71d0d0440a1d018119e72085c82982b7abdf9fc395b983e"},"schema_version":"1.0","source":{"id":"2101.03641","kind":"arxiv","version":2}},"canonical_sha256":"aae48f1a36d0d666dfa18277467acd4a12782d0b3946d488e96ad5c99a5e7020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aae48f1a36d0d666dfa18277467acd4a12782d0b3946d488e96ad5c99a5e7020","first_computed_at":"2026-07-05T02:06:53.843496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:53.843496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBLtfHblkQoeReX1qh6tYl825tvo1LnksltL4iWxIt9uLnClfLGLs8lLLir0AAogHC8cjCrhSStUkzBqzOveBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:53.843895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.03641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71fdaa7a0a7b30e39ce139ea832d853b459a8c7f99a414042706b288e94ab9a8","sha256:1083f0cc1ec649dc95b84aa46d31305b18aba31160c274188295a8aa71bac7b0"],"state_sha256":"2f5e5c493d32d1bde8951c4f8742feaba08fdf2c7fed4899f603eedf745414e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+4+qiCz/nGtvfDw86emtRXcJpcUbrK6740ZGMGQ/gN2SWAVJ22Da1wQS7DTVLTSyD1Fc00/QzHxnKsWf3N6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:29:41.680628Z","bundle_sha256":"1f90ba248d5849c704551039cdadef1509efef966f3a78d424845fef3a359535"}}