{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:XPAF4G64BWTON5BPSAGSUQUELP","short_pith_number":"pith:XPAF4G64","canonical_record":{"source":{"id":"2205.07314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.OS","submitted_at":"2022-05-15T15:38:59Z","cross_cats_sorted":[],"title_canon_sha256":"752486a6b1137c80b355156c3837110cf4a20cf837a562de9076ddd297546886","abstract_canon_sha256":"75835f768d636523aa49e71436cb644f68aa6a6c4acc115aac7234b33c4da851"},"schema_version":"1.0"},"canonical_sha256":"bbc05e1bdc0da6e6f42f900d2a42845be80cc550d2976dc8bbd4eefdca87f0e5","source":{"kind":"arxiv","id":"2205.07314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.07314","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2205.07314v1","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07314","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"XPAF4G64BWTO","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"XPAF4G64BWTON5BP","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"XPAF4G64","created_at":"2026-07-05T04:23:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:XPAF4G64BWTON5BPSAGSUQUELP","target":"record","payload":{"canonical_record":{"source":{"id":"2205.07314","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.OS","submitted_at":"2022-05-15T15:38:59Z","cross_cats_sorted":[],"title_canon_sha256":"752486a6b1137c80b355156c3837110cf4a20cf837a562de9076ddd297546886","abstract_canon_sha256":"75835f768d636523aa49e71436cb644f68aa6a6c4acc115aac7234b33c4da851"},"schema_version":"1.0"},"canonical_sha256":"bbc05e1bdc0da6e6f42f900d2a42845be80cc550d2976dc8bbd4eefdca87f0e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:27.561109Z","signature_b64":"++fHnlrKdOaDzalhNtALkUMN0zREeCxek6qtjqfLfbKRlya43GJ1INrza7oZaKhUn5RRADv8RUjkgaBidwHRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbc05e1bdc0da6e6f42f900d2a42845be80cc550d2976dc8bbd4eefdca87f0e5","last_reissued_at":"2026-07-05T04:23:27.560711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:27.560711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.07314","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-07-05T04:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVo0D7YsJ37s0xpId/Jls2yZqngCbVtNJ0eHLjDtqqw1IZHBhOYob5RlpSbgaC8ABjsF8SBelgtAdcesXBdUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:10:05.454221Z"},"content_sha256":"2c6c0653c9c72138240694c12e98b2b06e05d74cc9cbb45b2a55241f1f241789","schema_version":"1.0","event_id":"sha256:2c6c0653c9c72138240694c12e98b2b06e05d74cc9cbb45b2a55241f1f241789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:XPAF4G64BWTON5BPSAGSUQUELP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Ready Queue Based Process Priority Scheduling Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Aryaman Sinha, P. K. Gupta, Raghav Dalmia, Ruchi Verma","submitted_at":"2022-05-15T15:38:59Z","abstract_excerpt":"CPU scheduling is the reason behind the performance of multiprocessing and in time-shared operating systems. Different scheduling criteria are used to evaluate Central Processing Unit Scheduling algorithms which are based on different properties of the system. Round Robin is known to be the most recurrent pre-emptive algorithm used in an environment where processes are allotted a unit of time and multiprocessing operating systems. In this paper, a reformed variation of the Round Robin algorithm has been introduced to minimise the completion time, turnaround time, waiting time and number of con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07314","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/2205.07314/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-05T04:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAdFh1GjJkpCZxMRqTDsj8gVscAj36fziLnH1QABfM+miVsai76ai3MxXwDm6fiM7BxOF4PjcdE/CO6fecbVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:10:05.454717Z"},"content_sha256":"58e35a4095cfbeaf4e1c6055e640f8a8216953bdf5cfe737f105db7fc655cc76","schema_version":"1.0","event_id":"sha256:58e35a4095cfbeaf4e1c6055e640f8a8216953bdf5cfe737f105db7fc655cc76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPAF4G64BWTON5BPSAGSUQUELP/bundle.json","state_url":"https://pith.science/pith/XPAF4G64BWTON5BPSAGSUQUELP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPAF4G64BWTON5BPSAGSUQUELP/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-08-07T05:10:05Z","links":{"resolver":"https://pith.science/pith/XPAF4G64BWTON5BPSAGSUQUELP","bundle":"https://pith.science/pith/XPAF4G64BWTON5BPSAGSUQUELP/bundle.json","state":"https://pith.science/pith/XPAF4G64BWTON5BPSAGSUQUELP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPAF4G64BWTON5BPSAGSUQUELP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XPAF4G64BWTON5BPSAGSUQUELP","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":"75835f768d636523aa49e71436cb644f68aa6a6c4acc115aac7234b33c4da851","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.OS","submitted_at":"2022-05-15T15:38:59Z","title_canon_sha256":"752486a6b1137c80b355156c3837110cf4a20cf837a562de9076ddd297546886"},"schema_version":"1.0","source":{"id":"2205.07314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.07314","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2205.07314v1","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.07314","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"XPAF4G64BWTO","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"XPAF4G64BWTON5BP","created_at":"2026-07-05T04:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"XPAF4G64","created_at":"2026-07-05T04:23:27Z"}],"graph_snapshots":[{"event_id":"sha256:58e35a4095cfbeaf4e1c6055e640f8a8216953bdf5cfe737f105db7fc655cc76","target":"graph","created_at":"2026-07-05T04:23:27Z","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/2205.07314/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"CPU scheduling is the reason behind the performance of multiprocessing and in time-shared operating systems. Different scheduling criteria are used to evaluate Central Processing Unit Scheduling algorithms which are based on different properties of the system. Round Robin is known to be the most recurrent pre-emptive algorithm used in an environment where processes are allotted a unit of time and multiprocessing operating systems. In this paper, a reformed variation of the Round Robin algorithm has been introduced to minimise the completion time, turnaround time, waiting time and number of con","authors_text":"Aryaman Sinha, P. K. Gupta, Raghav Dalmia, Ruchi Verma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.OS","submitted_at":"2022-05-15T15:38:59Z","title":"Dynamic Ready Queue Based Process Priority Scheduling Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.07314","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:2c6c0653c9c72138240694c12e98b2b06e05d74cc9cbb45b2a55241f1f241789","target":"record","created_at":"2026-07-05T04:23:27Z","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":"75835f768d636523aa49e71436cb644f68aa6a6c4acc115aac7234b33c4da851","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.OS","submitted_at":"2022-05-15T15:38:59Z","title_canon_sha256":"752486a6b1137c80b355156c3837110cf4a20cf837a562de9076ddd297546886"},"schema_version":"1.0","source":{"id":"2205.07314","kind":"arxiv","version":1}},"canonical_sha256":"bbc05e1bdc0da6e6f42f900d2a42845be80cc550d2976dc8bbd4eefdca87f0e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbc05e1bdc0da6e6f42f900d2a42845be80cc550d2976dc8bbd4eefdca87f0e5","first_computed_at":"2026-07-05T04:23:27.560711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:23:27.560711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++fHnlrKdOaDzalhNtALkUMN0zREeCxek6qtjqfLfbKRlya43GJ1INrza7oZaKhUn5RRADv8RUjkgaBidwHRDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:23:27.561109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.07314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c6c0653c9c72138240694c12e98b2b06e05d74cc9cbb45b2a55241f1f241789","sha256:58e35a4095cfbeaf4e1c6055e640f8a8216953bdf5cfe737f105db7fc655cc76"],"state_sha256":"c3ec0e58c42f08d61261321279d4f0103e0a3839a05c5bc86bc99d1c84cd5f41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CcQGESO+nvRRZHHmJJOWTPdBr4B+FI1JVV/pO5EPXYzMQnkxk8qGoGKvdUw3vcVnYKcMGk4uq9GXQIPJI9SXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:10:05.457668Z","bundle_sha256":"b5781f3ec1335b8f7f859058e635d48869e4d3da436070051ea1be79d5c2cf4c"}}