{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SA7CALJ3EIZFKIMBFLOYCWQXUK","short_pith_number":"pith:SA7CALJ3","canonical_record":{"source":{"id":"1803.04385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T17:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"0c183f09cd5adda2316d378aee27a391dc07b6712fb86045be4a7dfb42d6f076","abstract_canon_sha256":"d2253f6f35e1f7535c3bd412cf04e4c821163133a061ab477c2720469e1865dd"},"schema_version":"1.0"},"canonical_sha256":"903e202d3b22325521812add815a17a2a9d7612513dbe2942aa0f1aaada192ca","source":{"kind":"arxiv","id":"1803.04385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04385","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04385v1","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04385","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"SA7CALJ3EIZF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SA7CALJ3EIZFKIMB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SA7CALJ3","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SA7CALJ3EIZFKIMBFLOYCWQXUK","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T17:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"0c183f09cd5adda2316d378aee27a391dc07b6712fb86045be4a7dfb42d6f076","abstract_canon_sha256":"d2253f6f35e1f7535c3bd412cf04e4c821163133a061ab477c2720469e1865dd"},"schema_version":"1.0"},"canonical_sha256":"903e202d3b22325521812add815a17a2a9d7612513dbe2942aa0f1aaada192ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:29.827766Z","signature_b64":"KO+I8mFEm9J5/BMMANFZYvrw+mzQMNd3vu9XqAzxvSouOToJJWVvX3uwxpvDeVeUj2Yc0z8gH/XymoC5rCE0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"903e202d3b22325521812add815a17a2a9d7612513dbe2942aa0f1aaada192ca","last_reissued_at":"2026-05-18T00:21:29.827202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:29.827202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04385","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-05-18T00:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAIycemc0FqIPJ5nY8VJw9+DTzQeRvSgXs/1qmnLkKxGvqyIidUztfPDYt9NvodwojTHES4CmWGQ/TLU3eCVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:42:28.014809Z"},"content_sha256":"a038045613a819f4614b9be0cd37eeb8fc1c74b2d04bef5d105d772e73ab0705","schema_version":"1.0","event_id":"sha256:a038045613a819f4614b9be0cd37eeb8fc1c74b2d04bef5d105d772e73ab0705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SA7CALJ3EIZFKIMBFLOYCWQXUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Auction-based approximate algorithm for Grid system scheduling under resource provider strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Arash Raeisi Gahrouei, Mehdi Ghatee","submitted_at":"2018-03-12T17:22:48Z","abstract_excerpt":"In this paper a new mathematical model is proposed for task scheduling and resource allocation in Grid systems. In this novel model, load balancing, starvation prevention and failing strategies are stated as the constraints and the solution is restricted with a predefined quality of service for users with different priorities. These strategies are defined by resource providers based on the amount of submitted jobs to Grid. To solve the proposed model, a modern approximate Auction-based algorithm is developed and it is implemented as a prototype of Grid simulator namely Multi-S-Grid. The result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04385","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"},"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-05-18T00:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8G8dY9FEIfmhBqJWTC5/RS7k+A57KT2a6hHo1IDRB85SwBSU0jbkp3pQru+Lq8ZEN8AyLpxBhBx3kVENKr3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:42:28.015155Z"},"content_sha256":"21ef0334aa7de3a54d037899efc16f5f4cf70c069ebb6429310e141987a04f55","schema_version":"1.0","event_id":"sha256:21ef0334aa7de3a54d037899efc16f5f4cf70c069ebb6429310e141987a04f55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK/bundle.json","state_url":"https://pith.science/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK/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-05T05:42:28Z","links":{"resolver":"https://pith.science/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK","bundle":"https://pith.science/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK/bundle.json","state":"https://pith.science/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SA7CALJ3EIZFKIMBFLOYCWQXUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SA7CALJ3EIZFKIMBFLOYCWQXUK","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":"d2253f6f35e1f7535c3bd412cf04e4c821163133a061ab477c2720469e1865dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T17:22:48Z","title_canon_sha256":"0c183f09cd5adda2316d378aee27a391dc07b6712fb86045be4a7dfb42d6f076"},"schema_version":"1.0","source":{"id":"1803.04385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04385","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04385v1","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04385","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"SA7CALJ3EIZF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SA7CALJ3EIZFKIMB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SA7CALJ3","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:21ef0334aa7de3a54d037899efc16f5f4cf70c069ebb6429310e141987a04f55","target":"graph","created_at":"2026-05-18T00:21:29Z","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"},"paper":{"abstract_excerpt":"In this paper a new mathematical model is proposed for task scheduling and resource allocation in Grid systems. In this novel model, load balancing, starvation prevention and failing strategies are stated as the constraints and the solution is restricted with a predefined quality of service for users with different priorities. These strategies are defined by resource providers based on the amount of submitted jobs to Grid. To solve the proposed model, a modern approximate Auction-based algorithm is developed and it is implemented as a prototype of Grid simulator namely Multi-S-Grid. The result","authors_text":"Arash Raeisi Gahrouei, Mehdi Ghatee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T17:22:48Z","title":"Auction-based approximate algorithm for Grid system scheduling under resource provider strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04385","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:a038045613a819f4614b9be0cd37eeb8fc1c74b2d04bef5d105d772e73ab0705","target":"record","created_at":"2026-05-18T00:21:29Z","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":"d2253f6f35e1f7535c3bd412cf04e4c821163133a061ab477c2720469e1865dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T17:22:48Z","title_canon_sha256":"0c183f09cd5adda2316d378aee27a391dc07b6712fb86045be4a7dfb42d6f076"},"schema_version":"1.0","source":{"id":"1803.04385","kind":"arxiv","version":1}},"canonical_sha256":"903e202d3b22325521812add815a17a2a9d7612513dbe2942aa0f1aaada192ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"903e202d3b22325521812add815a17a2a9d7612513dbe2942aa0f1aaada192ca","first_computed_at":"2026-05-18T00:21:29.827202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:29.827202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KO+I8mFEm9J5/BMMANFZYvrw+mzQMNd3vu9XqAzxvSouOToJJWVvX3uwxpvDeVeUj2Yc0z8gH/XymoC5rCE0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:29.827766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a038045613a819f4614b9be0cd37eeb8fc1c74b2d04bef5d105d772e73ab0705","sha256:21ef0334aa7de3a54d037899efc16f5f4cf70c069ebb6429310e141987a04f55"],"state_sha256":"055e3e19a490b5f95b4aec9c00c674ac554609b2c03a1da7097042291a333a78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i06G9OQjuNEUIj+nMHnjKoBW6XtOpW6HWdmNx1B5bfLPiIJ1GH4Ce6NQ7vTKQ8V8zTDWtmHbWlFYJpYz23YIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:42:28.017069Z","bundle_sha256":"f46bee8dff0028d69e1647157af095aa76f664ba17beaac79a12d1bb8fb6440c"}}