{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BZ4JL5TLSBRP2IYNYENHVH35PT","short_pith_number":"pith:BZ4JL5TL","schema_version":"1.0","canonical_sha256":"0e7895f66b9062fd230dc11a7a9f7d7cf0049658488f4d9b8e2a3793a5f0c47a","source":{"kind":"arxiv","id":"1710.11471","version":4},"attestation_state":"computed","paper":{"title":"Distributed Server Allocation for Content Delivery Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.PF","authors_text":"Gaurav S. Kasbekar, Sarath Pattathil, Vivek S. Borkar","submitted_at":"2017-10-28T10:46:22Z","abstract_excerpt":"We propose a dynamic formulation of file-sharing networks in terms of an average cost Markov decision process with constraints. By analyzing a Whittle-like relaxation thereof, we propose an index policy in the spirit of Whittle and compare it by simulations with other natural heuristics."},"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":"1710.11471","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-28T10:46:22Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"401cc1556812c2b09ab5d6d8dabefb63d5ab355b57cfc12292b38bddca45725c","abstract_canon_sha256":"41d160a0e453222f040070c347407e7f136c46a2dfd5ce3747fe299e0e73b6eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.636227Z","signature_b64":"9TBtLUzdRKYmaE1baKptROWnH8JSR+iI/DAmAvaM75XjoqjbVbju7T/UqX+3gqJQcR7lTizm3XXCcWvHp0miDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e7895f66b9062fd230dc11a7a9f7d7cf0049658488f4d9b8e2a3793a5f0c47a","last_reissued_at":"2026-05-17T23:54:26.635657Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.635657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Server Allocation for Content Delivery Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.PF","authors_text":"Gaurav S. Kasbekar, Sarath Pattathil, Vivek S. Borkar","submitted_at":"2017-10-28T10:46:22Z","abstract_excerpt":"We propose a dynamic formulation of file-sharing networks in terms of an average cost Markov decision process with constraints. By analyzing a Whittle-like relaxation thereof, we propose an index policy in the spirit of Whittle and compare it by simulations with other natural heuristics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11471","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1710.11471","created_at":"2026-05-17T23:54:26.635735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11471v4","created_at":"2026-05-17T23:54:26.635735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11471","created_at":"2026-05-17T23:54:26.635735+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZ4JL5TLSBRP","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZ4JL5TLSBRP2IYN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZ4JL5TL","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10946","citing_title":"A unifying computations of Whittle's Index for Markovian bandits","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT","json":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT.json","graph_json":"https://pith.science/api/pith-number/BZ4JL5TLSBRP2IYNYENHVH35PT/graph.json","events_json":"https://pith.science/api/pith-number/BZ4JL5TLSBRP2IYNYENHVH35PT/events.json","paper":"https://pith.science/paper/BZ4JL5TL"},"agent_actions":{"view_html":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT","download_json":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT.json","view_paper":"https://pith.science/paper/BZ4JL5TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11471&json=true","fetch_graph":"https://pith.science/api/pith-number/BZ4JL5TLSBRP2IYNYENHVH35PT/graph.json","fetch_events":"https://pith.science/api/pith-number/BZ4JL5TLSBRP2IYNYENHVH35PT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT/action/storage_attestation","attest_author":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT/action/author_attestation","sign_citation":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT/action/citation_signature","submit_replication":"https://pith.science/pith/BZ4JL5TLSBRP2IYNYENHVH35PT/action/replication_record"}},"created_at":"2026-05-17T23:54:26.635735+00:00","updated_at":"2026-05-17T23:54:26.635735+00:00"}