{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UAI4CHEF7YQXE5P542FHTO3MYO","short_pith_number":"pith:UAI4CHEF","canonical_record":{"source":{"id":"1403.0335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2014-03-03T08:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"77f6349e60e845b1646814de48ce8b1a09052c18ea1c20bb952b3c8f19e9b9e0","abstract_canon_sha256":"17d6fc1406d34039eb150473703151aacb6514237dd03b447bef3efb476d5bc5"},"schema_version":"1.0"},"canonical_sha256":"a011c11c85fe217275fde68a79bb6cc39d38fb2145563a1a0be11eef0bf0bd77","source":{"kind":"arxiv","id":"1403.0335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0335","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0335v1","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0335","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"UAI4CHEF7YQX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UAI4CHEF7YQXE5P5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UAI4CHEF","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UAI4CHEF7YQXE5P542FHTO3MYO","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2014-03-03T08:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"77f6349e60e845b1646814de48ce8b1a09052c18ea1c20bb952b3c8f19e9b9e0","abstract_canon_sha256":"17d6fc1406d34039eb150473703151aacb6514237dd03b447bef3efb476d5bc5"},"schema_version":"1.0"},"canonical_sha256":"a011c11c85fe217275fde68a79bb6cc39d38fb2145563a1a0be11eef0bf0bd77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:25.154392Z","signature_b64":"DePLp+rEETEm2wRDBaPIiRPSDg1PX57VcVZqgwdpDhqfObwqZHQV3SDTZPspM1KwN70KmWZPa8ewGocrbxr5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a011c11c85fe217275fde68a79bb6cc39d38fb2145563a1a0be11eef0bf0bd77","last_reissued_at":"2026-05-18T02:57:25.153828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:25.153828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0335","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-18T02:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pkWwq9QLqHNeciJb7Gs/h7+7BFZ1nXImt6rXU1jz1ayOle42My64MsWw4TuFyeA3G/4yGvZ82mTy8REVMTqfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:03:10.610065Z"},"content_sha256":"07b737ce53a5650782b10b06a317e0fa46471514583ea308b9e34c3438748c54","schema_version":"1.0","event_id":"sha256:07b737ce53a5650782b10b06a317e0fa46471514583ea308b9e34c3438748c54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UAI4CHEF7YQXE5P542FHTO3MYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Group based Time Quantum Round Robin Algorithm using Min-Max Spread Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Debasis Dash, Jitendra Kumar Rout, Sanjaya Kumar Panda","submitted_at":"2014-03-03T08:27:29Z","abstract_excerpt":"Round Robin (RR) Scheduling is the basis of time sharing environment. It is the combination of First Come First Served (FCFS) scheduling algorithm and preemption among processes. It is basically used in a time sharing operating system. It switches from one process to another process in a time interval. The time interval or Time Quantum (TQ) is fixed for all available processes. So, the larger process suffers from Context Switches (CS). To increase efficiency, we have to select different TQ for processes. The main objective of RR is to reduce the CS, maximize the utilization of CPU and minimize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0335","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-18T02:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1Byzzc3A4C6enSVDdQ+/cOEwerLrlZ1rubLYibr2hmSWEG+alCyrDmLso+Hai2QneZMCLFMuJWSyW9/9D+kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T21:03:10.610527Z"},"content_sha256":"9405fd01e71df42fc7a853cd1daa3bf1f1dcba80d72d43085d03216018a05eff","schema_version":"1.0","event_id":"sha256:9405fd01e71df42fc7a853cd1daa3bf1f1dcba80d72d43085d03216018a05eff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAI4CHEF7YQXE5P542FHTO3MYO/bundle.json","state_url":"https://pith.science/pith/UAI4CHEF7YQXE5P542FHTO3MYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAI4CHEF7YQXE5P542FHTO3MYO/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-03T21:03:10Z","links":{"resolver":"https://pith.science/pith/UAI4CHEF7YQXE5P542FHTO3MYO","bundle":"https://pith.science/pith/UAI4CHEF7YQXE5P542FHTO3MYO/bundle.json","state":"https://pith.science/pith/UAI4CHEF7YQXE5P542FHTO3MYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAI4CHEF7YQXE5P542FHTO3MYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UAI4CHEF7YQXE5P542FHTO3MYO","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":"17d6fc1406d34039eb150473703151aacb6514237dd03b447bef3efb476d5bc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2014-03-03T08:27:29Z","title_canon_sha256":"77f6349e60e845b1646814de48ce8b1a09052c18ea1c20bb952b3c8f19e9b9e0"},"schema_version":"1.0","source":{"id":"1403.0335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0335","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0335v1","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0335","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"UAI4CHEF7YQX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UAI4CHEF7YQXE5P5","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UAI4CHEF","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:9405fd01e71df42fc7a853cd1daa3bf1f1dcba80d72d43085d03216018a05eff","target":"graph","created_at":"2026-05-18T02:57:25Z","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":"Round Robin (RR) Scheduling is the basis of time sharing environment. It is the combination of First Come First Served (FCFS) scheduling algorithm and preemption among processes. It is basically used in a time sharing operating system. It switches from one process to another process in a time interval. The time interval or Time Quantum (TQ) is fixed for all available processes. So, the larger process suffers from Context Switches (CS). To increase efficiency, we have to select different TQ for processes. The main objective of RR is to reduce the CS, maximize the utilization of CPU and minimize","authors_text":"Debasis Dash, Jitendra Kumar Rout, Sanjaya Kumar Panda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2014-03-03T08:27:29Z","title":"A Group based Time Quantum Round Robin Algorithm using Min-Max Spread Measure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0335","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:07b737ce53a5650782b10b06a317e0fa46471514583ea308b9e34c3438748c54","target":"record","created_at":"2026-05-18T02:57:25Z","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":"17d6fc1406d34039eb150473703151aacb6514237dd03b447bef3efb476d5bc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2014-03-03T08:27:29Z","title_canon_sha256":"77f6349e60e845b1646814de48ce8b1a09052c18ea1c20bb952b3c8f19e9b9e0"},"schema_version":"1.0","source":{"id":"1403.0335","kind":"arxiv","version":1}},"canonical_sha256":"a011c11c85fe217275fde68a79bb6cc39d38fb2145563a1a0be11eef0bf0bd77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a011c11c85fe217275fde68a79bb6cc39d38fb2145563a1a0be11eef0bf0bd77","first_computed_at":"2026-05-18T02:57:25.153828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:25.153828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DePLp+rEETEm2wRDBaPIiRPSDg1PX57VcVZqgwdpDhqfObwqZHQV3SDTZPspM1KwN70KmWZPa8ewGocrbxr5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:25.154392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07b737ce53a5650782b10b06a317e0fa46471514583ea308b9e34c3438748c54","sha256:9405fd01e71df42fc7a853cd1daa3bf1f1dcba80d72d43085d03216018a05eff"],"state_sha256":"d2dd6dc0f2cf6726c2de71d7e983273a7d213ddf6ba0e647d91206abe656dda6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BtyomaVhmSETj5EwUfxRLC5Z1AbBW1CK5raP9fPS/mXdNO/Rv/XcpwMytrqNJWk/Ue+Z56p3dpsCMhLccvaCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T21:03:10.615497Z","bundle_sha256":"b4e01202eb557fa79e365d06b290dd81cc14d51571472a1597e901f46ab66e7b"}}