{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:E7757PVJOTWBRGMM7HE7IVCR46","short_pith_number":"pith:E7757PVJ","canonical_record":{"source":{"id":"1109.3076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-09-14T13:32:55Z","cross_cats_sorted":[],"title_canon_sha256":"44840be955d8d64e1a4a52341e8ed0f39221d1a351cced9dfb6cf706a73dcc8c","abstract_canon_sha256":"59d691d7e399a5a5527a40f5ae5afb48792420c34eedf345165c563ae48ebb6a"},"schema_version":"1.0"},"canonical_sha256":"27ffdfbea974ec18998cf9c9f45451e7b9f2009cdefe116084e728118e20f394","source":{"kind":"arxiv","id":"1109.3076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3076","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3076v1","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3076","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"E7757PVJOTWB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E7757PVJOTWBRGMM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E7757PVJ","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:E7757PVJOTWBRGMM7HE7IVCR46","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-09-14T13:32:55Z","cross_cats_sorted":[],"title_canon_sha256":"44840be955d8d64e1a4a52341e8ed0f39221d1a351cced9dfb6cf706a73dcc8c","abstract_canon_sha256":"59d691d7e399a5a5527a40f5ae5afb48792420c34eedf345165c563ae48ebb6a"},"schema_version":"1.0"},"canonical_sha256":"27ffdfbea974ec18998cf9c9f45451e7b9f2009cdefe116084e728118e20f394","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:06.347364Z","signature_b64":"dbJMKIfTh58NvlZjr12BBGhqoR0wchQH0PSqVE7sIlwoPwLuNzxvfRQgWbRaayk/FdA2iBsmpwvIiUDbtIZbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ffdfbea974ec18998cf9c9f45451e7b9f2009cdefe116084e728118e20f394","last_reissued_at":"2026-05-18T04:13:06.346964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:06.346964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3076","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-18T04:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COVMmK602JeXlZuOgyCKwqrsFHxr2VhsZ3z9TZZmNGcnfEgrGUzhrfuGnh/A1mztEDLNjX6UkMquEktZ/ozyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:15:34.814209Z"},"content_sha256":"869a3c55faf9d8ca5b7ca6bcf2757b4a7c9f4a5669bad3bde671977d54f4dbb6","schema_version":"1.0","event_id":"sha256:869a3c55faf9d8ca5b7ca6bcf2757b4a7c9f4a5669bad3bde671977d54f4dbb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:E7757PVJOTWBRGMM7HE7IVCR46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi","submitted_at":"2011-09-14T13:32:55Z","abstract_excerpt":"CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3076","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-18T04:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hK3cj4gBUPzqcGDghaEpXPDj7ujIz5l9n8E+nv/rcHTgLtGwO5WJIKrQi70p3Vbepq1xePa8MFYpKoUX0xMiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:15:34.814580Z"},"content_sha256":"d7b59f1d2b7ed6f302b248e36d2c694f7c8791794a5d4c28a2029d9f494a80db","schema_version":"1.0","event_id":"sha256:d7b59f1d2b7ed6f302b248e36d2c694f7c8791794a5d4c28a2029d9f494a80db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7757PVJOTWBRGMM7HE7IVCR46/bundle.json","state_url":"https://pith.science/pith/E7757PVJOTWBRGMM7HE7IVCR46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7757PVJOTWBRGMM7HE7IVCR46/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-06-03T20:15:34Z","links":{"resolver":"https://pith.science/pith/E7757PVJOTWBRGMM7HE7IVCR46","bundle":"https://pith.science/pith/E7757PVJOTWBRGMM7HE7IVCR46/bundle.json","state":"https://pith.science/pith/E7757PVJOTWBRGMM7HE7IVCR46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7757PVJOTWBRGMM7HE7IVCR46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:E7757PVJOTWBRGMM7HE7IVCR46","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":"59d691d7e399a5a5527a40f5ae5afb48792420c34eedf345165c563ae48ebb6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-09-14T13:32:55Z","title_canon_sha256":"44840be955d8d64e1a4a52341e8ed0f39221d1a351cced9dfb6cf706a73dcc8c"},"schema_version":"1.0","source":{"id":"1109.3076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3076","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3076v1","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3076","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"E7757PVJOTWB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"E7757PVJOTWBRGMM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"E7757PVJ","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:d7b59f1d2b7ed6f302b248e36d2c694f7c8791794a5d4c28a2029d9f494a80db","target":"graph","created_at":"2026-05-18T04:13:06Z","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":"CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficient technique in the process scheduling algorithm by using dynamic time quantum in Round Robin. Our approach is based on the calculation of time quantum twice in single round robin cycle. Taking into consideration the arrival time, we implement the al","authors_text":"H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-09-14T13:32:55Z","title":"Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3076","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:869a3c55faf9d8ca5b7ca6bcf2757b4a7c9f4a5669bad3bde671977d54f4dbb6","target":"record","created_at":"2026-05-18T04:13:06Z","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":"59d691d7e399a5a5527a40f5ae5afb48792420c34eedf345165c563ae48ebb6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-09-14T13:32:55Z","title_canon_sha256":"44840be955d8d64e1a4a52341e8ed0f39221d1a351cced9dfb6cf706a73dcc8c"},"schema_version":"1.0","source":{"id":"1109.3076","kind":"arxiv","version":1}},"canonical_sha256":"27ffdfbea974ec18998cf9c9f45451e7b9f2009cdefe116084e728118e20f394","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27ffdfbea974ec18998cf9c9f45451e7b9f2009cdefe116084e728118e20f394","first_computed_at":"2026-05-18T04:13:06.346964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:06.346964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dbJMKIfTh58NvlZjr12BBGhqoR0wchQH0PSqVE7sIlwoPwLuNzxvfRQgWbRaayk/FdA2iBsmpwvIiUDbtIZbBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:06.347364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:869a3c55faf9d8ca5b7ca6bcf2757b4a7c9f4a5669bad3bde671977d54f4dbb6","sha256:d7b59f1d2b7ed6f302b248e36d2c694f7c8791794a5d4c28a2029d9f494a80db"],"state_sha256":"ef7d643bd711808e0660e140cc91d8002c935ffa5f29250bec85706dd50d6d3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eNGijosFGTpMn7F/BrqKtKDwSovNNNIcKgfYdcC1vgB9VwUT3nFV5ezopfjp2UBNCtNspcnAxQ6NHdoePRECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:15:34.816430Z","bundle_sha256":"cd2395c965c9adb77d23b2027c60d339d397e8749a803ecd786379f9b557cc8b"}}