{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CS75EYAVT3PEOE4SAFVYQPWCY5","short_pith_number":"pith:CS75EYAV","schema_version":"1.0","canonical_sha256":"14bfd260159ede471392016b883ec2c7555f3b7937fb3947476f0a8fa2881729","source":{"kind":"arxiv","id":"1908.01167","version":1},"attestation_state":"computed","paper":{"title":"An Optimized Disk Scheduling Algorithm With Bad-Sector Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.OS","authors_text":"Amar Ranjan Dash, B Kewal, Sandipta Kumar Sahu","submitted_at":"2019-08-03T13:16:51Z","abstract_excerpt":"In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster and efficient working of computers. But a process needs both CPU bound and I/O bound for completion of its execution. With modernization of computers the speed of processor, hard-disk, and I/O devices increases gradually. Still the data access speed of hard-disk is much less than the speed of the processor. So when processor receives a data from secondary memory it executes immediately and again it have to wait for receiving another data. So the slowness of the hard-disk becomes a bottleneck in"},"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":"1908.01167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2019-08-03T13:16:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a7158bea024eb31b0c79f49e4798fc4f86a60d11a64f86a87afab5d1f29e8ab8","abstract_canon_sha256":"6ff7757c473fe8af3778e606d6c62bec4570d86eccbe9ba89c9c61eafc9dcde1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:27.669785Z","signature_b64":"DQ05GTARZHU6QGZ+A7nNxU922wuAjDsfzJAOMhl7ZmPdhNYh28YkOGDGSgsgrUSUZSA/+nMCqRTvz/qUeIV3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14bfd260159ede471392016b883ec2c7555f3b7937fb3947476f0a8fa2881729","last_reissued_at":"2026-07-04T23:51:27.669439Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:27.669439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimized Disk Scheduling Algorithm With Bad-Sector Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.OS","authors_text":"Amar Ranjan Dash, B Kewal, Sandipta Kumar Sahu","submitted_at":"2019-08-03T13:16:51Z","abstract_excerpt":"In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster and efficient working of computers. But a process needs both CPU bound and I/O bound for completion of its execution. With modernization of computers the speed of processor, hard-disk, and I/O devices increases gradually. Still the data access speed of hard-disk is much less than the speed of the processor. So when processor receives a data from secondary memory it executes immediately and again it have to wait for receiving another data. So the slowness of the hard-disk becomes a bottleneck in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01167","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/1908.01167/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.01167","created_at":"2026-07-04T23:51:27.669498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01167v1","created_at":"2026-07-04T23:51:27.669498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01167","created_at":"2026-07-04T23:51:27.669498+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS75EYAVT3PE","created_at":"2026-07-04T23:51:27.669498+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS75EYAVT3PEOE4S","created_at":"2026-07-04T23:51:27.669498+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS75EYAV","created_at":"2026-07-04T23:51:27.669498+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/CS75EYAVT3PEOE4SAFVYQPWCY5","json":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5.json","graph_json":"https://pith.science/api/pith-number/CS75EYAVT3PEOE4SAFVYQPWCY5/graph.json","events_json":"https://pith.science/api/pith-number/CS75EYAVT3PEOE4SAFVYQPWCY5/events.json","paper":"https://pith.science/paper/CS75EYAV"},"agent_actions":{"view_html":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5","download_json":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5.json","view_paper":"https://pith.science/paper/CS75EYAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01167&json=true","fetch_graph":"https://pith.science/api/pith-number/CS75EYAVT3PEOE4SAFVYQPWCY5/graph.json","fetch_events":"https://pith.science/api/pith-number/CS75EYAVT3PEOE4SAFVYQPWCY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5/action/storage_attestation","attest_author":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5/action/author_attestation","sign_citation":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5/action/citation_signature","submit_replication":"https://pith.science/pith/CS75EYAVT3PEOE4SAFVYQPWCY5/action/replication_record"}},"created_at":"2026-07-04T23:51:27.669498+00:00","updated_at":"2026-07-04T23:51:27.669498+00:00"}