{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VQZLWJO6NF2O5UNLCA5SDDS4VL","short_pith_number":"pith:VQZLWJO6","schema_version":"1.0","canonical_sha256":"ac32bb25de6974eed1ab103b218e5caadf747a159ee1c08707bef29ddac6ef4e","source":{"kind":"arxiv","id":"1503.07038","version":1},"attestation_state":"computed","paper":{"title":"A QoS aware Novel Probabilistic strategy for Dynamic Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aravind Sundaresan, Bidisha Goswami, G Arun Kumar, Snehanshu Saha","submitted_at":"2015-03-24T13:52:51Z","abstract_excerpt":"The paper proposes a two player game based strategy for resource allocation in service computing domain such as cloud, grid etc. The players are modeled as demand/workflows for the resource and represent multiple types of qualitative and quantitative factors. The proposed strategy will classify them in two classes. The proposed system would forecast outcome using a priori information available and measure/estimate existing parameters such as utilization and delay in an optimal load-balanced paradigm.\n  Keywords: Load balancing; service computing; Logistic Regression; probabilistic estimation"},"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":"1503.07038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-24T13:52:51Z","cross_cats_sorted":[],"title_canon_sha256":"5c85f72aee2824766ed91622e924f02cec92c26a2952ded9d3665fc317f12ff5","abstract_canon_sha256":"f948828d4b5d7077967e338af9ba28bbdeb283b56955dbb41f5b6c904b065c82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.481650Z","signature_b64":"C4MGcJzPpqgUJCztK74cQDjJdSnI3hHQMCPSn+0jyVOZv8Jc4qpQpRnoVARXipuT2C1aPR0GVQfpCEhsijSEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac32bb25de6974eed1ab103b218e5caadf747a159ee1c08707bef29ddac6ef4e","last_reissued_at":"2026-05-18T02:20:29.481166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.481166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A QoS aware Novel Probabilistic strategy for Dynamic Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aravind Sundaresan, Bidisha Goswami, G Arun Kumar, Snehanshu Saha","submitted_at":"2015-03-24T13:52:51Z","abstract_excerpt":"The paper proposes a two player game based strategy for resource allocation in service computing domain such as cloud, grid etc. The players are modeled as demand/workflows for the resource and represent multiple types of qualitative and quantitative factors. The proposed strategy will classify them in two classes. The proposed system would forecast outcome using a priori information available and measure/estimate existing parameters such as utilization and delay in an optimal load-balanced paradigm.\n  Keywords: Load balancing; service computing; Logistic Regression; probabilistic estimation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07038","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":""},"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":"1503.07038","created_at":"2026-05-18T02:20:29.481241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07038v1","created_at":"2026-05-18T02:20:29.481241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07038","created_at":"2026-05-18T02:20:29.481241+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQZLWJO6NF2O","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQZLWJO6NF2O5UNL","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQZLWJO6","created_at":"2026-05-18T12:29:47.479230+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/VQZLWJO6NF2O5UNLCA5SDDS4VL","json":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL.json","graph_json":"https://pith.science/api/pith-number/VQZLWJO6NF2O5UNLCA5SDDS4VL/graph.json","events_json":"https://pith.science/api/pith-number/VQZLWJO6NF2O5UNLCA5SDDS4VL/events.json","paper":"https://pith.science/paper/VQZLWJO6"},"agent_actions":{"view_html":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL","download_json":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL.json","view_paper":"https://pith.science/paper/VQZLWJO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07038&json=true","fetch_graph":"https://pith.science/api/pith-number/VQZLWJO6NF2O5UNLCA5SDDS4VL/graph.json","fetch_events":"https://pith.science/api/pith-number/VQZLWJO6NF2O5UNLCA5SDDS4VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL/action/storage_attestation","attest_author":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL/action/author_attestation","sign_citation":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL/action/citation_signature","submit_replication":"https://pith.science/pith/VQZLWJO6NF2O5UNLCA5SDDS4VL/action/replication_record"}},"created_at":"2026-05-18T02:20:29.481241+00:00","updated_at":"2026-05-18T02:20:29.481241+00:00"}